/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix018_tso.oepc.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.25-b09bf87
[2020-10-16 11:08:40,424 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2020-10-16 11:08:40,427 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-16 11:08:40,452 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-16 11:08:40,452 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-16 11:08:40,453 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-16 11:08:40,454 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-16 11:08:40,456 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-16 11:08:40,458 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-16 11:08:40,459 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-16 11:08:40,460 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2020-10-16 11:08:40,461 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-16 11:08:40,461 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-16 11:08:40,462 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-16 11:08:40,464 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-16 11:08:40,465 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-16 11:08:40,466 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-16 11:08:40,467 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-16 11:08:40,469 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-16 11:08:40,471 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-16 11:08:40,473 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-16 11:08:40,474 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-16 11:08:40,475 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2020-10-16 11:08:40,476 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-16 11:08:40,479 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-16 11:08:40,479 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-16 11:08:40,479 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-16 11:08:40,480 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-16 11:08:40,481 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-16 11:08:40,482 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-16 11:08:40,482 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-16 11:08:40,483 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-16 11:08:40,484 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-16 11:08:40,485 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-16 11:08:40,486 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-16 11:08:40,486 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-16 11:08:40,488 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-16 11:08:40,488 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-16 11:08:40,489 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-16 11:08:40,490 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-16 11:08:40,490 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2020-10-16 11:08:40,492 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2020-10-16 11:08:40,542 INFO L113 SettingsManager]: Loading preferences was successful
[2020-10-16 11:08:40,543 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-16 11:08:40,544 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-16 11:08:40,544 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2020-10-16 11:08:40,544 INFO L138 SettingsManager]: * Use SBE=true
[2020-10-16 11:08:40,545 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-16 11:08:40,545 INFO L138 SettingsManager]: * sizeof long=4
[2020-10-16 11:08:40,545 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2020-10-16 11:08:40,545 INFO L138 SettingsManager]: * sizeof POINTER=4
[2020-10-16 11:08:40,545 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2020-10-16 11:08:40,545 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2020-10-16 11:08:40,546 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-16 11:08:40,546 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2020-10-16 11:08:40,551 INFO L138 SettingsManager]: * sizeof long double=12
[2020-10-16 11:08:40,551 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2020-10-16 11:08:40,552 INFO L138 SettingsManager]: * Use constant arrays=true
[2020-10-16 11:08:40,552 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2020-10-16 11:08:40,552 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-16 11:08:40,552 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2020-10-16 11:08:40,552 INFO L138 SettingsManager]: * To the following directory=./dump/
[2020-10-16 11:08:40,553 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2020-10-16 11:08:40,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 11:08:40,553 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-16 11:08:40,553 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2020-10-16 11:08:40,553 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-16 11:08:40,553 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2020-10-16 11:08:40,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-16 11:08:40,554 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-16 11:08:40,555 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE
[2020-10-16 11:08:40,556 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2020-10-16 11:08:40,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-16 11:08:40,899 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-16 11:08:40,902 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-16 11:08:40,904 INFO L271 PluginConnector]: Initializing CDTParser...
[2020-10-16 11:08:40,904 INFO L275 PluginConnector]: CDTParser initialized
[2020-10-16 11:08:40,905 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix018_tso.oepc.i
[2020-10-16 11:08:40,974 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f24a85af1/208e23ca280840a99a2e236fafc9967d/FLAGf8a51e0c9
[2020-10-16 11:08:41,550 INFO L306 CDTParser]: Found 1 translation units.
[2020-10-16 11:08:41,550 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/mix018_tso.oepc.i
[2020-10-16 11:08:41,567 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f24a85af1/208e23ca280840a99a2e236fafc9967d/FLAGf8a51e0c9
[2020-10-16 11:08:41,844 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f24a85af1/208e23ca280840a99a2e236fafc9967d
[2020-10-16 11:08:41,856 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-16 11:08:41,858 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-16 11:08:41,859 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-16 11:08:41,860 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-16 11:08:41,863 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-16 11:08:41,865 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:08:41" (1/1) ...
[2020-10-16 11:08:41,868 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73e6a114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:08:41, skipping insertion in model container
[2020-10-16 11:08:41,868 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:08:41" (1/1) ...
[2020-10-16 11:08:41,876 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2020-10-16 11:08:41,953 INFO L178 MainTranslator]: Built tables and reachable declarations
[2020-10-16 11:08:42,452 INFO L206 PostProcessor]: Analyzing one entry point: main
[2020-10-16 11:08:42,475 INFO L203 MainTranslator]: Completed pre-run
[2020-10-16 11:08:42,590 INFO L206 PostProcessor]: Analyzing one entry point: main
[2020-10-16 11:08:42,673 INFO L208 MainTranslator]: Completed translation
[2020-10-16 11:08:42,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:08:42 WrapperNode
[2020-10-16 11:08:42,674 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-16 11:08:42,675 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-16 11:08:42,675 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-16 11:08:42,675 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-16 11:08:42,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:08:42" (1/1) ...
[2020-10-16 11:08:42,704 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:08:42" (1/1) ...
[2020-10-16 11:08:42,744 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-16 11:08:42,745 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-16 11:08:42,745 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-16 11:08:42,745 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2020-10-16 11:08:42,755 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:08:42" (1/1) ...
[2020-10-16 11:08:42,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:08:42" (1/1) ...
[2020-10-16 11:08:42,763 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:08:42" (1/1) ...
[2020-10-16 11:08:42,764 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:08:42" (1/1) ...
[2020-10-16 11:08:42,790 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:08:42" (1/1) ...
[2020-10-16 11:08:42,795 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:08:42" (1/1) ...
[2020-10-16 11:08:42,800 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:08:42" (1/1) ...
[2020-10-16 11:08:42,805 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-16 11:08:42,808 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-16 11:08:42,808 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2020-10-16 11:08:42,808 INFO L275 PluginConnector]: RCFGBuilder initialized
[2020-10-16 11:08:42,809 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:08:42" (1/1) ...
No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 11:08:42,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2020-10-16 11:08:42,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-16 11:08:42,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-16 11:08:42,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-16 11:08:42,877 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2020-10-16 11:08:42,878 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2020-10-16 11:08:42,878 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2020-10-16 11:08:42,878 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2020-10-16 11:08:42,878 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2020-10-16 11:08:42,879 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2020-10-16 11:08:42,879 INFO L130 BoogieDeclarations]: Found specification of procedure P3
[2020-10-16 11:08:42,879 INFO L138 BoogieDeclarations]: Found implementation of procedure P3
[2020-10-16 11:08:42,879 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-16 11:08:42,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-16 11:08:42,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-16 11:08:42,882 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-10-16 11:08:45,346 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-16 11:08:45,346 INFO L298 CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-16 11:08:45,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:08:45 BoogieIcfgContainer
[2020-10-16 11:08:45,349 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-16 11:08:45,350 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-16 11:08:45,351 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2020-10-16 11:08:45,354 INFO L275 PluginConnector]: TraceAbstraction initialized
[2020-10-16 11:08:45,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 11:08:41" (1/3) ...
[2020-10-16 11:08:45,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@281af578 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:08:45, skipping insertion in model container
[2020-10-16 11:08:45,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:08:42" (2/3) ...
[2020-10-16 11:08:45,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@281af578 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:08:45, skipping insertion in model container
[2020-10-16 11:08:45,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:08:45" (3/3) ...
[2020-10-16 11:08:45,359 INFO L111 eAbstractionObserver]: Analyzing ICFG mix018_tso.oepc.i
[2020-10-16 11:08:45,371 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-16 11:08:45,371 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-10-16 11:08:45,380 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-16 11:08:45,381 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-16 11:08:45,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,415 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,415 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,415 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,416 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,416 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,416 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,416 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,416 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,417 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,417 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,417 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,418 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,418 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,418 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,418 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,419 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,419 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,419 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,419 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,420 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,420 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,420 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,420 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,420 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,421 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,421 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,421 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,421 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,422 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,422 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,422 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,422 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,423 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,423 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,423 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,423 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,423 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,425 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,425 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,425 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,425 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,425 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,426 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,426 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,426 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,426 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,426 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,427 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,427 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,427 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,428 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,428 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,432 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,432 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,434 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,434 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,438 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,438 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,438 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,438 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,439 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,439 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,439 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,439 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,439 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,440 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,440 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,440 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,442 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,442 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,442 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,442 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,445 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,446 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,446 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,446 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,446 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,446 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,447 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,447 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,447 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,447 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:08:45,449 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2020-10-16 11:08:45,463 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2020-10-16 11:08:45,486 INFO L377 AbstractCegarLoop]: Interprodecural is true
[2020-10-16 11:08:45,486 INFO L378 AbstractCegarLoop]: Hoare is true
[2020-10-16 11:08:45,486 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-10-16 11:08:45,486 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-16 11:08:45,486 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-16 11:08:45,486 INFO L382 AbstractCegarLoop]: Difference is false
[2020-10-16 11:08:45,487 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-16 11:08:45,487 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-16 11:08:45,501 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2020-10-16 11:08:45,504 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 113 transitions, 246 flow
[2020-10-16 11:08:45,507 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 113 transitions, 246 flow
[2020-10-16 11:08:45,509 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 124 places, 113 transitions, 246 flow
[2020-10-16 11:08:45,563 INFO L129 PetriNetUnfolder]: 2/109 cut-off events.
[2020-10-16 11:08:45,564 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 11:08:45,573 INFO L80 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 89 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place.
[2020-10-16 11:08:45,577 INFO L117 LiptonReduction]: Number of co-enabled transitions 2706
[2020-10-16 11:08:45,853 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:45,854 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:45,855 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:45,856 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:45,860 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:45,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:45,864 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:45,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:45,897 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:45,898 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:45,899 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:45,900 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:45,907 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:45,907 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:45,913 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:45,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:46,046 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-16 11:08:46,047 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:46,144 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:46,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:46,147 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:46,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:46,155 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:46,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:46,160 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:46,160 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:46,183 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:46,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:46,185 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:46,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:46,188 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:46,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:46,192 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:46,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:46,276 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:08:46,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:08:46,277 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:08:46,278 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:08:46,307 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:08:46,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:08:46,309 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:08:46,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:08:46,539 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:46,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:46,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:46,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:46,544 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:46,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:46,547 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:46,547 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:46,565 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:46,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:46,566 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:46,567 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:46,569 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:46,569 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:46,572 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:46,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:46,605 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:08:46,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:08:46,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:08:46,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:08:46,663 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:08:46,663 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:08:46,664 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:08:46,665 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:08:46,746 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:46,746 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:46,747 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:46,748 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:46,750 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:46,750 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:46,753 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:46,753 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:46,770 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:46,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:46,772 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:46,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:46,774 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:46,774 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:46,776 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:46,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:46,805 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:46,805 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:46,806 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:46,807 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:46,809 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:46,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:46,811 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:46,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:46,827 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:46,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:46,829 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:46,829 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:46,831 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:46,832 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:46,834 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:46,834 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:46,868 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:46,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:46,870 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:46,870 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:46,872 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:46,873 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:46,875 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:46,875 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:46,892 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:46,893 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:46,894 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:46,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:46,896 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:46,897 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:46,899 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:46,899 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:46,944 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:08:46,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:46,945 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term
[2020-10-16 11:08:46,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:46,982 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:08:46,983 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:08:46,984 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:08:46,984 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:08:48,413 WARN L193 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 230 DAG size of output: 189
[2020-10-16 11:08:48,422 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2020-10-16 11:08:48,423 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:08:48,423 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:08:48,424 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:08:49,593 WARN L193 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 147 DAG size of output: 127
[2020-10-16 11:08:49,904 WARN L193 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2020-10-16 11:08:50,019 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 53
[2020-10-16 11:08:50,044 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:50,045 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:50,046 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:50,046 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:50,048 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:50,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:50,050 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:50,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:50,066 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:50,066 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:50,067 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:50,067 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:50,068 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:50,069 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:50,070 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:50,070 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:50,251 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-16 11:08:50,252 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:50,372 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 55
[2020-10-16 11:08:50,481 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 55
[2020-10-16 11:08:50,623 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:50,623 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:50,624 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:50,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:50,626 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:50,626 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:50,628 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:50,628 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:50,644 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:50,644 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:50,645 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:50,645 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:50,647 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:50,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:50,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:50,651 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:51,260 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:51,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:51,262 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:51,263 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:51,264 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:51,265 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:51,267 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:51,267 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:51,283 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:51,284 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:51,285 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:51,285 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:51,287 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:51,288 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:08:51,290 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:51,291 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:08:51,444 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:51,444 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:51,445 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:51,445 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:51,447 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:51,451 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:08:51,453 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:51,453 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:08:51,466 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:51,466 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:51,467 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:51,467 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:51,469 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:51,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:51,471 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:51,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:52,200 WARN L193 SmtUtils]: Spent 683.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 111
[2020-10-16 11:08:52,486 WARN L193 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 108
[2020-10-16 11:08:52,567 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:52,567 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:52,568 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:52,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:52,569 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:52,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:08:52,571 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:52,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:08:52,589 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:52,590 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:52,590 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:52,591 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:52,592 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:52,592 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:52,595 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:52,595 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:52,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:52,631 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:52,632 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:52,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:52,633 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:52,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:52,635 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:52,635 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:52,647 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:52,647 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:52,648 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:52,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:52,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:52,653 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:08:52,654 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:52,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:08:52,699 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:52,699 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:52,700 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:52,701 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:52,705 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:52,705 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:52,709 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:52,710 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:52,734 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:52,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:52,737 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:52,740 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:52,742 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:52,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:08:52,747 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:52,747 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:08:52,777 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:52,778 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:52,778 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:52,779 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:52,780 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:52,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:08:52,783 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:52,784 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:08:52,795 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:52,795 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:52,796 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:52,797 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:52,800 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:52,801 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:52,802 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:52,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:52,825 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:52,825 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:52,826 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:52,826 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:52,828 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:52,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:52,829 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:52,830 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:52,838 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:52,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:52,838 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:52,839 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:52,840 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:52,840 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:08:52,841 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:52,842 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:08:52,941 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:52,941 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:52,942 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:52,942 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:52,944 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:52,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:08:52,947 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:52,950 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:08:52,968 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:52,969 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:52,969 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:52,970 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:08:52,971 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:08:52,971 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:52,973 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:08:52,973 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:08:54,209 WARN L193 SmtUtils]: Spent 949.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 133
[2020-10-16 11:08:54,671 WARN L193 SmtUtils]: Spent 459.00 ms on a formula simplification that was a NOOP. DAG size: 130
[2020-10-16 11:08:55,037 WARN L193 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97
[2020-10-16 11:08:55,165 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 95
[2020-10-16 11:08:55,792 WARN L193 SmtUtils]: Spent 582.00 ms on a formula simplification that was a NOOP. DAG size: 136
[2020-10-16 11:08:56,118 WARN L193 SmtUtils]: Spent 324.00 ms on a formula simplification that was a NOOP. DAG size: 134
[2020-10-16 11:08:56,159 INFO L132 LiptonReduction]: Checked pairs total: 7849
[2020-10-16 11:08:56,160 INFO L134 LiptonReduction]: Total number of compositions: 88
[2020-10-16 11:08:56,173 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 34 transitions, 88 flow
[2020-10-16 11:08:56,479 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 4872 states.
[2020-10-16 11:08:56,482 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states.
[2020-10-16 11:08:56,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2020-10-16 11:08:56,490 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:08:56,491 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2020-10-16 11:08:56,492 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:08:56,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:08:56,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1148088599, now seen corresponding path program 1 times
[2020-10-16 11:08:56,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:08:56,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867451406]
[2020-10-16 11:08:56,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:08:56,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:08:56,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:08:56,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867451406]
[2020-10-16 11:08:56,788 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:08:56,789 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 11:08:56,789 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935432845]
[2020-10-16 11:08:56,794 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:08:56,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:08:56,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:08:56,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:08:56,809 INFO L87 Difference]: Start difference. First operand 4872 states. Second operand 3 states.
[2020-10-16 11:08:56,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:08:56,991 INFO L93 Difference]: Finished difference Result 4062 states and 16125 transitions.
[2020-10-16 11:08:56,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2020-10-16 11:08:56,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5
[2020-10-16 11:08:56,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:08:57,051 INFO L225 Difference]: With dead ends: 4062
[2020-10-16 11:08:57,051 INFO L226 Difference]: Without dead ends: 3312
[2020-10-16 11:08:57,053 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:08:57,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3312 states.
[2020-10-16 11:08:57,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3312 to 3312.
[2020-10-16 11:08:57,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3312 states.
[2020-10-16 11:08:57,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3312 states to 3312 states and 12950 transitions.
[2020-10-16 11:08:57,404 INFO L78 Accepts]: Start accepts. Automaton has 3312 states and 12950 transitions. Word has length 5
[2020-10-16 11:08:57,404 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:08:57,404 INFO L481 AbstractCegarLoop]: Abstraction has 3312 states and 12950 transitions.
[2020-10-16 11:08:57,404 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:08:57,404 INFO L276 IsEmpty]: Start isEmpty. Operand 3312 states and 12950 transitions.
[2020-10-16 11:08:57,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2020-10-16 11:08:57,408 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:08:57,409 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:08:57,409 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-16 11:08:57,409 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:08:57,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:08:57,410 INFO L82 PathProgramCache]: Analyzing trace with hash 941677787, now seen corresponding path program 1 times
[2020-10-16 11:08:57,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:08:57,411 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075385006]
[2020-10-16 11:08:57,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:08:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:08:57,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:08:57,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075385006]
[2020-10-16 11:08:57,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:08:57,561 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 11:08:57,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664726354]
[2020-10-16 11:08:57,562 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:08:57,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:08:57,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:08:57,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:08:57,563 INFO L87 Difference]: Start difference. First operand 3312 states and 12950 transitions. Second operand 3 states.
[2020-10-16 11:08:57,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:08:57,609 INFO L93 Difference]: Finished difference Result 3062 states and 11850 transitions.
[2020-10-16 11:08:57,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2020-10-16 11:08:57,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11
[2020-10-16 11:08:57,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:08:57,639 INFO L225 Difference]: With dead ends: 3062
[2020-10-16 11:08:57,639 INFO L226 Difference]: Without dead ends: 3062
[2020-10-16 11:08:57,640 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:08:57,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3062 states.
[2020-10-16 11:08:57,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3062 to 3062.
[2020-10-16 11:08:57,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3062 states.
[2020-10-16 11:08:57,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3062 states to 3062 states and 11850 transitions.
[2020-10-16 11:08:57,798 INFO L78 Accepts]: Start accepts. Automaton has 3062 states and 11850 transitions. Word has length 11
[2020-10-16 11:08:57,799 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:08:57,799 INFO L481 AbstractCegarLoop]: Abstraction has 3062 states and 11850 transitions.
[2020-10-16 11:08:57,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:08:57,800 INFO L276 IsEmpty]: Start isEmpty. Operand 3062 states and 11850 transitions.
[2020-10-16 11:08:57,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-16 11:08:57,804 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:08:57,804 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:08:57,805 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-16 11:08:57,806 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:08:57,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:08:57,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1304142703, now seen corresponding path program 1 times
[2020-10-16 11:08:57,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:08:57,807 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600056436]
[2020-10-16 11:08:57,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:08:57,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:08:57,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:08:57,931 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600056436]
[2020-10-16 11:08:57,931 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:08:57,931 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 11:08:57,931 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275039958]
[2020-10-16 11:08:57,932 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 11:08:57,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:08:57,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 11:08:57,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2020-10-16 11:08:57,932 INFO L87 Difference]: Start difference. First operand 3062 states and 11850 transitions. Second operand 4 states.
[2020-10-16 11:08:58,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:08:58,062 INFO L93 Difference]: Finished difference Result 3022 states and 11668 transitions.
[2020-10-16 11:08:58,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2020-10-16 11:08:58,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13
[2020-10-16 11:08:58,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:08:58,091 INFO L225 Difference]: With dead ends: 3022
[2020-10-16 11:08:58,091 INFO L226 Difference]: Without dead ends: 3022
[2020-10-16 11:08:58,092 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2020-10-16 11:08:58,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3022 states.
[2020-10-16 11:08:58,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3022 to 3022.
[2020-10-16 11:08:58,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3022 states.
[2020-10-16 11:08:58,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3022 states to 3022 states and 11668 transitions.
[2020-10-16 11:08:58,233 INFO L78 Accepts]: Start accepts. Automaton has 3022 states and 11668 transitions. Word has length 13
[2020-10-16 11:08:58,233 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:08:58,233 INFO L481 AbstractCegarLoop]: Abstraction has 3022 states and 11668 transitions.
[2020-10-16 11:08:58,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 11:08:58,233 INFO L276 IsEmpty]: Start isEmpty. Operand 3022 states and 11668 transitions.
[2020-10-16 11:08:58,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-16 11:08:58,237 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:08:58,237 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:08:58,237 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-16 11:08:58,237 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:08:58,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:08:58,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1939697789, now seen corresponding path program 1 times
[2020-10-16 11:08:58,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:08:58,238 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839509744]
[2020-10-16 11:08:58,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:08:58,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:08:58,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:08:58,438 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839509744]
[2020-10-16 11:08:58,438 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:08:58,438 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 11:08:58,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541479524]
[2020-10-16 11:08:58,439 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 11:08:58,439 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:08:58,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 11:08:58,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:08:58,440 INFO L87 Difference]: Start difference. First operand 3022 states and 11668 transitions. Second operand 5 states.
[2020-10-16 11:08:58,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:08:58,620 INFO L93 Difference]: Finished difference Result 3230 states and 12480 transitions.
[2020-10-16 11:08:58,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2020-10-16 11:08:58,622 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14
[2020-10-16 11:08:58,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:08:58,656 INFO L225 Difference]: With dead ends: 3230
[2020-10-16 11:08:58,657 INFO L226 Difference]: Without dead ends: 3230
[2020-10-16 11:08:58,657 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:08:58,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3230 states.
[2020-10-16 11:08:58,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3230 to 3230.
[2020-10-16 11:08:58,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3230 states.
[2020-10-16 11:08:58,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3230 states to 3230 states and 12480 transitions.
[2020-10-16 11:08:58,799 INFO L78 Accepts]: Start accepts. Automaton has 3230 states and 12480 transitions. Word has length 14
[2020-10-16 11:08:58,799 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:08:58,799 INFO L481 AbstractCegarLoop]: Abstraction has 3230 states and 12480 transitions.
[2020-10-16 11:08:58,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 11:08:58,800 INFO L276 IsEmpty]: Start isEmpty. Operand 3230 states and 12480 transitions.
[2020-10-16 11:08:58,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-16 11:08:58,803 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:08:58,803 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:08:58,804 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-16 11:08:58,804 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:08:58,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:08:58,804 INFO L82 PathProgramCache]: Analyzing trace with hash 303076573, now seen corresponding path program 1 times
[2020-10-16 11:08:58,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:08:58,805 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606672623]
[2020-10-16 11:08:58,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:08:58,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:08:58,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:08:58,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606672623]
[2020-10-16 11:08:58,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:08:58,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 11:08:58,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102378284]
[2020-10-16 11:08:58,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 11:08:58,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:08:58,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 11:08:58,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:08:58,889 INFO L87 Difference]: Start difference. First operand 3230 states and 12480 transitions. Second operand 5 states.
[2020-10-16 11:08:59,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:08:59,124 INFO L93 Difference]: Finished difference Result 3240 states and 12508 transitions.
[2020-10-16 11:08:59,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2020-10-16 11:08:59,126 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15
[2020-10-16 11:08:59,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:08:59,143 INFO L225 Difference]: With dead ends: 3240
[2020-10-16 11:08:59,143 INFO L226 Difference]: Without dead ends: 3240
[2020-10-16 11:08:59,144 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:08:59,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3240 states.
[2020-10-16 11:08:59,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3240 to 3170.
[2020-10-16 11:08:59,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3170 states.
[2020-10-16 11:08:59,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3170 states to 3170 states and 12227 transitions.
[2020-10-16 11:08:59,269 INFO L78 Accepts]: Start accepts. Automaton has 3170 states and 12227 transitions. Word has length 15
[2020-10-16 11:08:59,270 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:08:59,270 INFO L481 AbstractCegarLoop]: Abstraction has 3170 states and 12227 transitions.
[2020-10-16 11:08:59,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 11:08:59,270 INFO L276 IsEmpty]: Start isEmpty. Operand 3170 states and 12227 transitions.
[2020-10-16 11:08:59,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-16 11:08:59,274 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:08:59,275 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:08:59,275 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-16 11:08:59,275 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:08:59,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:08:59,276 INFO L82 PathProgramCache]: Analyzing trace with hash 639459511, now seen corresponding path program 1 times
[2020-10-16 11:08:59,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:08:59,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32358014]
[2020-10-16 11:08:59,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:08:59,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:08:59,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:08:59,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32358014]
[2020-10-16 11:08:59,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:08:59,381 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 11:08:59,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795468301]
[2020-10-16 11:08:59,382 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 11:08:59,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:08:59,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 11:08:59,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:08:59,383 INFO L87 Difference]: Start difference. First operand 3170 states and 12227 transitions. Second operand 6 states.
[2020-10-16 11:08:59,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:08:59,585 INFO L93 Difference]: Finished difference Result 3444 states and 13370 transitions.
[2020-10-16 11:08:59,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2020-10-16 11:08:59,587 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16
[2020-10-16 11:08:59,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:08:59,604 INFO L225 Difference]: With dead ends: 3444
[2020-10-16 11:08:59,604 INFO L226 Difference]: Without dead ends: 3444
[2020-10-16 11:08:59,605 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:08:59,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3444 states.
[2020-10-16 11:08:59,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3444 to 3444.
[2020-10-16 11:08:59,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3444 states.
[2020-10-16 11:08:59,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3444 states to 3444 states and 13370 transitions.
[2020-10-16 11:08:59,738 INFO L78 Accepts]: Start accepts. Automaton has 3444 states and 13370 transitions. Word has length 16
[2020-10-16 11:08:59,738 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:08:59,738 INFO L481 AbstractCegarLoop]: Abstraction has 3444 states and 13370 transitions.
[2020-10-16 11:08:59,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 11:08:59,739 INFO L276 IsEmpty]: Start isEmpty. Operand 3444 states and 13370 transitions.
[2020-10-16 11:08:59,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-16 11:08:59,744 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:08:59,744 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:08:59,744 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-16 11:08:59,744 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:08:59,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:08:59,745 INFO L82 PathProgramCache]: Analyzing trace with hash 805438699, now seen corresponding path program 2 times
[2020-10-16 11:08:59,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:08:59,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522251614]
[2020-10-16 11:08:59,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:08:59,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:08:59,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:08:59,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522251614]
[2020-10-16 11:08:59,854 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:08:59,854 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 11:08:59,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139780339]
[2020-10-16 11:08:59,855 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 11:08:59,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:08:59,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 11:08:59,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:08:59,856 INFO L87 Difference]: Start difference. First operand 3444 states and 13370 transitions. Second operand 6 states.
[2020-10-16 11:09:00,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:09:00,006 INFO L93 Difference]: Finished difference Result 3992 states and 15452 transitions.
[2020-10-16 11:09:00,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2020-10-16 11:09:00,007 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16
[2020-10-16 11:09:00,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:09:00,025 INFO L225 Difference]: With dead ends: 3992
[2020-10-16 11:09:00,025 INFO L226 Difference]: Without dead ends: 3992
[2020-10-16 11:09:00,027 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:09:00,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3992 states.
[2020-10-16 11:09:00,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3992 to 3782.
[2020-10-16 11:09:00,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3782 states.
[2020-10-16 11:09:00,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3782 states to 3782 states and 14609 transitions.
[2020-10-16 11:09:00,187 INFO L78 Accepts]: Start accepts. Automaton has 3782 states and 14609 transitions. Word has length 16
[2020-10-16 11:09:00,187 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:09:00,188 INFO L481 AbstractCegarLoop]: Abstraction has 3782 states and 14609 transitions.
[2020-10-16 11:09:00,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 11:09:00,188 INFO L276 IsEmpty]: Start isEmpty. Operand 3782 states and 14609 transitions.
[2020-10-16 11:09:00,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-16 11:09:00,196 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:09:00,196 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:09:00,197 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-16 11:09:00,197 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:09:00,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:09:00,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1290651959, now seen corresponding path program 3 times
[2020-10-16 11:09:00,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:09:00,198 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133469447]
[2020-10-16 11:09:00,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:09:00,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:09:00,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:09:00,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133469447]
[2020-10-16 11:09:00,360 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:09:00,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 11:09:00,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330588833]
[2020-10-16 11:09:00,361 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 11:09:00,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:09:00,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 11:09:00,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:09:00,363 INFO L87 Difference]: Start difference. First operand 3782 states and 14609 transitions. Second operand 6 states.
[2020-10-16 11:09:00,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:09:00,507 INFO L93 Difference]: Finished difference Result 4332 states and 16690 transitions.
[2020-10-16 11:09:00,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2020-10-16 11:09:00,509 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16
[2020-10-16 11:09:00,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:09:00,635 INFO L225 Difference]: With dead ends: 4332
[2020-10-16 11:09:00,635 INFO L226 Difference]: Without dead ends: 4332
[2020-10-16 11:09:00,636 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:09:00,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4332 states.
[2020-10-16 11:09:00,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4332 to 3886.
[2020-10-16 11:09:00,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3886 states.
[2020-10-16 11:09:00,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3886 states to 3886 states and 14913 transitions.
[2020-10-16 11:09:00,777 INFO L78 Accepts]: Start accepts. Automaton has 3886 states and 14913 transitions. Word has length 16
[2020-10-16 11:09:00,777 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:09:00,777 INFO L481 AbstractCegarLoop]: Abstraction has 3886 states and 14913 transitions.
[2020-10-16 11:09:00,777 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 11:09:00,777 INFO L276 IsEmpty]: Start isEmpty. Operand 3886 states and 14913 transitions.
[2020-10-16 11:09:00,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-16 11:09:00,784 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:09:00,784 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:09:00,784 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-16 11:09:00,784 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:09:00,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:09:00,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1281781406, now seen corresponding path program 1 times
[2020-10-16 11:09:00,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:09:00,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381519870]
[2020-10-16 11:09:00,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:09:00,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:09:00,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:09:00,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381519870]
[2020-10-16 11:09:00,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:09:00,910 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 11:09:00,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277524689]
[2020-10-16 11:09:00,911 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 11:09:00,911 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:09:00,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 11:09:00,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 11:09:00,911 INFO L87 Difference]: Start difference. First operand 3886 states and 14913 transitions. Second operand 4 states.
[2020-10-16 11:09:00,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:09:00,974 INFO L93 Difference]: Finished difference Result 3960 states and 13876 transitions.
[2020-10-16 11:09:00,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2020-10-16 11:09:00,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16
[2020-10-16 11:09:00,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:09:00,992 INFO L225 Difference]: With dead ends: 3960
[2020-10-16 11:09:00,992 INFO L226 Difference]: Without dead ends: 2922
[2020-10-16 11:09:00,992 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:09:01,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states.
[2020-10-16 11:09:01,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2922.
[2020-10-16 11:09:01,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2922 states.
[2020-10-16 11:09:01,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2922 states and 10093 transitions.
[2020-10-16 11:09:01,088 INFO L78 Accepts]: Start accepts. Automaton has 2922 states and 10093 transitions. Word has length 16
[2020-10-16 11:09:01,088 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:09:01,088 INFO L481 AbstractCegarLoop]: Abstraction has 2922 states and 10093 transitions.
[2020-10-16 11:09:01,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 11:09:01,089 INFO L276 IsEmpty]: Start isEmpty. Operand 2922 states and 10093 transitions.
[2020-10-16 11:09:01,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-10-16 11:09:01,094 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:09:01,095 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:09:01,095 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-16 11:09:01,095 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:09:01,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:09:01,096 INFO L82 PathProgramCache]: Analyzing trace with hash 268950830, now seen corresponding path program 1 times
[2020-10-16 11:09:01,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:09:01,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263193758]
[2020-10-16 11:09:01,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:09:01,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:09:01,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:09:01,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263193758]
[2020-10-16 11:09:01,189 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:09:01,189 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 11:09:01,189 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827523846]
[2020-10-16 11:09:01,190 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 11:09:01,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:09:01,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 11:09:01,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:09:01,191 INFO L87 Difference]: Start difference. First operand 2922 states and 10093 transitions. Second operand 5 states.
[2020-10-16 11:09:01,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:09:01,264 INFO L93 Difference]: Finished difference Result 2474 states and 7949 transitions.
[2020-10-16 11:09:01,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2020-10-16 11:09:01,264 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17
[2020-10-16 11:09:01,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:09:01,272 INFO L225 Difference]: With dead ends: 2474
[2020-10-16 11:09:01,272 INFO L226 Difference]: Without dead ends: 1864
[2020-10-16 11:09:01,272 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:09:01,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states.
[2020-10-16 11:09:01,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1636.
[2020-10-16 11:09:01,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1636 states.
[2020-10-16 11:09:01,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 5075 transitions.
[2020-10-16 11:09:01,321 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 5075 transitions. Word has length 17
[2020-10-16 11:09:01,321 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:09:01,321 INFO L481 AbstractCegarLoop]: Abstraction has 1636 states and 5075 transitions.
[2020-10-16 11:09:01,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 11:09:01,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 5075 transitions.
[2020-10-16 11:09:01,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2020-10-16 11:09:01,326 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:09:01,326 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:09:01,326 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-16 11:09:01,327 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:09:01,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:09:01,327 INFO L82 PathProgramCache]: Analyzing trace with hash 114419764, now seen corresponding path program 1 times
[2020-10-16 11:09:01,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:09:01,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738078140]
[2020-10-16 11:09:01,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:09:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:09:01,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:09:01,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738078140]
[2020-10-16 11:09:01,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:09:01,476 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 11:09:01,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669252907]
[2020-10-16 11:09:01,477 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 11:09:01,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:09:01,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 11:09:01,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:09:01,477 INFO L87 Difference]: Start difference. First operand 1636 states and 5075 transitions. Second operand 6 states.
[2020-10-16 11:09:01,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:09:01,558 INFO L93 Difference]: Finished difference Result 1440 states and 4444 transitions.
[2020-10-16 11:09:01,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2020-10-16 11:09:01,560 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20
[2020-10-16 11:09:01,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:09:01,564 INFO L225 Difference]: With dead ends: 1440
[2020-10-16 11:09:01,564 INFO L226 Difference]: Without dead ends: 1275
[2020-10-16 11:09:01,564 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2020-10-16 11:09:01,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states.
[2020-10-16 11:09:01,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1143.
[2020-10-16 11:09:01,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1143 states.
[2020-10-16 11:09:01,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 3596 transitions.
[2020-10-16 11:09:01,597 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 3596 transitions. Word has length 20
[2020-10-16 11:09:01,597 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:09:01,597 INFO L481 AbstractCegarLoop]: Abstraction has 1143 states and 3596 transitions.
[2020-10-16 11:09:01,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 11:09:01,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 3596 transitions.
[2020-10-16 11:09:01,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2020-10-16 11:09:01,601 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:09:01,601 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:09:01,601 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-16 11:09:01,602 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:09:01,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:09:01,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1712340089, now seen corresponding path program 1 times
[2020-10-16 11:09:01,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:09:01,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47577270]
[2020-10-16 11:09:01,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:09:01,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:09:01,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:09:01,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47577270]
[2020-10-16 11:09:01,683 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:09:01,683 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 11:09:01,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220486938]
[2020-10-16 11:09:01,684 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 11:09:01,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:09:01,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 11:09:01,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 11:09:01,684 INFO L87 Difference]: Start difference. First operand 1143 states and 3596 transitions. Second operand 4 states.
[2020-10-16 11:09:01,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:09:01,708 INFO L93 Difference]: Finished difference Result 1504 states and 4629 transitions.
[2020-10-16 11:09:01,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2020-10-16 11:09:01,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24
[2020-10-16 11:09:01,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:09:01,713 INFO L225 Difference]: With dead ends: 1504
[2020-10-16 11:09:01,713 INFO L226 Difference]: Without dead ends: 1146
[2020-10-16 11:09:01,714 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:09:01,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states.
[2020-10-16 11:09:01,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1143.
[2020-10-16 11:09:01,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1143 states.
[2020-10-16 11:09:01,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 3494 transitions.
[2020-10-16 11:09:01,743 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 3494 transitions. Word has length 24
[2020-10-16 11:09:01,743 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:09:01,743 INFO L481 AbstractCegarLoop]: Abstraction has 1143 states and 3494 transitions.
[2020-10-16 11:09:01,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 11:09:01,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 3494 transitions.
[2020-10-16 11:09:01,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2020-10-16 11:09:01,747 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:09:01,748 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:09:01,748 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-10-16 11:09:01,748 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:09:01,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:09:01,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1064753958, now seen corresponding path program 1 times
[2020-10-16 11:09:01,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:09:01,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227572313]
[2020-10-16 11:09:01,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:09:01,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:09:01,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:09:01,820 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227572313]
[2020-10-16 11:09:01,821 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:09:01,821 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 11:09:01,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248903316]
[2020-10-16 11:09:01,822 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 11:09:01,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:09:01,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 11:09:01,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 11:09:01,824 INFO L87 Difference]: Start difference. First operand 1143 states and 3494 transitions. Second operand 4 states.
[2020-10-16 11:09:01,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:09:01,858 INFO L93 Difference]: Finished difference Result 1581 states and 4714 transitions.
[2020-10-16 11:09:01,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2020-10-16 11:09:01,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24
[2020-10-16 11:09:01,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:09:01,863 INFO L225 Difference]: With dead ends: 1581
[2020-10-16 11:09:01,863 INFO L226 Difference]: Without dead ends: 1066
[2020-10-16 11:09:01,864 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:09:01,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states.
[2020-10-16 11:09:01,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 1063.
[2020-10-16 11:09:01,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1063 states.
[2020-10-16 11:09:01,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 3103 transitions.
[2020-10-16 11:09:01,894 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 3103 transitions. Word has length 24
[2020-10-16 11:09:01,896 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:09:01,896 INFO L481 AbstractCegarLoop]: Abstraction has 1063 states and 3103 transitions.
[2020-10-16 11:09:01,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 11:09:01,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 3103 transitions.
[2020-10-16 11:09:01,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2020-10-16 11:09:01,902 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:09:01,903 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:09:01,903 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2020-10-16 11:09:01,903 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:09:01,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:09:01,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1374941136, now seen corresponding path program 2 times
[2020-10-16 11:09:01,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:09:01,904 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116471144]
[2020-10-16 11:09:01,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:09:02,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:09:02,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:09:02,092 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116471144]
[2020-10-16 11:09:02,092 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:09:02,093 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-16 11:09:02,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236221635]
[2020-10-16 11:09:02,094 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 11:09:02,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:09:02,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 11:09:02,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2020-10-16 11:09:02,095 INFO L87 Difference]: Start difference. First operand 1063 states and 3103 transitions. Second operand 7 states.
[2020-10-16 11:09:02,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:09:02,181 INFO L93 Difference]: Finished difference Result 1030 states and 3037 transitions.
[2020-10-16 11:09:02,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2020-10-16 11:09:02,182 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24
[2020-10-16 11:09:02,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:09:02,184 INFO L225 Difference]: With dead ends: 1030
[2020-10-16 11:09:02,184 INFO L226 Difference]: Without dead ends: 371
[2020-10-16 11:09:02,185 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2020-10-16 11:09:02,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states.
[2020-10-16 11:09:02,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 347.
[2020-10-16 11:09:02,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states.
[2020-10-16 11:09:02,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 944 transitions.
[2020-10-16 11:09:02,197 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 944 transitions. Word has length 24
[2020-10-16 11:09:02,198 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:09:02,198 INFO L481 AbstractCegarLoop]: Abstraction has 347 states and 944 transitions.
[2020-10-16 11:09:02,198 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 11:09:02,198 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 944 transitions.
[2020-10-16 11:09:02,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2020-10-16 11:09:02,202 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:09:02,202 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:09:02,203 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2020-10-16 11:09:02,203 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:09:02,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:09:02,203 INFO L82 PathProgramCache]: Analyzing trace with hash -648793259, now seen corresponding path program 1 times
[2020-10-16 11:09:02,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:09:02,204 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907340791]
[2020-10-16 11:09:02,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:09:02,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:09:02,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:09:02,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907340791]
[2020-10-16 11:09:02,524 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:09:02,524 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 11:09:02,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222212784]
[2020-10-16 11:09:02,525 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 11:09:02,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:09:02,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 11:09:02,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2020-10-16 11:09:02,526 INFO L87 Difference]: Start difference. First operand 347 states and 944 transitions. Second operand 7 states.
[2020-10-16 11:09:02,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:09:02,692 INFO L93 Difference]: Finished difference Result 475 states and 1291 transitions.
[2020-10-16 11:09:02,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2020-10-16 11:09:02,693 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28
[2020-10-16 11:09:02,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:09:02,695 INFO L225 Difference]: With dead ends: 475
[2020-10-16 11:09:02,696 INFO L226 Difference]: Without dead ends: 433
[2020-10-16 11:09:02,696 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2020-10-16 11:09:02,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states.
[2020-10-16 11:09:02,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 331.
[2020-10-16 11:09:02,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states.
[2020-10-16 11:09:02,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 880 transitions.
[2020-10-16 11:09:02,705 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 880 transitions. Word has length 28
[2020-10-16 11:09:02,705 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:09:02,705 INFO L481 AbstractCegarLoop]: Abstraction has 331 states and 880 transitions.
[2020-10-16 11:09:02,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 11:09:02,706 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 880 transitions.
[2020-10-16 11:09:02,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2020-10-16 11:09:02,707 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:09:02,707 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:09:02,707 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2020-10-16 11:09:02,707 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:09:02,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:09:02,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1438094207, now seen corresponding path program 2 times
[2020-10-16 11:09:02,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:09:02,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801435143]
[2020-10-16 11:09:02,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:09:02,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:09:03,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:09:03,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801435143]
[2020-10-16 11:09:03,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:09:03,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-16 11:09:03,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090049217]
[2020-10-16 11:09:03,037 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-10-16 11:09:03,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:09:03,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-10-16 11:09:03,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2020-10-16 11:09:03,038 INFO L87 Difference]: Start difference. First operand 331 states and 880 transitions. Second operand 8 states.
[2020-10-16 11:09:03,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:09:03,268 INFO L93 Difference]: Finished difference Result 441 states and 1170 transitions.
[2020-10-16 11:09:03,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2020-10-16 11:09:03,269 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28
[2020-10-16 11:09:03,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:09:03,271 INFO L225 Difference]: With dead ends: 441
[2020-10-16 11:09:03,271 INFO L226 Difference]: Without dead ends: 395
[2020-10-16 11:09:03,271 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2020-10-16 11:09:03,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states.
[2020-10-16 11:09:03,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 323.
[2020-10-16 11:09:03,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states.
[2020-10-16 11:09:03,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 856 transitions.
[2020-10-16 11:09:03,278 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 856 transitions. Word has length 28
[2020-10-16 11:09:03,278 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:09:03,279 INFO L481 AbstractCegarLoop]: Abstraction has 323 states and 856 transitions.
[2020-10-16 11:09:03,279 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2020-10-16 11:09:03,279 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 856 transitions.
[2020-10-16 11:09:03,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2020-10-16 11:09:03,280 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:09:03,280 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:09:03,280 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2020-10-16 11:09:03,280 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:09:03,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:09:03,281 INFO L82 PathProgramCache]: Analyzing trace with hash -765407833, now seen corresponding path program 3 times
[2020-10-16 11:09:03,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:09:03,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611580279]
[2020-10-16 11:09:03,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:09:03,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:09:03,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:09:03,606 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611580279]
[2020-10-16 11:09:03,606 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:09:03,606 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 11:09:03,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276274070]
[2020-10-16 11:09:03,607 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 11:09:03,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:09:03,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 11:09:03,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2020-10-16 11:09:03,608 INFO L87 Difference]: Start difference. First operand 323 states and 856 transitions. Second operand 7 states.
[2020-10-16 11:09:03,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:09:03,771 INFO L93 Difference]: Finished difference Result 445 states and 1193 transitions.
[2020-10-16 11:09:03,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2020-10-16 11:09:03,773 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28
[2020-10-16 11:09:03,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:09:03,774 INFO L225 Difference]: With dead ends: 445
[2020-10-16 11:09:03,774 INFO L226 Difference]: Without dead ends: 379
[2020-10-16 11:09:03,774 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2020-10-16 11:09:03,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states.
[2020-10-16 11:09:03,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 295.
[2020-10-16 11:09:03,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states.
[2020-10-16 11:09:03,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 772 transitions.
[2020-10-16 11:09:03,781 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 772 transitions. Word has length 28
[2020-10-16 11:09:03,783 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:09:03,783 INFO L481 AbstractCegarLoop]: Abstraction has 295 states and 772 transitions.
[2020-10-16 11:09:03,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 11:09:03,783 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 772 transitions.
[2020-10-16 11:09:03,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2020-10-16 11:09:03,784 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:09:03,784 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:09:03,784 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2020-10-16 11:09:03,784 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:09:03,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:09:03,785 INFO L82 PathProgramCache]: Analyzing trace with hash 821735187, now seen corresponding path program 4 times
[2020-10-16 11:09:03,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:09:03,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663051967]
[2020-10-16 11:09:03,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:09:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:09:04,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:09:04,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663051967]
[2020-10-16 11:09:04,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:09:04,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-10-16 11:09:04,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506561095]
[2020-10-16 11:09:04,306 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states
[2020-10-16 11:09:04,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:09:04,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2020-10-16 11:09:04,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2020-10-16 11:09:04,307 INFO L87 Difference]: Start difference. First operand 295 states and 772 transitions. Second operand 9 states.
[2020-10-16 11:09:04,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:09:04,705 INFO L93 Difference]: Finished difference Result 510 states and 1322 transitions.
[2020-10-16 11:09:04,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2020-10-16 11:09:04,706 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28
[2020-10-16 11:09:04,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:09:04,710 INFO L225 Difference]: With dead ends: 510
[2020-10-16 11:09:04,710 INFO L226 Difference]: Without dead ends: 424
[2020-10-16 11:09:04,711 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132
[2020-10-16 11:09:04,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states.
[2020-10-16 11:09:04,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 265.
[2020-10-16 11:09:04,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states.
[2020-10-16 11:09:04,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 704 transitions.
[2020-10-16 11:09:04,721 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 704 transitions. Word has length 28
[2020-10-16 11:09:04,721 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:09:04,721 INFO L481 AbstractCegarLoop]: Abstraction has 265 states and 704 transitions.
[2020-10-16 11:09:04,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2020-10-16 11:09:04,721 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 704 transitions.
[2020-10-16 11:09:04,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2020-10-16 11:09:04,722 INFO L414 BasicCegarLoop]: Found error trace
[2020-10-16 11:09:04,722 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:09:04,722 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2020-10-16 11:09:04,723 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:09:04,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:09:04,726 INFO L82 PathProgramCache]: Analyzing trace with hash -196915649, now seen corresponding path program 5 times
[2020-10-16 11:09:04,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:09:04,727 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128813267]
[2020-10-16 11:09:04,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:09:04,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 11:09:04,799 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 11:09:04,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 11:09:04,853 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 11:09:04,912 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-16 11:09:04,912 INFO L523 BasicCegarLoop]: Counterexample might be feasible
[2020-10-16 11:09:04,913 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2020-10-16 11:09:04,914 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available.
[2020-10-16 11:09:04,934 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1167] [1167] L853-->L860: Formula: (let ((.cse6 (= (mod ~x$w_buff0_used~0_In874359657 256) 0)) (.cse7 (= (mod ~x$r_buff0_thd0~0_In874359657 256) 0)) (.cse9 (= (mod ~x$w_buff1_used~0_In874359657 256) 0)) (.cse8 (= (mod ~x$r_buff1_thd0~0_In874359657 256) 0))) (let ((.cse1 (not .cse8)) (.cse2 (not .cse9)) (.cse0 (or .cse8 .cse9)) (.cse4 (not .cse7)) (.cse5 (not .cse6)) (.cse3 (or .cse6 .cse7))) (and (= ~x$r_buff1_thd0~0_In874359657 ~x$r_buff1_thd0~0_Out874359657) (or (and (or (and (= ~x~0_In874359657 ~x~0_Out874359657) .cse0) (and .cse1 (= ~x$w_buff1~0_In874359657 ~x~0_Out874359657) .cse2)) .cse3) (and .cse4 (= ~x$w_buff0~0_In874359657 ~x~0_Out874359657) .cse5)) (or (and .cse1 (= 0 ~x$w_buff1_used~0_Out874359657) .cse2) (and (= ~x$w_buff1_used~0_In874359657 ~x$w_buff1_used~0_Out874359657) .cse0)) (or (and .cse4 (= ~x$w_buff0_used~0_Out874359657 0) .cse5) (and .cse3 (= ~x$w_buff0_used~0_In874359657 ~x$w_buff0_used~0_Out874359657))) (= ~x$r_buff0_thd0~0_In874359657 ~x$r_buff0_thd0~0_Out874359657) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out874359657 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In874359657| ULTIMATE.start_assume_abort_if_not_~cond_Out874359657)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In874359657, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In874359657, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In874359657|, ~x$w_buff1~0=~x$w_buff1~0_In874359657, ~x$w_buff1_used~0=~x$w_buff1_used~0_In874359657, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In874359657, ~x~0=~x~0_In874359657, ~x$w_buff0_used~0=~x$w_buff0_used~0_In874359657} OutVars{~x$w_buff0~0=~x$w_buff0~0_In874359657, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out874359657, ~x$w_buff1~0=~x$w_buff1~0_In874359657, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out874359657|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out874359657, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out874359657, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out874359657|, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out874359657|, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out874359657|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out874359657, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out874359657|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In874359657|, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out874359657|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out874359657, ~x~0=~x~0_Out874359657} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32, ~x~0, ULTIMATE.start_main_#t~ite33, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge
[2020-10-16 11:09:05,036 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:05,037 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:05,041 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:05,041 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:05,041 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:05,041 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:05,041 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:05,042 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:05,042 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:05,042 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:05,042 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:05,042 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:05,042 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:05,043 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:05,043 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:05,044 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:05,044 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:05,044 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:05,044 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:05,044 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:05,044 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:05,045 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:05,045 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:05,045 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:05,046 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:05,046 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:05,046 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:05,046 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:05,046 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:05,047 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:05,047 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:05,047 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:05,047 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:05,047 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:05,048 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:05,048 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:05,048 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:05,048 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:05,048 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:05,049 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:05,049 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:05,049 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:05,049 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:05,049 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:05,050 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:05,050 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:05,051 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:05,051 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:05,051 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:05,051 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:05,051 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:05,051 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:05,052 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:05,052 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:05,052 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:05,052 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:05,052 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:05,053 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:05,053 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:05,053 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:05,053 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:05,053 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:05,054 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:05,054 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:05,054 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:05,054 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:05,055 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:05,055 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:05,055 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:05,055 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:05,055 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:05,055 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:05,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 11:09:05 BasicIcfg
[2020-10-16 11:09:05,145 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-16 11:09:05,147 INFO L168 Benchmark]: Toolchain (without parser) took 23289.24 ms. Allocated memory was 140.5 MB in the beginning and 568.3 MB in the end (delta: 427.8 MB). Free memory was 101.7 MB in the beginning and 439.8 MB in the end (delta: -338.1 MB). Peak memory consumption was 426.9 MB. Max. memory is 7.1 GB.
[2020-10-16 11:09:05,147 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.6 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB.
[2020-10-16 11:09:05,148 INFO L168 Benchmark]: CACSL2BoogieTranslator took 814.73 ms. Allocated memory was 140.5 MB in the beginning and 203.4 MB in the end (delta: 62.9 MB). Free memory was 101.7 MB in the beginning and 155.5 MB in the end (delta: -53.8 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB.
[2020-10-16 11:09:05,149 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.66 ms. Allocated memory is still 203.4 MB. Free memory was 155.5 MB in the beginning and 151.7 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB.
[2020-10-16 11:09:05,150 INFO L168 Benchmark]: Boogie Preprocessor took 61.08 ms. Allocated memory is still 203.4 MB. Free memory was 151.7 MB in the beginning and 149.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB.
[2020-10-16 11:09:05,150 INFO L168 Benchmark]: RCFGBuilder took 2541.56 ms. Allocated memory was 203.4 MB in the beginning and 247.5 MB in the end (delta: 44.0 MB). Free memory was 149.8 MB in the beginning and 138.9 MB in the end (delta: 10.9 MB). Peak memory consumption was 101.4 MB. Max. memory is 7.1 GB.
[2020-10-16 11:09:05,151 INFO L168 Benchmark]: TraceAbstraction took 19794.45 ms. Allocated memory was 247.5 MB in the beginning and 568.3 MB in the end (delta: 320.9 MB). Free memory was 137.0 MB in the beginning and 439.8 MB in the end (delta: -302.8 MB). Peak memory consumption was 355.2 MB. Max. memory is 7.1 GB.
[2020-10-16 11:09:05,160 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.23 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.6 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB.
* CACSL2BoogieTranslator took 814.73 ms. Allocated memory was 140.5 MB in the beginning and 203.4 MB in the end (delta: 62.9 MB). Free memory was 101.7 MB in the beginning and 155.5 MB in the end (delta: -53.8 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB.
* Boogie Procedure Inliner took 69.66 ms. Allocated memory is still 203.4 MB. Free memory was 155.5 MB in the beginning and 151.7 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB.
* Boogie Preprocessor took 61.08 ms. Allocated memory is still 203.4 MB. Free memory was 151.7 MB in the beginning and 149.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB.
* RCFGBuilder took 2541.56 ms. Allocated memory was 203.4 MB in the beginning and 247.5 MB in the end (delta: 44.0 MB). Free memory was 149.8 MB in the beginning and 138.9 MB in the end (delta: 10.9 MB). Peak memory consumption was 101.4 MB. Max. memory is 7.1 GB.
* TraceAbstraction took 19794.45 ms. Allocated memory was 247.5 MB in the beginning and 568.3 MB in the end (delta: 320.9 MB). Free memory was 137.0 MB in the beginning and 439.8 MB in the end (delta: -302.8 MB). Peak memory consumption was 355.2 MB. Max. memory is 7.1 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
1778 VarBasedMoverChecksPositive, 85 VarBasedMoverChecksNegative, 14 SemBasedMoverChecksPositive, 71 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 268 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.6s, 124 PlacesBefore, 47 PlacesAfterwards, 113 TransitionsBefore, 34 TransitionsAfterwards, 2706 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 88 TotalNumberOfCompositions, 7849 MoverChecksTotal
- CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable
a call of __VERIFIER_error() is reachable
We found a FailurePath:
[L699] 0 int __unbuffered_cnt = 0;
[L701] 0 int __unbuffered_p1_EAX = 0;
[L703] 0 int __unbuffered_p2_EAX = 0;
[L705] 0 int __unbuffered_p3_EAX = 0;
[L707] 0 int __unbuffered_p3_EBX = 0;
[L709] 0 int a = 0;
[L710] 0 _Bool main$tmp_guard0;
[L711] 0 _Bool main$tmp_guard1;
[L713] 0 int x = 0;
[L714] 0 _Bool x$flush_delayed;
[L715] 0 int x$mem_tmp;
[L716] 0 _Bool x$r_buff0_thd0;
[L717] 0 _Bool x$r_buff0_thd1;
[L718] 0 _Bool x$r_buff0_thd2;
[L719] 0 _Bool x$r_buff0_thd3;
[L720] 0 _Bool x$r_buff0_thd4;
[L721] 0 _Bool x$r_buff1_thd0;
[L722] 0 _Bool x$r_buff1_thd1;
[L723] 0 _Bool x$r_buff1_thd2;
[L724] 0 _Bool x$r_buff1_thd3;
[L725] 0 _Bool x$r_buff1_thd4;
[L726] 0 _Bool x$read_delayed;
[L727] 0 int *x$read_delayed_var;
[L728] 0 int x$w_buff0;
[L729] 0 _Bool x$w_buff0_used;
[L730] 0 int x$w_buff1;
[L731] 0 _Bool x$w_buff1_used;
[L733] 0 int y = 0;
[L735] 0 int z = 0;
[L736] 0 _Bool weak$$choice0;
[L737] 0 _Bool weak$$choice2;
[L842] 0 pthread_t t489;
[L843] FCALL, FORK 0 pthread_create(&t489, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L844] 0 pthread_t t490;
[L845] FCALL, FORK 0 pthread_create(&t490, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L761] 2 x$w_buff1 = x$w_buff0
[L762] 2 x$w_buff0 = 2
[L763] 2 x$w_buff1_used = x$w_buff0_used
[L764] 2 x$w_buff0_used = (_Bool)1
[L7] COND TRUE 2 !expression
[L7] 2 __VERIFIER_error()
[L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0
[L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1
[L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2
[L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3
[L770] 2 x$r_buff1_thd4 = x$r_buff0_thd4
[L771] 2 x$r_buff0_thd2 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L774] 2 __unbuffered_p1_EAX = y
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L846] 0 pthread_t t491;
[L847] FCALL, FORK 0 pthread_create(&t491, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L848] 0 pthread_t t492;
[L849] FCALL, FORK 0 pthread_create(&t492, ((void *)0), P3, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L791] 3 y = 1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0]
[L794] 3 __unbuffered_p2_EAX = z
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0]
[L811] 4 z = 1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L814] 4 __unbuffered_p3_EAX = z
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L817] 4 __unbuffered_p3_EBX = a
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L741] 1 a = 1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L820] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x)
[L820] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x
[L820] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x)
[L820] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x)
[L821] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used
[L821] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used
[L822] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used
[L822] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used
[L823] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4
[L823] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4
[L824] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4
[L824] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4
[L827] 4 __unbuffered_cnt = __unbuffered_cnt + 1
[L829] 4 return 0;
[L797] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L797] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L798] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L799] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L800] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L801] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L801] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L804] 3 __unbuffered_cnt = __unbuffered_cnt + 1
[L806] 3 return 0;
[L744] 1 x = 1
VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L780] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L781] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L784] 2 __unbuffered_cnt = __unbuffered_cnt + 1
[L786] 2 return 0;
[L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)
[L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)
[L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used
[L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used
[L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used
[L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used
[L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1
[L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1
[L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1
[L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1
[L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1
[L756] 1 return 0;
[L851] 0 main$tmp_guard0 = __unbuffered_cnt == 4
[L862] 0 weak$$choice0 = __VERIFIER_nondet_bool()
[L863] 0 weak$$choice2 = __VERIFIER_nondet_bool()
[L864] 0 x$flush_delayed = weak$$choice2
[L865] 0 x$mem_tmp = x
[L866] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1)
[L866] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1
[L866] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1)
[L866] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1)
[L867] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0))
[L867] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)
[L867] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0))
[L867] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0))
[L868] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L868] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)
[L868] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L868] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L869] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used))
[L869] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)
[L869] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used))
[L869] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used))
[L870] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L870] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L870] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L870] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L871] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0))
[L871] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0))
[L872] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L872] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L872] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L872] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L873] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0)
[L874] EXPR 0 x$flush_delayed ? x$mem_tmp : x
[L874] 0 x = x$flush_delayed ? x$mem_tmp : x
[L875] 0 x$flush_delayed = (_Bool)0
[L7] COND TRUE 0 !expression
[L7] 0 __VERIFIER_error()
VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 5 procedures, 112 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 19.4s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.9s, HoareTripleCheckerStatistics: 643 SDtfs, 888 SDslu, 1242 SDs, 0 SdLazy, 613 SolverSat, 211 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4872occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 1533 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 371 NumberOfCodeBlocks, 371 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 325 ConstructedInterpolants, 0 QuantifiedInterpolants, 82229 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...