/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/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix002_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 05:01:37,437 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 05:01:37,439 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 05:01:37,451 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 05:01:37,452 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 05:01:37,453 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 05:01:37,454 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 05:01:37,456 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 05:01:37,458 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 05:01:37,459 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 05:01:37,460 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 05:01:37,461 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 05:01:37,461 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 05:01:37,462 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 05:01:37,463 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 05:01:37,464 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 05:01:37,465 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 05:01:37,466 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 05:01:37,468 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 05:01:37,470 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 05:01:37,471 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 05:01:37,472 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 05:01:37,473 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 05:01:37,474 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 05:01:37,476 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 05:01:37,477 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 05:01:37,477 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 05:01:37,478 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 05:01:37,478 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 05:01:37,479 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 05:01:37,479 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 05:01:37,480 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 05:01:37,481 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 05:01:37,482 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 05:01:37,483 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 05:01:37,483 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 05:01:37,483 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 05:01:37,484 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 05:01:37,484 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 05:01:37,485 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 05:01:37,485 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 05:01:37,486 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 05:01:37,502 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 05:01:37,502 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 05:01:37,505 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 05:01:37,505 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 05:01:37,506 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 05:01:37,506 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 05:01:37,506 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 05:01:37,506 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 05:01:37,506 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 05:01:37,507 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 05:01:37,508 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 05:01:37,508 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 05:01:37,508 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 05:01:37,509 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 05:01:37,509 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 05:01:37,509 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 05:01:37,509 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 05:01:37,509 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 05:01:37,510 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 05:01:37,510 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 05:01:37,510 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 05:01:37,511 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:01:37,511 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 05:01:37,511 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 05:01:37,512 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 05:01:37,512 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 05:01:37,512 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 05:01:37,512 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 05:01:37,512 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 05:01:37,513 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 05:01:37,791 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 05:01:37,804 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 05:01:37,808 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 05:01:37,810 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 05:01:37,810 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 05:01:37,811 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix002_pso.oepc.i [2019-12-27 05:01:37,887 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5eb38a7d4/ca357124e6764f8f864d7e13c69aac62/FLAG8418a49d0 [2019-12-27 05:01:38,472 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 05:01:38,474 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix002_pso.oepc.i [2019-12-27 05:01:38,505 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5eb38a7d4/ca357124e6764f8f864d7e13c69aac62/FLAG8418a49d0 [2019-12-27 05:01:38,682 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5eb38a7d4/ca357124e6764f8f864d7e13c69aac62 [2019-12-27 05:01:38,694 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 05:01:38,696 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 05:01:38,701 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 05:01:38,701 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 05:01:38,704 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 05:01:38,705 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:01:38" (1/1) ... [2019-12-27 05:01:38,708 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f48d3b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:01:38, skipping insertion in model container [2019-12-27 05:01:38,709 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:01:38" (1/1) ... [2019-12-27 05:01:38,719 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 05:01:38,783 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 05:01:39,326 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:01:39,343 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 05:01:39,430 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:01:39,525 INFO L208 MainTranslator]: Completed translation [2019-12-27 05:01:39,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:01:39 WrapperNode [2019-12-27 05:01:39,526 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 05:01:39,527 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 05:01:39,527 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 05:01:39,527 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 05:01:39,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:01:39" (1/1) ... [2019-12-27 05:01:39,577 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:01:39" (1/1) ... [2019-12-27 05:01:39,609 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 05:01:39,610 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 05:01:39,610 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 05:01:39,610 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 05:01:39,621 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:01:39" (1/1) ... [2019-12-27 05:01:39,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:01:39" (1/1) ... [2019-12-27 05:01:39,626 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:01:39" (1/1) ... [2019-12-27 05:01:39,626 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:01:39" (1/1) ... [2019-12-27 05:01:39,637 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:01:39" (1/1) ... [2019-12-27 05:01:39,648 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:01:39" (1/1) ... [2019-12-27 05:01:39,656 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:01:39" (1/1) ... [2019-12-27 05:01:39,665 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 05:01:39,666 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 05:01:39,671 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 05:01:39,671 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 05:01:39,672 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:01:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/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 [2019-12-27 05:01:39,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 05:01:39,762 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 05:01:39,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 05:01:39,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 05:01:39,763 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 05:01:39,763 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 05:01:39,763 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 05:01:39,763 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 05:01:39,764 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 05:01:39,764 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 05:01:39,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 05:01:39,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 05:01:39,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 05:01:39,766 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 05:01:40,566 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 05:01:40,566 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 05:01:40,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:01:40 BoogieIcfgContainer [2019-12-27 05:01:40,567 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 05:01:40,569 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 05:01:40,569 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 05:01:40,572 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 05:01:40,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:01:38" (1/3) ... [2019-12-27 05:01:40,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@192947ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:01:40, skipping insertion in model container [2019-12-27 05:01:40,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:01:39" (2/3) ... [2019-12-27 05:01:40,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@192947ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:01:40, skipping insertion in model container [2019-12-27 05:01:40,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:01:40" (3/3) ... [2019-12-27 05:01:40,576 INFO L109 eAbstractionObserver]: Analyzing ICFG mix002_pso.oepc.i [2019-12-27 05:01:40,587 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 05:01:40,587 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 05:01:40,595 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 05:01:40,596 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 05:01:40,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,639 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,640 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,640 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,641 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,641 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,649 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,649 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,658 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,658 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,678 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,702 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,702 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,708 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,709 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,716 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,716 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,717 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:01:40,732 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 05:01:40,751 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 05:01:40,751 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 05:01:40,751 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 05:01:40,751 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 05:01:40,751 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 05:01:40,752 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 05:01:40,752 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 05:01:40,752 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 05:01:40,769 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 217 transitions [2019-12-27 05:01:40,771 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-27 05:01:40,878 INFO L132 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-27 05:01:40,879 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:01:40,894 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs. 0/165 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 05:01:40,921 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-27 05:01:40,976 INFO L132 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-27 05:01:40,976 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:01:40,986 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs. 0/165 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 05:01:41,013 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 05:01:41,014 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 05:01:44,695 WARN L192 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-27 05:01:44,862 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-27 05:01:44,998 INFO L206 etLargeBlockEncoding]: Checked pairs total: 96061 [2019-12-27 05:01:44,998 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-27 05:01:45,002 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 106 transitions [2019-12-27 05:02:04,599 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 123272 states. [2019-12-27 05:02:04,601 INFO L276 IsEmpty]: Start isEmpty. Operand 123272 states. [2019-12-27 05:02:04,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 05:02:04,607 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:02:04,608 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 05:02:04,609 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:02:04,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:02:04,614 INFO L82 PathProgramCache]: Analyzing trace with hash 920016, now seen corresponding path program 1 times [2019-12-27 05:02:04,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:02:04,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459841668] [2019-12-27 05:02:04,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:02:04,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:02:04,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:02:04,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459841668] [2019-12-27 05:02:04,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:02:04,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:02:04,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269372800] [2019-12-27 05:02:04,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:02:04,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:02:04,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:02:04,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:02:04,855 INFO L87 Difference]: Start difference. First operand 123272 states. Second operand 3 states. [2019-12-27 05:02:07,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:02:07,268 INFO L93 Difference]: Finished difference Result 122274 states and 522952 transitions. [2019-12-27 05:02:07,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:02:07,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 05:02:07,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:02:10,615 INFO L225 Difference]: With dead ends: 122274 [2019-12-27 05:02:10,615 INFO L226 Difference]: Without dead ends: 115176 [2019-12-27 05:02:10,616 INFO L631 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 [2019-12-27 05:02:15,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115176 states. [2019-12-27 05:02:17,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115176 to 115176. [2019-12-27 05:02:17,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115176 states. [2019-12-27 05:02:23,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115176 states to 115176 states and 491986 transitions. [2019-12-27 05:02:23,376 INFO L78 Accepts]: Start accepts. Automaton has 115176 states and 491986 transitions. Word has length 3 [2019-12-27 05:02:23,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:02:23,376 INFO L462 AbstractCegarLoop]: Abstraction has 115176 states and 491986 transitions. [2019-12-27 05:02:23,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:02:23,376 INFO L276 IsEmpty]: Start isEmpty. Operand 115176 states and 491986 transitions. [2019-12-27 05:02:23,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 05:02:23,380 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:02:23,381 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:02:23,381 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:02:23,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:02:23,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1323565433, now seen corresponding path program 1 times [2019-12-27 05:02:23,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:02:23,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630555026] [2019-12-27 05:02:23,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:02:23,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:02:23,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:02:23,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630555026] [2019-12-27 05:02:23,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:02:23,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:02:23,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732829046] [2019-12-27 05:02:23,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:02:23,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:02:23,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:02:23,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:02:23,501 INFO L87 Difference]: Start difference. First operand 115176 states and 491986 transitions. Second operand 4 states. [2019-12-27 05:02:25,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:02:25,006 INFO L93 Difference]: Finished difference Result 183662 states and 752302 transitions. [2019-12-27 05:02:25,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:02:25,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 05:02:25,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:02:30,961 INFO L225 Difference]: With dead ends: 183662 [2019-12-27 05:02:30,962 INFO L226 Difference]: Without dead ends: 183613 [2019-12-27 05:02:30,968 INFO L631 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 [2019-12-27 05:02:36,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183613 states. [2019-12-27 05:02:40,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183613 to 166753. [2019-12-27 05:02:40,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166753 states. [2019-12-27 05:02:41,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166753 states to 166753 states and 692266 transitions. [2019-12-27 05:02:41,028 INFO L78 Accepts]: Start accepts. Automaton has 166753 states and 692266 transitions. Word has length 11 [2019-12-27 05:02:41,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:02:41,029 INFO L462 AbstractCegarLoop]: Abstraction has 166753 states and 692266 transitions. [2019-12-27 05:02:41,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:02:41,029 INFO L276 IsEmpty]: Start isEmpty. Operand 166753 states and 692266 transitions. [2019-12-27 05:02:41,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 05:02:41,036 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:02:41,036 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:02:41,036 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:02:41,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:02:41,037 INFO L82 PathProgramCache]: Analyzing trace with hash -447069332, now seen corresponding path program 1 times [2019-12-27 05:02:41,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:02:41,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757817134] [2019-12-27 05:02:41,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:02:41,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:02:41,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:02:41,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757817134] [2019-12-27 05:02:41,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:02:41,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:02:41,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979278473] [2019-12-27 05:02:41,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:02:41,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:02:41,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:02:41,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:02:41,158 INFO L87 Difference]: Start difference. First operand 166753 states and 692266 transitions. Second operand 3 states. [2019-12-27 05:02:41,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:02:41,308 INFO L93 Difference]: Finished difference Result 35653 states and 116140 transitions. [2019-12-27 05:02:41,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:02:41,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 05:02:41,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:02:41,370 INFO L225 Difference]: With dead ends: 35653 [2019-12-27 05:02:41,371 INFO L226 Difference]: Without dead ends: 35653 [2019-12-27 05:02:41,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:02:46,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35653 states. [2019-12-27 05:02:46,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35653 to 35653. [2019-12-27 05:02:46,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35653 states. [2019-12-27 05:02:47,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35653 states to 35653 states and 116140 transitions. [2019-12-27 05:02:47,059 INFO L78 Accepts]: Start accepts. Automaton has 35653 states and 116140 transitions. Word has length 13 [2019-12-27 05:02:47,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:02:47,060 INFO L462 AbstractCegarLoop]: Abstraction has 35653 states and 116140 transitions. [2019-12-27 05:02:47,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:02:47,060 INFO L276 IsEmpty]: Start isEmpty. Operand 35653 states and 116140 transitions. [2019-12-27 05:02:47,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 05:02:47,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:02:47,063 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:02:47,063 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:02:47,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:02:47,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1594630647, now seen corresponding path program 1 times [2019-12-27 05:02:47,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:02:47,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614905111] [2019-12-27 05:02:47,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:02:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:02:47,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:02:47,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614905111] [2019-12-27 05:02:47,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:02:47,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:02:47,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128728101] [2019-12-27 05:02:47,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:02:47,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:02:47,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:02:47,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:02:47,182 INFO L87 Difference]: Start difference. First operand 35653 states and 116140 transitions. Second operand 5 states. [2019-12-27 05:02:47,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:02:47,689 INFO L93 Difference]: Finished difference Result 49040 states and 157904 transitions. [2019-12-27 05:02:47,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 05:02:47,690 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 05:02:47,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:02:47,807 INFO L225 Difference]: With dead ends: 49040 [2019-12-27 05:02:47,807 INFO L226 Difference]: Without dead ends: 49040 [2019-12-27 05:02:47,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:02:48,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49040 states. [2019-12-27 05:02:48,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49040 to 42019. [2019-12-27 05:02:48,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42019 states. [2019-12-27 05:02:48,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42019 states to 42019 states and 136433 transitions. [2019-12-27 05:02:48,992 INFO L78 Accepts]: Start accepts. Automaton has 42019 states and 136433 transitions. Word has length 16 [2019-12-27 05:02:48,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:02:48,993 INFO L462 AbstractCegarLoop]: Abstraction has 42019 states and 136433 transitions. [2019-12-27 05:02:48,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:02:48,993 INFO L276 IsEmpty]: Start isEmpty. Operand 42019 states and 136433 transitions. [2019-12-27 05:02:49,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 05:02:49,003 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:02:49,003 INFO L411 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] [2019-12-27 05:02:49,004 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:02:49,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:02:49,004 INFO L82 PathProgramCache]: Analyzing trace with hash -2124632115, now seen corresponding path program 1 times [2019-12-27 05:02:49,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:02:49,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090739804] [2019-12-27 05:02:49,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:02:49,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:02:49,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:02:49,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090739804] [2019-12-27 05:02:49,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:02:49,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:02:49,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190427604] [2019-12-27 05:02:49,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:02:49,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:02:49,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:02:49,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:02:49,100 INFO L87 Difference]: Start difference. First operand 42019 states and 136433 transitions. Second operand 6 states. [2019-12-27 05:02:50,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:02:50,010 INFO L93 Difference]: Finished difference Result 63228 states and 200109 transitions. [2019-12-27 05:02:50,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 05:02:50,010 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 05:02:50,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:02:50,155 INFO L225 Difference]: With dead ends: 63228 [2019-12-27 05:02:50,155 INFO L226 Difference]: Without dead ends: 63221 [2019-12-27 05:02:50,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 05:02:50,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63221 states. [2019-12-27 05:02:50,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63221 to 41773. [2019-12-27 05:02:50,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41773 states. [2019-12-27 05:02:51,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41773 states to 41773 states and 134916 transitions. [2019-12-27 05:02:51,020 INFO L78 Accepts]: Start accepts. Automaton has 41773 states and 134916 transitions. Word has length 22 [2019-12-27 05:02:51,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:02:51,020 INFO L462 AbstractCegarLoop]: Abstraction has 41773 states and 134916 transitions. [2019-12-27 05:02:51,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:02:51,020 INFO L276 IsEmpty]: Start isEmpty. Operand 41773 states and 134916 transitions. [2019-12-27 05:02:51,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 05:02:51,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:02:51,034 INFO L411 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] [2019-12-27 05:02:51,034 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:02:51,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:02:51,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1985611191, now seen corresponding path program 1 times [2019-12-27 05:02:51,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:02:51,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643991752] [2019-12-27 05:02:51,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:02:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:02:51,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:02:51,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643991752] [2019-12-27 05:02:51,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:02:51,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:02:51,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786973375] [2019-12-27 05:02:51,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:02:51,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:02:51,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:02:51,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:02:51,097 INFO L87 Difference]: Start difference. First operand 41773 states and 134916 transitions. Second operand 4 states. [2019-12-27 05:02:51,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:02:51,167 INFO L93 Difference]: Finished difference Result 16487 states and 50228 transitions. [2019-12-27 05:02:51,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:02:51,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 05:02:51,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:02:51,197 INFO L225 Difference]: With dead ends: 16487 [2019-12-27 05:02:51,197 INFO L226 Difference]: Without dead ends: 16487 [2019-12-27 05:02:51,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:02:51,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16487 states. [2019-12-27 05:02:51,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16487 to 16124. [2019-12-27 05:02:51,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16124 states. [2019-12-27 05:02:51,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16124 states to 16124 states and 49192 transitions. [2019-12-27 05:02:51,832 INFO L78 Accepts]: Start accepts. Automaton has 16124 states and 49192 transitions. Word has length 25 [2019-12-27 05:02:51,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:02:51,832 INFO L462 AbstractCegarLoop]: Abstraction has 16124 states and 49192 transitions. [2019-12-27 05:02:51,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:02:51,832 INFO L276 IsEmpty]: Start isEmpty. Operand 16124 states and 49192 transitions. [2019-12-27 05:02:51,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 05:02:51,845 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:02:51,845 INFO L411 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] [2019-12-27 05:02:51,845 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:02:51,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:02:51,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1670307795, now seen corresponding path program 1 times [2019-12-27 05:02:51,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:02:51,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135793001] [2019-12-27 05:02:51,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:02:51,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:02:51,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:02:51,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135793001] [2019-12-27 05:02:51,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:02:51,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:02:51,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963342952] [2019-12-27 05:02:51,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:02:51,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:02:51,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:02:51,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:02:51,897 INFO L87 Difference]: Start difference. First operand 16124 states and 49192 transitions. Second operand 3 states. [2019-12-27 05:02:52,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:02:52,001 INFO L93 Difference]: Finished difference Result 23364 states and 69824 transitions. [2019-12-27 05:02:52,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:02:52,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 05:02:52,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:02:52,032 INFO L225 Difference]: With dead ends: 23364 [2019-12-27 05:02:52,032 INFO L226 Difference]: Without dead ends: 23364 [2019-12-27 05:02:52,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:02:52,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23364 states. [2019-12-27 05:02:52,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23364 to 17891. [2019-12-27 05:02:52,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17891 states. [2019-12-27 05:02:52,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17891 states to 17891 states and 54042 transitions. [2019-12-27 05:02:52,331 INFO L78 Accepts]: Start accepts. Automaton has 17891 states and 54042 transitions. Word has length 27 [2019-12-27 05:02:52,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:02:52,332 INFO L462 AbstractCegarLoop]: Abstraction has 17891 states and 54042 transitions. [2019-12-27 05:02:52,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:02:52,332 INFO L276 IsEmpty]: Start isEmpty. Operand 17891 states and 54042 transitions. [2019-12-27 05:02:52,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 05:02:52,345 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:02:52,345 INFO L411 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] [2019-12-27 05:02:52,345 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:02:52,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:02:52,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1181786131, now seen corresponding path program 1 times [2019-12-27 05:02:52,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:02:52,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621166047] [2019-12-27 05:02:52,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:02:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:02:52,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:02:52,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621166047] [2019-12-27 05:02:52,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:02:52,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:02:52,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828468774] [2019-12-27 05:02:52,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:02:52,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:02:52,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:02:52,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:02:52,453 INFO L87 Difference]: Start difference. First operand 17891 states and 54042 transitions. Second operand 6 states. [2019-12-27 05:02:53,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:02:53,045 INFO L93 Difference]: Finished difference Result 25058 states and 73821 transitions. [2019-12-27 05:02:53,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 05:02:53,046 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 05:02:53,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:02:53,080 INFO L225 Difference]: With dead ends: 25058 [2019-12-27 05:02:53,081 INFO L226 Difference]: Without dead ends: 25058 [2019-12-27 05:02:53,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 05:02:53,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25058 states. [2019-12-27 05:02:53,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25058 to 20577. [2019-12-27 05:02:53,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20577 states. [2019-12-27 05:02:53,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20577 states to 20577 states and 61791 transitions. [2019-12-27 05:02:53,422 INFO L78 Accepts]: Start accepts. Automaton has 20577 states and 61791 transitions. Word has length 27 [2019-12-27 05:02:53,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:02:53,422 INFO L462 AbstractCegarLoop]: Abstraction has 20577 states and 61791 transitions. [2019-12-27 05:02:53,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:02:53,423 INFO L276 IsEmpty]: Start isEmpty. Operand 20577 states and 61791 transitions. [2019-12-27 05:02:53,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 05:02:53,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:02:53,445 INFO L411 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, 1, 1, 1, 1, 1] [2019-12-27 05:02:53,446 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:02:53,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:02:53,446 INFO L82 PathProgramCache]: Analyzing trace with hash -2129802289, now seen corresponding path program 1 times [2019-12-27 05:02:53,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:02:53,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141813315] [2019-12-27 05:02:53,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:02:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:02:53,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:02:53,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141813315] [2019-12-27 05:02:53,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:02:53,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:02:53,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103711391] [2019-12-27 05:02:53,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:02:53,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:02:53,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:02:53,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:02:53,559 INFO L87 Difference]: Start difference. First operand 20577 states and 61791 transitions. Second operand 7 states. [2019-12-27 05:02:54,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:02:54,625 INFO L93 Difference]: Finished difference Result 27892 states and 81805 transitions. [2019-12-27 05:02:54,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 05:02:54,625 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 05:02:54,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:02:54,663 INFO L225 Difference]: With dead ends: 27892 [2019-12-27 05:02:54,663 INFO L226 Difference]: Without dead ends: 27892 [2019-12-27 05:02:54,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 05:02:55,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27892 states. [2019-12-27 05:02:55,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27892 to 18703. [2019-12-27 05:02:55,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18703 states. [2019-12-27 05:02:55,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18703 states to 18703 states and 56394 transitions. [2019-12-27 05:02:55,250 INFO L78 Accepts]: Start accepts. Automaton has 18703 states and 56394 transitions. Word has length 33 [2019-12-27 05:02:55,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:02:55,250 INFO L462 AbstractCegarLoop]: Abstraction has 18703 states and 56394 transitions. [2019-12-27 05:02:55,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:02:55,250 INFO L276 IsEmpty]: Start isEmpty. Operand 18703 states and 56394 transitions. [2019-12-27 05:02:55,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 05:02:55,274 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:02:55,274 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:02:55,274 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:02:55,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:02:55,275 INFO L82 PathProgramCache]: Analyzing trace with hash -559725799, now seen corresponding path program 1 times [2019-12-27 05:02:55,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:02:55,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989078608] [2019-12-27 05:02:55,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:02:55,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:02:55,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:02:55,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989078608] [2019-12-27 05:02:55,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:02:55,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:02:55,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596488294] [2019-12-27 05:02:55,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:02:55,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:02:55,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:02:55,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:02:55,342 INFO L87 Difference]: Start difference. First operand 18703 states and 56394 transitions. Second operand 3 states. [2019-12-27 05:02:55,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:02:55,421 INFO L93 Difference]: Finished difference Result 18702 states and 56392 transitions. [2019-12-27 05:02:55,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:02:55,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 05:02:55,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:02:55,453 INFO L225 Difference]: With dead ends: 18702 [2019-12-27 05:02:55,454 INFO L226 Difference]: Without dead ends: 18702 [2019-12-27 05:02:55,454 INFO L631 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 [2019-12-27 05:02:55,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18702 states. [2019-12-27 05:02:55,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18702 to 18702. [2019-12-27 05:02:55,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18702 states. [2019-12-27 05:02:55,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18702 states to 18702 states and 56392 transitions. [2019-12-27 05:02:55,714 INFO L78 Accepts]: Start accepts. Automaton has 18702 states and 56392 transitions. Word has length 39 [2019-12-27 05:02:55,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:02:55,714 INFO L462 AbstractCegarLoop]: Abstraction has 18702 states and 56392 transitions. [2019-12-27 05:02:55,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:02:55,715 INFO L276 IsEmpty]: Start isEmpty. Operand 18702 states and 56392 transitions. [2019-12-27 05:02:55,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 05:02:55,736 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:02:55,736 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:02:55,737 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:02:55,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:02:55,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1324353592, now seen corresponding path program 1 times [2019-12-27 05:02:55,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:02:55,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782093276] [2019-12-27 05:02:55,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:02:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:02:55,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:02:55,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782093276] [2019-12-27 05:02:55,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:02:55,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:02:55,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747030131] [2019-12-27 05:02:55,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:02:55,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:02:55,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:02:55,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:02:55,827 INFO L87 Difference]: Start difference. First operand 18702 states and 56392 transitions. Second operand 5 states. [2019-12-27 05:02:55,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:02:55,924 INFO L93 Difference]: Finished difference Result 17378 states and 53366 transitions. [2019-12-27 05:02:55,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:02:55,924 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 05:02:55,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:02:55,960 INFO L225 Difference]: With dead ends: 17378 [2019-12-27 05:02:55,960 INFO L226 Difference]: Without dead ends: 17378 [2019-12-27 05:02:55,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:02:56,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17378 states. [2019-12-27 05:02:56,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17378 to 16713. [2019-12-27 05:02:56,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16713 states. [2019-12-27 05:02:56,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16713 states to 16713 states and 51571 transitions. [2019-12-27 05:02:56,369 INFO L78 Accepts]: Start accepts. Automaton has 16713 states and 51571 transitions. Word has length 40 [2019-12-27 05:02:56,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:02:56,369 INFO L462 AbstractCegarLoop]: Abstraction has 16713 states and 51571 transitions. [2019-12-27 05:02:56,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:02:56,370 INFO L276 IsEmpty]: Start isEmpty. Operand 16713 states and 51571 transitions. [2019-12-27 05:02:56,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:02:56,393 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:02:56,393 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:02:56,394 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:02:56,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:02:56,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1560507821, now seen corresponding path program 1 times [2019-12-27 05:02:56,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:02:56,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190106195] [2019-12-27 05:02:56,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:02:56,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:02:56,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:02:56,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190106195] [2019-12-27 05:02:56,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:02:56,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:02:56,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220622367] [2019-12-27 05:02:56,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:02:56,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:02:56,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:02:56,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:02:56,453 INFO L87 Difference]: Start difference. First operand 16713 states and 51571 transitions. Second operand 3 states. [2019-12-27 05:02:56,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:02:56,550 INFO L93 Difference]: Finished difference Result 22522 states and 68098 transitions. [2019-12-27 05:02:56,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:02:56,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 05:02:56,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:02:56,579 INFO L225 Difference]: With dead ends: 22522 [2019-12-27 05:02:56,579 INFO L226 Difference]: Without dead ends: 22522 [2019-12-27 05:02:56,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:02:56,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22522 states. [2019-12-27 05:02:56,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22522 to 16531. [2019-12-27 05:02:56,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16531 states. [2019-12-27 05:02:56,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16531 states to 16531 states and 50417 transitions. [2019-12-27 05:02:56,877 INFO L78 Accepts]: Start accepts. Automaton has 16531 states and 50417 transitions. Word has length 64 [2019-12-27 05:02:56,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:02:56,878 INFO L462 AbstractCegarLoop]: Abstraction has 16531 states and 50417 transitions. [2019-12-27 05:02:56,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:02:56,878 INFO L276 IsEmpty]: Start isEmpty. Operand 16531 states and 50417 transitions. [2019-12-27 05:02:56,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:02:56,897 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:02:56,897 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:02:56,897 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:02:56,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:02:56,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1583187919, now seen corresponding path program 1 times [2019-12-27 05:02:56,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:02:56,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467818702] [2019-12-27 05:02:56,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:02:56,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:02:57,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:02:57,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467818702] [2019-12-27 05:02:57,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:02:57,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:02:57,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548822298] [2019-12-27 05:02:57,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:02:57,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:02:57,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:02:57,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:02:57,025 INFO L87 Difference]: Start difference. First operand 16531 states and 50417 transitions. Second operand 7 states. [2019-12-27 05:02:57,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:02:57,807 INFO L93 Difference]: Finished difference Result 48075 states and 145792 transitions. [2019-12-27 05:02:57,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 05:02:57,807 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 05:02:57,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:02:57,868 INFO L225 Difference]: With dead ends: 48075 [2019-12-27 05:02:57,868 INFO L226 Difference]: Without dead ends: 37314 [2019-12-27 05:02:57,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 05:02:57,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37314 states. [2019-12-27 05:02:58,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37314 to 20250. [2019-12-27 05:02:58,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20250 states. [2019-12-27 05:02:58,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20250 states to 20250 states and 62030 transitions. [2019-12-27 05:02:58,288 INFO L78 Accepts]: Start accepts. Automaton has 20250 states and 62030 transitions. Word has length 64 [2019-12-27 05:02:58,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:02:58,288 INFO L462 AbstractCegarLoop]: Abstraction has 20250 states and 62030 transitions. [2019-12-27 05:02:58,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:02:58,288 INFO L276 IsEmpty]: Start isEmpty. Operand 20250 states and 62030 transitions. [2019-12-27 05:02:58,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:02:58,313 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:02:58,313 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:02:58,314 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:02:58,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:02:58,314 INFO L82 PathProgramCache]: Analyzing trace with hash 713705511, now seen corresponding path program 2 times [2019-12-27 05:02:58,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:02:58,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500601287] [2019-12-27 05:02:58,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:02:58,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:02:58,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:02:58,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500601287] [2019-12-27 05:02:58,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:02:58,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:02:58,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382381167] [2019-12-27 05:02:58,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:02:58,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:02:58,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:02:58,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:02:58,410 INFO L87 Difference]: Start difference. First operand 20250 states and 62030 transitions. Second operand 7 states. [2019-12-27 05:02:58,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:02:58,890 INFO L93 Difference]: Finished difference Result 55081 states and 165238 transitions. [2019-12-27 05:02:58,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 05:02:58,891 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 05:02:58,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:02:58,955 INFO L225 Difference]: With dead ends: 55081 [2019-12-27 05:02:58,955 INFO L226 Difference]: Without dead ends: 40243 [2019-12-27 05:02:58,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 05:02:59,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40243 states. [2019-12-27 05:02:59,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40243 to 23749. [2019-12-27 05:02:59,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23749 states. [2019-12-27 05:02:59,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23749 states to 23749 states and 72556 transitions. [2019-12-27 05:02:59,465 INFO L78 Accepts]: Start accepts. Automaton has 23749 states and 72556 transitions. Word has length 64 [2019-12-27 05:02:59,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:02:59,465 INFO L462 AbstractCegarLoop]: Abstraction has 23749 states and 72556 transitions. [2019-12-27 05:02:59,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:02:59,465 INFO L276 IsEmpty]: Start isEmpty. Operand 23749 states and 72556 transitions. [2019-12-27 05:02:59,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:02:59,493 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:02:59,493 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:02:59,494 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:02:59,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:02:59,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1281034255, now seen corresponding path program 3 times [2019-12-27 05:02:59,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:02:59,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604063409] [2019-12-27 05:02:59,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:02:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:02:59,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:02:59,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604063409] [2019-12-27 05:02:59,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:02:59,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:02:59,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656207285] [2019-12-27 05:02:59,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:02:59,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:02:59,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:02:59,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:02:59,613 INFO L87 Difference]: Start difference. First operand 23749 states and 72556 transitions. Second operand 9 states. [2019-12-27 05:03:01,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:03:01,313 INFO L93 Difference]: Finished difference Result 74583 states and 224180 transitions. [2019-12-27 05:03:01,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 05:03:01,313 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 05:03:01,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:03:01,422 INFO L225 Difference]: With dead ends: 74583 [2019-12-27 05:03:01,422 INFO L226 Difference]: Without dead ends: 71960 [2019-12-27 05:03:01,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-12-27 05:03:01,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71960 states. [2019-12-27 05:03:02,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71960 to 23905. [2019-12-27 05:03:02,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23905 states. [2019-12-27 05:03:02,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23905 states to 23905 states and 73218 transitions. [2019-12-27 05:03:02,122 INFO L78 Accepts]: Start accepts. Automaton has 23905 states and 73218 transitions. Word has length 64 [2019-12-27 05:03:02,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:03:02,122 INFO L462 AbstractCegarLoop]: Abstraction has 23905 states and 73218 transitions. [2019-12-27 05:03:02,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:03:02,122 INFO L276 IsEmpty]: Start isEmpty. Operand 23905 states and 73218 transitions. [2019-12-27 05:03:02,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:03:02,149 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:03:02,149 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:03:02,149 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:03:02,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:03:02,149 INFO L82 PathProgramCache]: Analyzing trace with hash 229645845, now seen corresponding path program 4 times [2019-12-27 05:03:02,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:03:02,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317550160] [2019-12-27 05:03:02,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:03:02,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:03:02,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:03:02,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317550160] [2019-12-27 05:03:02,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:03:02,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:03:02,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781125352] [2019-12-27 05:03:02,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:03:02,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:03:02,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:03:02,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:03:02,276 INFO L87 Difference]: Start difference. First operand 23905 states and 73218 transitions. Second operand 9 states. [2019-12-27 05:03:03,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:03:03,666 INFO L93 Difference]: Finished difference Result 87530 states and 263304 transitions. [2019-12-27 05:03:03,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 05:03:03,666 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 05:03:03,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:03:03,797 INFO L225 Difference]: With dead ends: 87530 [2019-12-27 05:03:03,798 INFO L226 Difference]: Without dead ends: 84971 [2019-12-27 05:03:03,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-27 05:03:04,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84971 states. [2019-12-27 05:03:04,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84971 to 23942. [2019-12-27 05:03:04,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23942 states. [2019-12-27 05:03:04,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23942 states to 23942 states and 73416 transitions. [2019-12-27 05:03:04,948 INFO L78 Accepts]: Start accepts. Automaton has 23942 states and 73416 transitions. Word has length 64 [2019-12-27 05:03:04,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:03:04,948 INFO L462 AbstractCegarLoop]: Abstraction has 23942 states and 73416 transitions. [2019-12-27 05:03:04,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:03:04,949 INFO L276 IsEmpty]: Start isEmpty. Operand 23942 states and 73416 transitions. [2019-12-27 05:03:04,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:03:04,975 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:03:04,975 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:03:04,975 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:03:04,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:03:04,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1004584677, now seen corresponding path program 5 times [2019-12-27 05:03:04,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:03:04,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254443747] [2019-12-27 05:03:04,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:03:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:03:05,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:03:05,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254443747] [2019-12-27 05:03:05,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:03:05,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 05:03:05,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148484569] [2019-12-27 05:03:05,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:03:05,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:03:05,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:03:05,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:03:05,112 INFO L87 Difference]: Start difference. First operand 23942 states and 73416 transitions. Second operand 7 states. [2019-12-27 05:03:06,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:03:06,001 INFO L93 Difference]: Finished difference Result 43709 states and 130753 transitions. [2019-12-27 05:03:06,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 05:03:06,002 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 05:03:06,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:03:06,060 INFO L225 Difference]: With dead ends: 43709 [2019-12-27 05:03:06,060 INFO L226 Difference]: Without dead ends: 43433 [2019-12-27 05:03:06,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 05:03:06,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43433 states. [2019-12-27 05:03:06,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43433 to 32445. [2019-12-27 05:03:06,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32445 states. [2019-12-27 05:03:06,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32445 states to 32445 states and 98717 transitions. [2019-12-27 05:03:06,629 INFO L78 Accepts]: Start accepts. Automaton has 32445 states and 98717 transitions. Word has length 64 [2019-12-27 05:03:06,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:03:06,629 INFO L462 AbstractCegarLoop]: Abstraction has 32445 states and 98717 transitions. [2019-12-27 05:03:06,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:03:06,629 INFO L276 IsEmpty]: Start isEmpty. Operand 32445 states and 98717 transitions. [2019-12-27 05:03:06,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:03:06,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:03:06,662 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:03:06,663 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:03:06,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:03:06,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1162994701, now seen corresponding path program 6 times [2019-12-27 05:03:06,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:03:06,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240123112] [2019-12-27 05:03:06,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:03:06,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:03:06,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:03:06,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240123112] [2019-12-27 05:03:06,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:03:06,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:03:06,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171135315] [2019-12-27 05:03:06,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:03:06,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:03:06,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:03:06,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:03:06,748 INFO L87 Difference]: Start difference. First operand 32445 states and 98717 transitions. Second operand 5 states. [2019-12-27 05:03:07,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:03:07,178 INFO L93 Difference]: Finished difference Result 34653 states and 104903 transitions. [2019-12-27 05:03:07,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 05:03:07,178 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-27 05:03:07,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:03:07,261 INFO L225 Difference]: With dead ends: 34653 [2019-12-27 05:03:07,261 INFO L226 Difference]: Without dead ends: 34653 [2019-12-27 05:03:07,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:03:07,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34653 states. [2019-12-27 05:03:08,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34653 to 32870. [2019-12-27 05:03:08,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32870 states. [2019-12-27 05:03:08,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32870 states to 32870 states and 100018 transitions. [2019-12-27 05:03:08,198 INFO L78 Accepts]: Start accepts. Automaton has 32870 states and 100018 transitions. Word has length 64 [2019-12-27 05:03:08,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:03:08,198 INFO L462 AbstractCegarLoop]: Abstraction has 32870 states and 100018 transitions. [2019-12-27 05:03:08,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:03:08,198 INFO L276 IsEmpty]: Start isEmpty. Operand 32870 states and 100018 transitions. [2019-12-27 05:03:08,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:03:08,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:03:08,233 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:03:08,234 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:03:08,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:03:08,234 INFO L82 PathProgramCache]: Analyzing trace with hash -815010243, now seen corresponding path program 7 times [2019-12-27 05:03:08,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:03:08,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269816476] [2019-12-27 05:03:08,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:03:08,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:03:08,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:03:08,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269816476] [2019-12-27 05:03:08,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:03:08,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:03:08,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497188346] [2019-12-27 05:03:08,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:03:08,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:03:08,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:03:08,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:03:08,319 INFO L87 Difference]: Start difference. First operand 32870 states and 100018 transitions. Second operand 6 states. [2019-12-27 05:03:08,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:03:08,760 INFO L93 Difference]: Finished difference Result 35179 states and 106286 transitions. [2019-12-27 05:03:08,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 05:03:08,761 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-27 05:03:08,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:03:08,808 INFO L225 Difference]: With dead ends: 35179 [2019-12-27 05:03:08,809 INFO L226 Difference]: Without dead ends: 35179 [2019-12-27 05:03:08,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:03:08,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35179 states. [2019-12-27 05:03:09,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35179 to 33257. [2019-12-27 05:03:09,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33257 states. [2019-12-27 05:03:09,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33257 states to 33257 states and 101108 transitions. [2019-12-27 05:03:09,327 INFO L78 Accepts]: Start accepts. Automaton has 33257 states and 101108 transitions. Word has length 64 [2019-12-27 05:03:09,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:03:09,327 INFO L462 AbstractCegarLoop]: Abstraction has 33257 states and 101108 transitions. [2019-12-27 05:03:09,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:03:09,328 INFO L276 IsEmpty]: Start isEmpty. Operand 33257 states and 101108 transitions. [2019-12-27 05:03:09,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:03:09,363 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:03:09,363 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:03:09,363 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:03:09,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:03:09,363 INFO L82 PathProgramCache]: Analyzing trace with hash 2061313889, now seen corresponding path program 8 times [2019-12-27 05:03:09,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:03:09,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835269595] [2019-12-27 05:03:09,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:03:09,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:03:09,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:03:09,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835269595] [2019-12-27 05:03:09,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:03:09,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 05:03:09,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76474380] [2019-12-27 05:03:09,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:03:09,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:03:09,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:03:09,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:03:09,492 INFO L87 Difference]: Start difference. First operand 33257 states and 101108 transitions. Second operand 7 states. [2019-12-27 05:03:10,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:03:10,335 INFO L93 Difference]: Finished difference Result 59757 states and 177896 transitions. [2019-12-27 05:03:10,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 05:03:10,336 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 05:03:10,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:03:10,418 INFO L225 Difference]: With dead ends: 59757 [2019-12-27 05:03:10,419 INFO L226 Difference]: Without dead ends: 59589 [2019-12-27 05:03:10,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-27 05:03:10,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59589 states. [2019-12-27 05:03:11,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59589 to 33687. [2019-12-27 05:03:11,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33687 states. [2019-12-27 05:03:11,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33687 states to 33687 states and 102508 transitions. [2019-12-27 05:03:11,456 INFO L78 Accepts]: Start accepts. Automaton has 33687 states and 102508 transitions. Word has length 64 [2019-12-27 05:03:11,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:03:11,456 INFO L462 AbstractCegarLoop]: Abstraction has 33687 states and 102508 transitions. [2019-12-27 05:03:11,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:03:11,456 INFO L276 IsEmpty]: Start isEmpty. Operand 33687 states and 102508 transitions. [2019-12-27 05:03:11,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:03:11,492 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:03:11,492 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:03:11,492 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:03:11,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:03:11,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1576440573, now seen corresponding path program 9 times [2019-12-27 05:03:11,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:03:11,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087816189] [2019-12-27 05:03:11,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:03:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:03:11,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:03:11,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087816189] [2019-12-27 05:03:11,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:03:11,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:03:11,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526045663] [2019-12-27 05:03:11,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:03:11,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:03:11,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:03:11,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:03:11,617 INFO L87 Difference]: Start difference. First operand 33687 states and 102508 transitions. Second operand 8 states. [2019-12-27 05:03:13,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:03:13,035 INFO L93 Difference]: Finished difference Result 60042 states and 179901 transitions. [2019-12-27 05:03:13,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 05:03:13,035 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 05:03:13,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:03:13,120 INFO L225 Difference]: With dead ends: 60042 [2019-12-27 05:03:13,121 INFO L226 Difference]: Without dead ends: 59586 [2019-12-27 05:03:13,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-27 05:03:13,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59586 states. [2019-12-27 05:03:13,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59586 to 39752. [2019-12-27 05:03:13,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39752 states. [2019-12-27 05:03:13,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39752 states to 39752 states and 120977 transitions. [2019-12-27 05:03:13,911 INFO L78 Accepts]: Start accepts. Automaton has 39752 states and 120977 transitions. Word has length 64 [2019-12-27 05:03:13,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:03:13,912 INFO L462 AbstractCegarLoop]: Abstraction has 39752 states and 120977 transitions. [2019-12-27 05:03:13,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:03:13,912 INFO L276 IsEmpty]: Start isEmpty. Operand 39752 states and 120977 transitions. [2019-12-27 05:03:13,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:03:13,956 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:03:13,956 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:03:13,956 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:03:13,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:03:13,957 INFO L82 PathProgramCache]: Analyzing trace with hash 268069635, now seen corresponding path program 10 times [2019-12-27 05:03:13,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:03:13,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924288484] [2019-12-27 05:03:13,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:03:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:03:14,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:03:14,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924288484] [2019-12-27 05:03:14,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:03:14,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 05:03:14,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479539653] [2019-12-27 05:03:14,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 05:03:14,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:03:14,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 05:03:14,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-27 05:03:14,162 INFO L87 Difference]: Start difference. First operand 39752 states and 120977 transitions. Second operand 10 states. [2019-12-27 05:03:16,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:03:16,293 INFO L93 Difference]: Finished difference Result 60575 states and 180250 transitions. [2019-12-27 05:03:16,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 05:03:16,294 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-27 05:03:16,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:03:16,384 INFO L225 Difference]: With dead ends: 60575 [2019-12-27 05:03:16,384 INFO L226 Difference]: Without dead ends: 60498 [2019-12-27 05:03:16,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2019-12-27 05:03:16,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60498 states. [2019-12-27 05:03:17,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60498 to 36825. [2019-12-27 05:03:17,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36825 states. [2019-12-27 05:03:17,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36825 states to 36825 states and 110761 transitions. [2019-12-27 05:03:17,127 INFO L78 Accepts]: Start accepts. Automaton has 36825 states and 110761 transitions. Word has length 64 [2019-12-27 05:03:17,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:03:17,127 INFO L462 AbstractCegarLoop]: Abstraction has 36825 states and 110761 transitions. [2019-12-27 05:03:17,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 05:03:17,127 INFO L276 IsEmpty]: Start isEmpty. Operand 36825 states and 110761 transitions. [2019-12-27 05:03:17,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:03:17,168 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:03:17,169 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:03:17,169 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:03:17,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:03:17,169 INFO L82 PathProgramCache]: Analyzing trace with hash 552913381, now seen corresponding path program 11 times [2019-12-27 05:03:17,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:03:17,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549075370] [2019-12-27 05:03:17,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:03:17,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:03:17,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:03:17,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549075370] [2019-12-27 05:03:17,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:03:17,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:03:17,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447878] [2019-12-27 05:03:17,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:03:17,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:03:17,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:03:17,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:03:17,285 INFO L87 Difference]: Start difference. First operand 36825 states and 110761 transitions. Second operand 8 states. [2019-12-27 05:03:18,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:03:18,650 INFO L93 Difference]: Finished difference Result 64796 states and 192002 transitions. [2019-12-27 05:03:18,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 05:03:18,651 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 05:03:18,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:03:18,746 INFO L225 Difference]: With dead ends: 64796 [2019-12-27 05:03:18,746 INFO L226 Difference]: Without dead ends: 64492 [2019-12-27 05:03:18,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2019-12-27 05:03:18,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64492 states. [2019-12-27 05:03:19,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64492 to 37205. [2019-12-27 05:03:19,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37205 states. [2019-12-27 05:03:20,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37205 states to 37205 states and 111545 transitions. [2019-12-27 05:03:20,019 INFO L78 Accepts]: Start accepts. Automaton has 37205 states and 111545 transitions. Word has length 64 [2019-12-27 05:03:20,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:03:20,020 INFO L462 AbstractCegarLoop]: Abstraction has 37205 states and 111545 transitions. [2019-12-27 05:03:20,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:03:20,020 INFO L276 IsEmpty]: Start isEmpty. Operand 37205 states and 111545 transitions. [2019-12-27 05:03:20,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:03:20,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:03:20,058 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:03:20,058 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:03:20,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:03:20,059 INFO L82 PathProgramCache]: Analyzing trace with hash 395740839, now seen corresponding path program 12 times [2019-12-27 05:03:20,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:03:20,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225445993] [2019-12-27 05:03:20,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:03:20,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:03:20,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:03:20,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225445993] [2019-12-27 05:03:20,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:03:20,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:03:20,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196209477] [2019-12-27 05:03:20,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:03:20,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:03:20,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:03:20,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:03:20,169 INFO L87 Difference]: Start difference. First operand 37205 states and 111545 transitions. Second operand 8 states. [2019-12-27 05:03:22,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:03:22,014 INFO L93 Difference]: Finished difference Result 60574 states and 177957 transitions. [2019-12-27 05:03:22,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 05:03:22,014 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 05:03:22,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:03:22,098 INFO L225 Difference]: With dead ends: 60574 [2019-12-27 05:03:22,099 INFO L226 Difference]: Without dead ends: 60334 [2019-12-27 05:03:22,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2019-12-27 05:03:22,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60334 states. [2019-12-27 05:03:22,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60334 to 38699. [2019-12-27 05:03:22,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38699 states. [2019-12-27 05:03:22,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38699 states to 38699 states and 116060 transitions. [2019-12-27 05:03:22,841 INFO L78 Accepts]: Start accepts. Automaton has 38699 states and 116060 transitions. Word has length 64 [2019-12-27 05:03:22,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:03:22,841 INFO L462 AbstractCegarLoop]: Abstraction has 38699 states and 116060 transitions. [2019-12-27 05:03:22,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:03:22,841 INFO L276 IsEmpty]: Start isEmpty. Operand 38699 states and 116060 transitions. [2019-12-27 05:03:22,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:03:22,883 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:03:22,884 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:03:22,884 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:03:22,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:03:22,884 INFO L82 PathProgramCache]: Analyzing trace with hash 2035065745, now seen corresponding path program 13 times [2019-12-27 05:03:22,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:03:22,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327360285] [2019-12-27 05:03:22,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:03:22,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:03:22,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:03:22,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327360285] [2019-12-27 05:03:22,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:03:22,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:03:22,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724281453] [2019-12-27 05:03:22,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:03:22,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:03:22,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:03:22,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:03:22,984 INFO L87 Difference]: Start difference. First operand 38699 states and 116060 transitions. Second operand 6 states. [2019-12-27 05:03:23,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:03:23,856 INFO L93 Difference]: Finished difference Result 45176 states and 134074 transitions. [2019-12-27 05:03:23,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 05:03:23,857 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-27 05:03:23,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:03:23,945 INFO L225 Difference]: With dead ends: 45176 [2019-12-27 05:03:23,945 INFO L226 Difference]: Without dead ends: 45176 [2019-12-27 05:03:23,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 05:03:24,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45176 states. [2019-12-27 05:03:24,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45176 to 38648. [2019-12-27 05:03:24,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38648 states. [2019-12-27 05:03:24,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38648 states to 38648 states and 115906 transitions. [2019-12-27 05:03:24,948 INFO L78 Accepts]: Start accepts. Automaton has 38648 states and 115906 transitions. Word has length 64 [2019-12-27 05:03:24,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:03:24,949 INFO L462 AbstractCegarLoop]: Abstraction has 38648 states and 115906 transitions. [2019-12-27 05:03:24,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:03:24,949 INFO L276 IsEmpty]: Start isEmpty. Operand 38648 states and 115906 transitions. [2019-12-27 05:03:24,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:03:24,988 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:03:24,988 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:03:24,988 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:03:24,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:03:24,988 INFO L82 PathProgramCache]: Analyzing trace with hash -2127343555, now seen corresponding path program 14 times [2019-12-27 05:03:24,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:03:24,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875763067] [2019-12-27 05:03:24,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:03:25,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:03:25,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:03:25,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875763067] [2019-12-27 05:03:25,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:03:25,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 05:03:25,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129980619] [2019-12-27 05:03:25,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:03:25,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:03:25,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:03:25,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:03:25,093 INFO L87 Difference]: Start difference. First operand 38648 states and 115906 transitions. Second operand 7 states. [2019-12-27 05:03:26,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:03:26,179 INFO L93 Difference]: Finished difference Result 46891 states and 138897 transitions. [2019-12-27 05:03:26,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 05:03:26,180 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 05:03:26,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:03:26,242 INFO L225 Difference]: With dead ends: 46891 [2019-12-27 05:03:26,242 INFO L226 Difference]: Without dead ends: 46891 [2019-12-27 05:03:26,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-12-27 05:03:26,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46891 states. [2019-12-27 05:03:26,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46891 to 38592. [2019-12-27 05:03:26,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38592 states. [2019-12-27 05:03:26,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38592 states to 38592 states and 115746 transitions. [2019-12-27 05:03:26,876 INFO L78 Accepts]: Start accepts. Automaton has 38592 states and 115746 transitions. Word has length 64 [2019-12-27 05:03:26,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:03:26,876 INFO L462 AbstractCegarLoop]: Abstraction has 38592 states and 115746 transitions. [2019-12-27 05:03:26,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:03:26,877 INFO L276 IsEmpty]: Start isEmpty. Operand 38592 states and 115746 transitions. [2019-12-27 05:03:26,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:03:26,918 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:03:26,918 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:03:26,918 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:03:26,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:03:26,918 INFO L82 PathProgramCache]: Analyzing trace with hash 953201443, now seen corresponding path program 15 times [2019-12-27 05:03:26,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:03:26,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649479964] [2019-12-27 05:03:26,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:03:26,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:03:27,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:03:27,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649479964] [2019-12-27 05:03:27,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:03:27,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:03:27,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683882664] [2019-12-27 05:03:27,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:03:27,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:03:27,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:03:27,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:03:27,018 INFO L87 Difference]: Start difference. First operand 38592 states and 115746 transitions. Second operand 8 states. [2019-12-27 05:03:28,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:03:28,712 INFO L93 Difference]: Finished difference Result 63887 states and 187424 transitions. [2019-12-27 05:03:28,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 05:03:28,713 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 05:03:28,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:03:28,802 INFO L225 Difference]: With dead ends: 63887 [2019-12-27 05:03:28,802 INFO L226 Difference]: Without dead ends: 63887 [2019-12-27 05:03:28,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2019-12-27 05:03:28,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63887 states. [2019-12-27 05:03:29,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63887 to 38209. [2019-12-27 05:03:29,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38209 states. [2019-12-27 05:03:29,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38209 states to 38209 states and 114634 transitions. [2019-12-27 05:03:29,922 INFO L78 Accepts]: Start accepts. Automaton has 38209 states and 114634 transitions. Word has length 64 [2019-12-27 05:03:29,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:03:29,922 INFO L462 AbstractCegarLoop]: Abstraction has 38209 states and 114634 transitions. [2019-12-27 05:03:29,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:03:29,922 INFO L276 IsEmpty]: Start isEmpty. Operand 38209 states and 114634 transitions. [2019-12-27 05:03:29,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:03:29,962 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:03:29,962 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:03:29,962 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:03:29,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:03:29,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1795232177, now seen corresponding path program 16 times [2019-12-27 05:03:29,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:03:29,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887789369] [2019-12-27 05:03:29,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:03:29,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:03:30,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:03:30,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887789369] [2019-12-27 05:03:30,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:03:30,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:03:30,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108707058] [2019-12-27 05:03:30,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:03:30,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:03:30,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:03:30,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:03:30,019 INFO L87 Difference]: Start difference. First operand 38209 states and 114634 transitions. Second operand 4 states. [2019-12-27 05:03:30,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:03:30,319 INFO L93 Difference]: Finished difference Result 65854 states and 197592 transitions. [2019-12-27 05:03:30,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:03:30,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-27 05:03:30,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:03:30,388 INFO L225 Difference]: With dead ends: 65854 [2019-12-27 05:03:30,388 INFO L226 Difference]: Without dead ends: 30333 [2019-12-27 05:03:30,389 INFO L631 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 [2019-12-27 05:03:30,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30333 states. [2019-12-27 05:03:30,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30333 to 30333. [2019-12-27 05:03:30,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30333 states. [2019-12-27 05:03:30,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30333 states to 30333 states and 90889 transitions. [2019-12-27 05:03:30,977 INFO L78 Accepts]: Start accepts. Automaton has 30333 states and 90889 transitions. Word has length 64 [2019-12-27 05:03:30,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:03:30,977 INFO L462 AbstractCegarLoop]: Abstraction has 30333 states and 90889 transitions. [2019-12-27 05:03:30,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:03:30,978 INFO L276 IsEmpty]: Start isEmpty. Operand 30333 states and 90889 transitions. [2019-12-27 05:03:31,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:03:31,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:03:31,013 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:03:31,013 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:03:31,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:03:31,013 INFO L82 PathProgramCache]: Analyzing trace with hash -572465931, now seen corresponding path program 17 times [2019-12-27 05:03:31,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:03:31,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789145927] [2019-12-27 05:03:31,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:03:31,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:03:31,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:03:31,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789145927] [2019-12-27 05:03:31,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:03:31,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 05:03:31,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65575070] [2019-12-27 05:03:31,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:03:31,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:03:31,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:03:31,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:03:31,105 INFO L87 Difference]: Start difference. First operand 30333 states and 90889 transitions. Second operand 8 states. [2019-12-27 05:03:32,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:03:32,172 INFO L93 Difference]: Finished difference Result 88583 states and 262790 transitions. [2019-12-27 05:03:32,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 05:03:32,173 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 05:03:32,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:03:32,292 INFO L225 Difference]: With dead ends: 88583 [2019-12-27 05:03:32,292 INFO L226 Difference]: Without dead ends: 82101 [2019-12-27 05:03:32,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-27 05:03:32,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82101 states. [2019-12-27 05:03:33,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82101 to 30306. [2019-12-27 05:03:33,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30306 states. [2019-12-27 05:03:33,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30306 states to 30306 states and 90812 transitions. [2019-12-27 05:03:33,582 INFO L78 Accepts]: Start accepts. Automaton has 30306 states and 90812 transitions. Word has length 64 [2019-12-27 05:03:33,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:03:33,582 INFO L462 AbstractCegarLoop]: Abstraction has 30306 states and 90812 transitions. [2019-12-27 05:03:33,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:03:33,582 INFO L276 IsEmpty]: Start isEmpty. Operand 30306 states and 90812 transitions. [2019-12-27 05:03:33,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:03:33,616 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:03:33,616 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:03:33,616 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:03:33,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:03:33,617 INFO L82 PathProgramCache]: Analyzing trace with hash -89693437, now seen corresponding path program 18 times [2019-12-27 05:03:33,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:03:33,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415733115] [2019-12-27 05:03:33,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:03:33,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:03:33,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:03:33,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415733115] [2019-12-27 05:03:33,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:03:33,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:03:33,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439775662] [2019-12-27 05:03:33,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:03:33,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:03:33,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:03:33,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:03:33,676 INFO L87 Difference]: Start difference. First operand 30306 states and 90812 transitions. Second operand 4 states. [2019-12-27 05:03:33,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:03:33,866 INFO L93 Difference]: Finished difference Result 51812 states and 155103 transitions. [2019-12-27 05:03:33,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:03:33,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-27 05:03:33,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:03:33,898 INFO L225 Difference]: With dead ends: 51812 [2019-12-27 05:03:33,898 INFO L226 Difference]: Without dead ends: 22538 [2019-12-27 05:03:33,898 INFO L631 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 [2019-12-27 05:03:33,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22538 states. [2019-12-27 05:03:34,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22538 to 22538. [2019-12-27 05:03:34,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22538 states. [2019-12-27 05:03:34,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22538 states to 22538 states and 67136 transitions. [2019-12-27 05:03:34,230 INFO L78 Accepts]: Start accepts. Automaton has 22538 states and 67136 transitions. Word has length 64 [2019-12-27 05:03:34,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:03:34,230 INFO L462 AbstractCegarLoop]: Abstraction has 22538 states and 67136 transitions. [2019-12-27 05:03:34,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:03:34,230 INFO L276 IsEmpty]: Start isEmpty. Operand 22538 states and 67136 transitions. [2019-12-27 05:03:34,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:03:34,254 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:03:34,254 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:03:34,254 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:03:34,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:03:34,254 INFO L82 PathProgramCache]: Analyzing trace with hash -372801074, now seen corresponding path program 1 times [2019-12-27 05:03:34,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:03:34,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619057345] [2019-12-27 05:03:34,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:03:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:03:34,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:03:34,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619057345] [2019-12-27 05:03:34,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:03:34,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:03:34,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141761251] [2019-12-27 05:03:34,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:03:34,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:03:34,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:03:34,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:03:34,364 INFO L87 Difference]: Start difference. First operand 22538 states and 67136 transitions. Second operand 9 states. [2019-12-27 05:03:35,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:03:35,816 INFO L93 Difference]: Finished difference Result 37964 states and 111779 transitions. [2019-12-27 05:03:35,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 05:03:35,816 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 05:03:35,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:03:35,859 INFO L225 Difference]: With dead ends: 37964 [2019-12-27 05:03:35,859 INFO L226 Difference]: Without dead ends: 30223 [2019-12-27 05:03:35,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2019-12-27 05:03:35,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30223 states. [2019-12-27 05:03:36,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30223 to 22900. [2019-12-27 05:03:36,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22900 states. [2019-12-27 05:03:36,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22900 states to 22900 states and 67863 transitions. [2019-12-27 05:03:36,257 INFO L78 Accepts]: Start accepts. Automaton has 22900 states and 67863 transitions. Word has length 65 [2019-12-27 05:03:36,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:03:36,257 INFO L462 AbstractCegarLoop]: Abstraction has 22900 states and 67863 transitions. [2019-12-27 05:03:36,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:03:36,258 INFO L276 IsEmpty]: Start isEmpty. Operand 22900 states and 67863 transitions. [2019-12-27 05:03:36,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:03:36,284 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:03:36,284 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:03:36,284 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:03:36,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:03:36,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1085311480, now seen corresponding path program 2 times [2019-12-27 05:03:36,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:03:36,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403399965] [2019-12-27 05:03:36,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:03:36,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:03:36,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:03:36,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403399965] [2019-12-27 05:03:36,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:03:36,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 05:03:36,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478368569] [2019-12-27 05:03:36,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 05:03:36,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:03:36,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 05:03:36,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-27 05:03:36,556 INFO L87 Difference]: Start difference. First operand 22900 states and 67863 transitions. Second operand 13 states. [2019-12-27 05:03:40,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:03:40,386 INFO L93 Difference]: Finished difference Result 41930 states and 121901 transitions. [2019-12-27 05:03:40,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 05:03:40,387 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-12-27 05:03:40,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:03:40,439 INFO L225 Difference]: With dead ends: 41930 [2019-12-27 05:03:40,440 INFO L226 Difference]: Without dead ends: 41762 [2019-12-27 05:03:40,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=250, Invalid=1082, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 05:03:40,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41762 states. [2019-12-27 05:03:40,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41762 to 22576. [2019-12-27 05:03:40,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22576 states. [2019-12-27 05:03:40,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22576 states to 22576 states and 66635 transitions. [2019-12-27 05:03:40,904 INFO L78 Accepts]: Start accepts. Automaton has 22576 states and 66635 transitions. Word has length 65 [2019-12-27 05:03:40,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:03:40,905 INFO L462 AbstractCegarLoop]: Abstraction has 22576 states and 66635 transitions. [2019-12-27 05:03:40,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 05:03:40,905 INFO L276 IsEmpty]: Start isEmpty. Operand 22576 states and 66635 transitions. [2019-12-27 05:03:40,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:03:40,926 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:03:40,926 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:03:40,927 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:03:40,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:03:40,927 INFO L82 PathProgramCache]: Analyzing trace with hash -926901456, now seen corresponding path program 3 times [2019-12-27 05:03:40,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:03:40,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39255048] [2019-12-27 05:03:40,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:03:40,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:03:41,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:03:41,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39255048] [2019-12-27 05:03:41,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:03:41,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 05:03:41,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321014432] [2019-12-27 05:03:41,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 05:03:41,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:03:41,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 05:03:41,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 05:03:41,108 INFO L87 Difference]: Start difference. First operand 22576 states and 66635 transitions. Second operand 12 states. [2019-12-27 05:03:43,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:03:43,369 INFO L93 Difference]: Finished difference Result 32452 states and 95033 transitions. [2019-12-27 05:03:43,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 05:03:43,370 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-27 05:03:43,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:03:43,414 INFO L225 Difference]: With dead ends: 32452 [2019-12-27 05:03:43,414 INFO L226 Difference]: Without dead ends: 32452 [2019-12-27 05:03:43,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=185, Invalid=745, Unknown=0, NotChecked=0, Total=930 [2019-12-27 05:03:43,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32452 states. [2019-12-27 05:03:43,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32452 to 23668. [2019-12-27 05:03:43,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23668 states. [2019-12-27 05:03:43,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23668 states to 23668 states and 69826 transitions. [2019-12-27 05:03:43,840 INFO L78 Accepts]: Start accepts. Automaton has 23668 states and 69826 transitions. Word has length 65 [2019-12-27 05:03:43,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:03:43,840 INFO L462 AbstractCegarLoop]: Abstraction has 23668 states and 69826 transitions. [2019-12-27 05:03:43,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 05:03:43,840 INFO L276 IsEmpty]: Start isEmpty. Operand 23668 states and 69826 transitions. [2019-12-27 05:03:43,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:03:43,866 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:03:43,866 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:03:43,866 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:03:43,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:03:43,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1390060896, now seen corresponding path program 4 times [2019-12-27 05:03:43,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:03:43,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682628811] [2019-12-27 05:03:43,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:03:43,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:03:44,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:03:44,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682628811] [2019-12-27 05:03:44,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:03:44,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 05:03:44,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721790831] [2019-12-27 05:03:44,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 05:03:44,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:03:44,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 05:03:44,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:03:44,042 INFO L87 Difference]: Start difference. First operand 23668 states and 69826 transitions. Second operand 11 states. [2019-12-27 05:03:44,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:03:44,867 INFO L93 Difference]: Finished difference Result 28404 states and 82503 transitions. [2019-12-27 05:03:44,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 05:03:44,868 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 05:03:44,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:03:44,901 INFO L225 Difference]: With dead ends: 28404 [2019-12-27 05:03:44,901 INFO L226 Difference]: Without dead ends: 25834 [2019-12-27 05:03:44,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2019-12-27 05:03:44,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25834 states. [2019-12-27 05:03:45,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25834 to 19997. [2019-12-27 05:03:45,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19997 states. [2019-12-27 05:03:45,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19997 states to 19997 states and 57944 transitions. [2019-12-27 05:03:45,564 INFO L78 Accepts]: Start accepts. Automaton has 19997 states and 57944 transitions. Word has length 65 [2019-12-27 05:03:45,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:03:45,564 INFO L462 AbstractCegarLoop]: Abstraction has 19997 states and 57944 transitions. [2019-12-27 05:03:45,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 05:03:45,564 INFO L276 IsEmpty]: Start isEmpty. Operand 19997 states and 57944 transitions. [2019-12-27 05:03:45,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:03:45,582 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:03:45,583 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:03:45,583 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:03:45,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:03:45,583 INFO L82 PathProgramCache]: Analyzing trace with hash 862213526, now seen corresponding path program 5 times [2019-12-27 05:03:45,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:03:45,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195831913] [2019-12-27 05:03:45,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:03:45,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:03:45,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:03:45,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195831913] [2019-12-27 05:03:45,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:03:45,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:03:45,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385328268] [2019-12-27 05:03:45,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:03:45,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:03:45,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:03:45,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:03:45,652 INFO L87 Difference]: Start difference. First operand 19997 states and 57944 transitions. Second operand 3 states. [2019-12-27 05:03:45,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:03:45,760 INFO L93 Difference]: Finished difference Result 23350 states and 67863 transitions. [2019-12-27 05:03:45,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:03:45,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 05:03:45,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:03:45,788 INFO L225 Difference]: With dead ends: 23350 [2019-12-27 05:03:45,788 INFO L226 Difference]: Without dead ends: 23350 [2019-12-27 05:03:45,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:03:45,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23350 states. [2019-12-27 05:03:46,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23350 to 20375. [2019-12-27 05:03:46,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20375 states. [2019-12-27 05:03:46,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20375 states to 20375 states and 59318 transitions. [2019-12-27 05:03:46,109 INFO L78 Accepts]: Start accepts. Automaton has 20375 states and 59318 transitions. Word has length 65 [2019-12-27 05:03:46,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:03:46,110 INFO L462 AbstractCegarLoop]: Abstraction has 20375 states and 59318 transitions. [2019-12-27 05:03:46,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:03:46,110 INFO L276 IsEmpty]: Start isEmpty. Operand 20375 states and 59318 transitions. [2019-12-27 05:03:46,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:03:46,128 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:03:46,129 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:03:46,129 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:03:46,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:03:46,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1578474862, now seen corresponding path program 1 times [2019-12-27 05:03:46,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:03:46,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648887178] [2019-12-27 05:03:46,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:03:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:03:46,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:03:46,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648887178] [2019-12-27 05:03:46,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:03:46,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 05:03:46,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319887655] [2019-12-27 05:03:46,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 05:03:46,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:03:46,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 05:03:46,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:03:46,279 INFO L87 Difference]: Start difference. First operand 20375 states and 59318 transitions. Second operand 11 states. [2019-12-27 05:03:47,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:03:47,073 INFO L93 Difference]: Finished difference Result 26834 states and 77507 transitions. [2019-12-27 05:03:47,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 05:03:47,074 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 05:03:47,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:03:47,103 INFO L225 Difference]: With dead ends: 26834 [2019-12-27 05:03:47,103 INFO L226 Difference]: Without dead ends: 23133 [2019-12-27 05:03:47,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-27 05:03:47,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23133 states. [2019-12-27 05:03:47,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23133 to 17111. [2019-12-27 05:03:47,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17111 states. [2019-12-27 05:03:47,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17111 states to 17111 states and 49981 transitions. [2019-12-27 05:03:47,394 INFO L78 Accepts]: Start accepts. Automaton has 17111 states and 49981 transitions. Word has length 66 [2019-12-27 05:03:47,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:03:47,395 INFO L462 AbstractCegarLoop]: Abstraction has 17111 states and 49981 transitions. [2019-12-27 05:03:47,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 05:03:47,395 INFO L276 IsEmpty]: Start isEmpty. Operand 17111 states and 49981 transitions. [2019-12-27 05:03:47,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:03:47,410 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:03:47,410 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:03:47,411 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:03:47,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:03:47,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1729227772, now seen corresponding path program 2 times [2019-12-27 05:03:47,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:03:47,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171368723] [2019-12-27 05:03:47,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:03:47,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:03:47,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:03:47,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171368723] [2019-12-27 05:03:47,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:03:47,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 05:03:47,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453770224] [2019-12-27 05:03:47,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 05:03:47,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:03:47,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 05:03:47,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:03:47,566 INFO L87 Difference]: Start difference. First operand 17111 states and 49981 transitions. Second operand 11 states. [2019-12-27 05:03:49,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:03:49,942 INFO L93 Difference]: Finished difference Result 32563 states and 93442 transitions. [2019-12-27 05:03:49,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 05:03:49,942 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 05:03:49,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:03:49,985 INFO L225 Difference]: With dead ends: 32563 [2019-12-27 05:03:49,985 INFO L226 Difference]: Without dead ends: 32563 [2019-12-27 05:03:49,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=557, Unknown=0, NotChecked=0, Total=702 [2019-12-27 05:03:50,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32563 states. [2019-12-27 05:03:50,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32563 to 19317. [2019-12-27 05:03:50,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19317 states. [2019-12-27 05:03:50,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19317 states to 19317 states and 56173 transitions. [2019-12-27 05:03:50,348 INFO L78 Accepts]: Start accepts. Automaton has 19317 states and 56173 transitions. Word has length 66 [2019-12-27 05:03:50,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:03:50,348 INFO L462 AbstractCegarLoop]: Abstraction has 19317 states and 56173 transitions. [2019-12-27 05:03:50,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 05:03:50,348 INFO L276 IsEmpty]: Start isEmpty. Operand 19317 states and 56173 transitions. [2019-12-27 05:03:50,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:03:50,367 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:03:50,367 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:03:50,367 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:03:50,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:03:50,367 INFO L82 PathProgramCache]: Analyzing trace with hash -748366416, now seen corresponding path program 3 times [2019-12-27 05:03:50,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:03:50,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181822974] [2019-12-27 05:03:50,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:03:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:03:50,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:03:50,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181822974] [2019-12-27 05:03:50,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:03:50,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 05:03:50,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003961916] [2019-12-27 05:03:50,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 05:03:50,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:03:50,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 05:03:50,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:03:50,529 INFO L87 Difference]: Start difference. First operand 19317 states and 56173 transitions. Second operand 11 states. [2019-12-27 05:03:54,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:03:54,030 INFO L93 Difference]: Finished difference Result 39394 states and 112311 transitions. [2019-12-27 05:03:54,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 05:03:54,030 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 05:03:54,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:03:54,078 INFO L225 Difference]: With dead ends: 39394 [2019-12-27 05:03:54,078 INFO L226 Difference]: Without dead ends: 39394 [2019-12-27 05:03:54,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=975, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 05:03:54,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39394 states. [2019-12-27 05:03:54,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39394 to 18877. [2019-12-27 05:03:54,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18877 states. [2019-12-27 05:03:54,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18877 states to 18877 states and 55146 transitions. [2019-12-27 05:03:54,482 INFO L78 Accepts]: Start accepts. Automaton has 18877 states and 55146 transitions. Word has length 66 [2019-12-27 05:03:54,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:03:54,482 INFO L462 AbstractCegarLoop]: Abstraction has 18877 states and 55146 transitions. [2019-12-27 05:03:54,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 05:03:54,482 INFO L276 IsEmpty]: Start isEmpty. Operand 18877 states and 55146 transitions. [2019-12-27 05:03:54,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:03:54,502 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:03:54,503 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:03:54,503 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:03:54,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:03:54,503 INFO L82 PathProgramCache]: Analyzing trace with hash 391637582, now seen corresponding path program 4 times [2019-12-27 05:03:54,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:03:54,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976810474] [2019-12-27 05:03:54,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:03:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:03:54,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:03:54,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976810474] [2019-12-27 05:03:54,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:03:54,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 05:03:54,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158637037] [2019-12-27 05:03:54,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 05:03:54,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:03:54,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 05:03:54,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-12-27 05:03:54,748 INFO L87 Difference]: Start difference. First operand 18877 states and 55146 transitions. Second operand 14 states. [2019-12-27 05:04:00,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:04:00,477 INFO L93 Difference]: Finished difference Result 40468 states and 116534 transitions. [2019-12-27 05:04:00,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-12-27 05:04:00,478 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2019-12-27 05:04:00,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:04:00,533 INFO L225 Difference]: With dead ends: 40468 [2019-12-27 05:04:00,533 INFO L226 Difference]: Without dead ends: 40468 [2019-12-27 05:04:00,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=800, Invalid=3756, Unknown=0, NotChecked=0, Total=4556 [2019-12-27 05:04:00,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40468 states. [2019-12-27 05:04:00,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40468 to 20602. [2019-12-27 05:04:00,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20602 states. [2019-12-27 05:04:01,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20602 states to 20602 states and 60308 transitions. [2019-12-27 05:04:01,011 INFO L78 Accepts]: Start accepts. Automaton has 20602 states and 60308 transitions. Word has length 66 [2019-12-27 05:04:01,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:04:01,011 INFO L462 AbstractCegarLoop]: Abstraction has 20602 states and 60308 transitions. [2019-12-27 05:04:01,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 05:04:01,011 INFO L276 IsEmpty]: Start isEmpty. Operand 20602 states and 60308 transitions. [2019-12-27 05:04:01,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:04:01,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:04:01,033 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:04:01,034 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:04:01,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:04:01,034 INFO L82 PathProgramCache]: Analyzing trace with hash 961664440, now seen corresponding path program 5 times [2019-12-27 05:04:01,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:04:01,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899742656] [2019-12-27 05:04:01,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:04:01,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:04:01,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:04:01,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899742656] [2019-12-27 05:04:01,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:04:01,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:04:01,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716089228] [2019-12-27 05:04:01,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:04:01,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:04:01,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:04:01,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:04:01,090 INFO L87 Difference]: Start difference. First operand 20602 states and 60308 transitions. Second operand 3 states. [2019-12-27 05:04:01,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:04:01,192 INFO L93 Difference]: Finished difference Result 20601 states and 60306 transitions. [2019-12-27 05:04:01,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:04:01,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 05:04:01,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:04:01,365 INFO L225 Difference]: With dead ends: 20601 [2019-12-27 05:04:01,365 INFO L226 Difference]: Without dead ends: 20601 [2019-12-27 05:04:01,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:04:01,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20601 states. [2019-12-27 05:04:01,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20601 to 13715. [2019-12-27 05:04:01,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13715 states. [2019-12-27 05:04:01,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13715 states to 13715 states and 40419 transitions. [2019-12-27 05:04:01,612 INFO L78 Accepts]: Start accepts. Automaton has 13715 states and 40419 transitions. Word has length 66 [2019-12-27 05:04:01,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:04:01,613 INFO L462 AbstractCegarLoop]: Abstraction has 13715 states and 40419 transitions. [2019-12-27 05:04:01,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:04:01,613 INFO L276 IsEmpty]: Start isEmpty. Operand 13715 states and 40419 transitions. [2019-12-27 05:04:01,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:04:01,627 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:04:01,627 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:04:01,627 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:04:01,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:04:01,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1265411945, now seen corresponding path program 1 times [2019-12-27 05:04:01,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:04:01,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374104296] [2019-12-27 05:04:01,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:04:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:04:02,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:04:02,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374104296] [2019-12-27 05:04:02,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:04:02,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 05:04:02,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373908880] [2019-12-27 05:04:02,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 05:04:02,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:04:02,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 05:04:02,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-12-27 05:04:02,105 INFO L87 Difference]: Start difference. First operand 13715 states and 40419 transitions. Second operand 18 states. [2019-12-27 05:04:04,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:04:04,749 INFO L93 Difference]: Finished difference Result 16186 states and 46923 transitions. [2019-12-27 05:04:04,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-27 05:04:04,750 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2019-12-27 05:04:04,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:04:04,772 INFO L225 Difference]: With dead ends: 16186 [2019-12-27 05:04:04,772 INFO L226 Difference]: Without dead ends: 15765 [2019-12-27 05:04:04,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=354, Invalid=1808, Unknown=0, NotChecked=0, Total=2162 [2019-12-27 05:04:04,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15765 states. [2019-12-27 05:04:04,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15765 to 13461. [2019-12-27 05:04:04,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13461 states. [2019-12-27 05:04:04,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13461 states to 13461 states and 39767 transitions. [2019-12-27 05:04:04,982 INFO L78 Accepts]: Start accepts. Automaton has 13461 states and 39767 transitions. Word has length 67 [2019-12-27 05:04:04,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:04:04,982 INFO L462 AbstractCegarLoop]: Abstraction has 13461 states and 39767 transitions. [2019-12-27 05:04:04,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 05:04:04,982 INFO L276 IsEmpty]: Start isEmpty. Operand 13461 states and 39767 transitions. [2019-12-27 05:04:04,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:04:04,995 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:04:04,995 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:04:04,995 INFO L410 AbstractCegarLoop]: === Iteration 42 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:04:04,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:04:04,996 INFO L82 PathProgramCache]: Analyzing trace with hash 674435820, now seen corresponding path program 1 times [2019-12-27 05:04:04,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:04:04,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892009079] [2019-12-27 05:04:04,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:04:05,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:04:05,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:04:05,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892009079] [2019-12-27 05:04:05,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:04:05,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:04:05,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969457308] [2019-12-27 05:04:05,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:04:05,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:04:05,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:04:05,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:04:05,040 INFO L87 Difference]: Start difference. First operand 13461 states and 39767 transitions. Second operand 3 states. [2019-12-27 05:04:05,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:04:05,215 INFO L93 Difference]: Finished difference Result 19452 states and 57639 transitions. [2019-12-27 05:04:05,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:04:05,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 05:04:05,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:04:05,242 INFO L225 Difference]: With dead ends: 19452 [2019-12-27 05:04:05,243 INFO L226 Difference]: Without dead ends: 19452 [2019-12-27 05:04:05,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:04:05,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19452 states. [2019-12-27 05:04:05,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19452 to 13915. [2019-12-27 05:04:05,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13915 states. [2019-12-27 05:04:05,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13915 states to 13915 states and 41145 transitions. [2019-12-27 05:04:05,491 INFO L78 Accepts]: Start accepts. Automaton has 13915 states and 41145 transitions. Word has length 67 [2019-12-27 05:04:05,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:04:05,491 INFO L462 AbstractCegarLoop]: Abstraction has 13915 states and 41145 transitions. [2019-12-27 05:04:05,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:04:05,491 INFO L276 IsEmpty]: Start isEmpty. Operand 13915 states and 41145 transitions. [2019-12-27 05:04:05,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:04:05,505 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:04:05,506 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:04:05,506 INFO L410 AbstractCegarLoop]: === Iteration 43 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:04:05,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:04:05,506 INFO L82 PathProgramCache]: Analyzing trace with hash 56904589, now seen corresponding path program 2 times [2019-12-27 05:04:05,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:04:05,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518034957] [2019-12-27 05:04:05,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:04:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:04:05,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:04:05,624 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 05:04:05,624 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 05:04:05,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] ULTIMATE.startENTRY-->L842: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 v_~a$mem_tmp~0_9) (= 0 v_~weak$$choice0~0_8) (= 0 v_~a$w_buff0_used~0_114) (= 0 v_~a$w_buff1_used~0_71) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_cnt~0_20) (= v_~a$r_buff0_thd2~0_18 0) (= 0 v_~__unbuffered_p1_EAX~0_12) (= 0 v_~a$read_delayed~0_7) (= 0 v_~__unbuffered_p0_EAX~0_12) (= v_~a$read_delayed_var~0.offset_7 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t44~0.base_23| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t44~0.base_23|) |v_ULTIMATE.start_main_~#t44~0.offset_18| 0)) |v_#memory_int_21|) (= 0 v_~a$w_buff0~0_27) (= v_~__unbuffered_p2_EBX~0_12 0) (= 0 v_~a$r_buff1_thd1~0_15) (= v_~a$flush_delayed~0_12 0) (= 0 v_~z~0_7) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t44~0.base_23|) (= 0 |v_ULTIMATE.start_main_~#t44~0.offset_18|) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p2_EAX~0_11) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice2~0_33) (= (select .cse0 |v_ULTIMATE.start_main_~#t44~0.base_23|) 0) (= v_~a$r_buff0_thd0~0_18 0) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t44~0.base_23| 1)) (= v_~__unbuffered_p0_EBX~0_12 0) (= v_~a$r_buff0_thd1~0_23 0) (= v_~a$r_buff0_thd3~0_75 0) (= |v_#NULL.offset_4| 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t44~0.base_23| 4)) (= v_~main$tmp_guard1~0_13 0) (= 0 v_~a$w_buff1~0_25) (= 0 v_~a$r_buff1_thd2~0_18) (= v_~__unbuffered_p1_EBX~0_12 0) (= 0 v_~a$r_buff1_thd0~0_18) (= 0 v_~a$r_buff1_thd3~0_47) (= v_~a~0_27 0) (= 0 v_~x~0_8) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_18, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_11|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_18, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_11|, ~a~0=v_~a~0_27, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_17|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, ULTIMATE.start_main_~#t46~0.base=|v_ULTIMATE.start_main_~#t46~0.base_20|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_11, ULTIMATE.start_main_~#t45~0.offset=|v_ULTIMATE.start_main_~#t45~0.offset_18|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_12, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_12, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_47, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_114, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_23, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_27, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_8, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_13|, ULTIMATE.start_main_~#t46~0.offset=|v_ULTIMATE.start_main_~#t46~0.offset_15|, ULTIMATE.start_main_~#t45~0.base=|v_ULTIMATE.start_main_~#t45~0.base_23|, ~a$mem_tmp~0=v_~a$mem_tmp~0_9, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_11|, ~a$w_buff1~0=v_~a$w_buff1~0_25, ~y~0=v_~y~0_9, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_12, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_15, ULTIMATE.start_main_~#t44~0.base=|v_ULTIMATE.start_main_~#t44~0.base_23|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_75, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_~#t44~0.offset=|v_ULTIMATE.start_main_~#t44~0.offset_18|, #NULL.base=|v_#NULL.base_4|, ~a$flush_delayed~0=v_~a$flush_delayed~0_12, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_7, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_71, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t46~0.base, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t45~0.offset, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t46~0.offset, ULTIMATE.start_main_~#t45~0.base, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ULTIMATE.start_main_~#t44~0.base, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t44~0.offset, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 05:04:05,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] P0ENTRY-->L4-3: Formula: (and (= 1 ~a$w_buff0_used~0_Out-354779978) (= 1 ~a$w_buff0~0_Out-354779978) (= P0Thread1of1ForFork2___VERIFIER_assert_~expression_Out-354779978 |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out-354779978|) (= P0Thread1of1ForFork2_~arg.offset_Out-354779978 |P0Thread1of1ForFork2_#in~arg.offset_In-354779978|) (= ~a$w_buff1~0_Out-354779978 ~a$w_buff0~0_In-354779978) (= P0Thread1of1ForFork2_~arg.base_Out-354779978 |P0Thread1of1ForFork2_#in~arg.base_In-354779978|) (= ~a$w_buff1_used~0_Out-354779978 ~a$w_buff0_used~0_In-354779978) (= 0 (mod ~a$w_buff1_used~0_Out-354779978 256)) (= |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out-354779978| 1)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|P0Thread1of1ForFork2_#in~arg.offset_In-354779978|, ~a$w_buff0~0=~a$w_buff0~0_In-354779978, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-354779978, P0Thread1of1ForFork2_#in~arg.base=|P0Thread1of1ForFork2_#in~arg.base_In-354779978|} OutVars{~a$w_buff1~0=~a$w_buff1~0_Out-354779978, P0Thread1of1ForFork2_#in~arg.offset=|P0Thread1of1ForFork2_#in~arg.offset_In-354779978|, ~a$w_buff0~0=~a$w_buff0~0_Out-354779978, P0Thread1of1ForFork2_~arg.offset=P0Thread1of1ForFork2_~arg.offset_Out-354779978, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out-354779978, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_Out-354779978, P0Thread1of1ForFork2_#in~arg.base=|P0Thread1of1ForFork2_#in~arg.base_In-354779978|, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out-354779978, P0Thread1of1ForFork2_~arg.base=P0Thread1of1ForFork2_~arg.base_Out-354779978, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_Out-354779978|} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork2_~arg.offset, ~a$w_buff0_used~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression, ~a$w_buff1_used~0, P0Thread1of1ForFork2_~arg.base, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 05:04:05,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L842-1-->L844: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t45~0.base_13| 4)) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t45~0.base_13|) 0) (= 0 |v_ULTIMATE.start_main_~#t45~0.offset_11|) (not (= 0 |v_ULTIMATE.start_main_~#t45~0.base_13|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t45~0.base_13|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t45~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t45~0.base_13|) |v_ULTIMATE.start_main_~#t45~0.offset_11| 1)) |v_#memory_int_13|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t45~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t45~0.base=|v_ULTIMATE.start_main_~#t45~0.base_13|, ULTIMATE.start_main_~#t45~0.offset=|v_ULTIMATE.start_main_~#t45~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t45~0.base, ULTIMATE.start_main_~#t45~0.offset] because there is no mapped edge [2019-12-27 05:04:05,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L783-2-->L783-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork0_#t~ite10_Out-600915092| |P1Thread1of1ForFork0_#t~ite9_Out-600915092|)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-600915092 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In-600915092 256)))) (or (and .cse0 (not .cse1) (= |P1Thread1of1ForFork0_#t~ite9_Out-600915092| ~a$w_buff1~0_In-600915092) (not .cse2)) (and (= |P1Thread1of1ForFork0_#t~ite9_Out-600915092| ~a~0_In-600915092) .cse0 (or .cse1 .cse2)))) InVars {~a~0=~a~0_In-600915092, ~a$w_buff1~0=~a$w_buff1~0_In-600915092, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-600915092, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-600915092} OutVars{~a~0=~a~0_In-600915092, ~a$w_buff1~0=~a$w_buff1~0_In-600915092, P1Thread1of1ForFork0_#t~ite10=|P1Thread1of1ForFork0_#t~ite10_Out-600915092|, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-600915092, P1Thread1of1ForFork0_#t~ite9=|P1Thread1of1ForFork0_#t~ite9_Out-600915092|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-600915092} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite10, P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-27 05:04:05,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L784-->L784-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1109304339 256))) (.cse0 (= (mod ~a$r_buff0_thd2~0_In-1109304339 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite11_Out-1109304339|) (not .cse1)) (and (or .cse1 .cse0) (= ~a$w_buff0_used~0_In-1109304339 |P1Thread1of1ForFork0_#t~ite11_Out-1109304339|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1109304339, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1109304339} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1109304339, P1Thread1of1ForFork0_#t~ite11=|P1Thread1of1ForFork0_#t~ite11_Out-1109304339|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1109304339} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 05:04:05,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L785-->L785-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1540776012 256))) (.cse0 (= (mod ~a$r_buff1_thd2~0_In-1540776012 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In-1540776012 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd2~0_In-1540776012 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite12_Out-1540776012| ~a$w_buff1_used~0_In-1540776012) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork0_#t~ite12_Out-1540776012|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1540776012, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1540776012, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1540776012, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1540776012} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1540776012, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1540776012, P1Thread1of1ForFork0_#t~ite12=|P1Thread1of1ForFork0_#t~ite12_Out-1540776012|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1540776012, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1540776012} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 05:04:05,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L786-->L786-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-1024194431 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-1024194431 256) 0))) (or (and (= ~a$r_buff0_thd2~0_In-1024194431 |P1Thread1of1ForFork0_#t~ite13_Out-1024194431|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork0_#t~ite13_Out-1024194431|) (not .cse0) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1024194431, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1024194431} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1024194431, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1024194431, P1Thread1of1ForFork0_#t~ite13=|P1Thread1of1ForFork0_#t~ite13_Out-1024194431|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 05:04:05,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [854] [854] L787-->L787-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1219370829 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-1219370829 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-1219370829 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd2~0_In-1219370829 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite14_Out-1219370829| ~a$r_buff1_thd2~0_In-1219370829) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork0_#t~ite14_Out-1219370829| 0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1219370829, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1219370829, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1219370829, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1219370829} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1219370829, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1219370829, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1219370829, P1Thread1of1ForFork0_#t~ite14=|P1Thread1of1ForFork0_#t~ite14_Out-1219370829|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1219370829} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 05:04:05,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L787-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~a$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork0_#t~ite14_8|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_8|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_7|, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#t~ite14, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 05:04:05,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L844-1-->L846: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t46~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t46~0.offset_10|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t46~0.base_12| 1)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t46~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t46~0.base_12|) |v_ULTIMATE.start_main_~#t46~0.offset_10| 2))) (not (= 0 |v_ULTIMATE.start_main_~#t46~0.base_12|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t46~0.base_12| 4)) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t46~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t46~0.base=|v_ULTIMATE.start_main_~#t46~0.base_12|, #valid=|v_#valid_34|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t46~0.offset=|v_ULTIMATE.start_main_~#t46~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t46~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t46~0.offset] because there is no mapped edge [2019-12-27 05:04:05,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L808-->L808-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1134667855 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite20_In-1134667855| |P2Thread1of1ForFork1_#t~ite20_Out-1134667855|) (not .cse0) (= ~a$w_buff0~0_In-1134667855 |P2Thread1of1ForFork1_#t~ite21_Out-1134667855|)) (and (= ~a$w_buff0~0_In-1134667855 |P2Thread1of1ForFork1_#t~ite20_Out-1134667855|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1134667855 256)))) (or (and .cse1 (= (mod ~a$w_buff1_used~0_In-1134667855 256) 0)) (and .cse1 (= (mod ~a$r_buff1_thd3~0_In-1134667855 256) 0)) (= 0 (mod ~a$w_buff0_used~0_In-1134667855 256)))) (= |P2Thread1of1ForFork1_#t~ite21_Out-1134667855| |P2Thread1of1ForFork1_#t~ite20_Out-1134667855|) .cse0))) InVars {P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_In-1134667855|, ~a$w_buff0~0=~a$w_buff0~0_In-1134667855, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1134667855, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1134667855, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1134667855, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1134667855, ~weak$$choice2~0=~weak$$choice2~0_In-1134667855} OutVars{P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_Out-1134667855|, P2Thread1of1ForFork1_#t~ite21=|P2Thread1of1ForFork1_#t~ite21_Out-1134667855|, ~a$w_buff0~0=~a$w_buff0~0_In-1134667855, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1134667855, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1134667855, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1134667855, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1134667855, ~weak$$choice2~0=~weak$$choice2~0_In-1134667855} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 05:04:05,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L810-->L810-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1669047674 256) 0))) (or (and (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In-1669047674 256) 0))) (or (and (= (mod ~a$r_buff1_thd3~0_In-1669047674 256) 0) .cse0) (and (= 0 (mod ~a$w_buff1_used~0_In-1669047674 256)) .cse0) (= 0 (mod ~a$w_buff0_used~0_In-1669047674 256)))) (= |P2Thread1of1ForFork1_#t~ite26_Out-1669047674| ~a$w_buff0_used~0_In-1669047674) .cse1 (= |P2Thread1of1ForFork1_#t~ite27_Out-1669047674| |P2Thread1of1ForFork1_#t~ite26_Out-1669047674|)) (and (= |P2Thread1of1ForFork1_#t~ite27_Out-1669047674| ~a$w_buff0_used~0_In-1669047674) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite26_In-1669047674| |P2Thread1of1ForFork1_#t~ite26_Out-1669047674|)))) InVars {P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_In-1669047674|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1669047674, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1669047674, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1669047674, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1669047674, ~weak$$choice2~0=~weak$$choice2~0_In-1669047674} OutVars{P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_Out-1669047674|, P2Thread1of1ForFork1_#t~ite27=|P2Thread1of1ForFork1_#t~ite27_Out-1669047674|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1669047674, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1669047674, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1669047674, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1669047674, ~weak$$choice2~0=~weak$$choice2~0_In-1669047674} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27] because there is no mapped edge [2019-12-27 05:04:05,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L812-->L813: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~a$r_buff0_thd3~0_48 v_~a$r_buff0_thd3~0_47)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_48, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_8|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_9|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_47, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, P2Thread1of1ForFork1_#t~ite33, ~a$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 05:04:05,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L815-->L819: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a$flush_delayed~0_7 0) (= v_~a~0_20 v_~a$mem_tmp~0_5)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{~a~0=v_~a~0_20, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork1_#t~ite37, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 05:04:05,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L819-2-->L819-4: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1119509595 256))) (.cse1 (= (mod ~a$r_buff1_thd3~0_In-1119509595 256) 0))) (or (and (not .cse0) (= ~a$w_buff1~0_In-1119509595 |P2Thread1of1ForFork1_#t~ite38_Out-1119509595|) (not .cse1)) (and (= ~a~0_In-1119509595 |P2Thread1of1ForFork1_#t~ite38_Out-1119509595|) (or .cse0 .cse1)))) InVars {~a~0=~a~0_In-1119509595, ~a$w_buff1~0=~a$w_buff1~0_In-1119509595, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1119509595, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1119509595} OutVars{~a~0=~a~0_In-1119509595, P2Thread1of1ForFork1_#t~ite38=|P2Thread1of1ForFork1_#t~ite38_Out-1119509595|, ~a$w_buff1~0=~a$w_buff1~0_In-1119509595, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1119509595, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1119509595} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38] because there is no mapped edge [2019-12-27 05:04:05,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L819-4-->L820: Formula: (= v_~a~0_18 |v_P2Thread1of1ForFork1_#t~ite38_8|) InVars {P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_8|} OutVars{~a~0=v_~a~0_18, P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_7|, P2Thread1of1ForFork1_#t~ite39=|v_P2Thread1of1ForFork1_#t~ite39_7|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork1_#t~ite38, P2Thread1of1ForFork1_#t~ite39] because there is no mapped edge [2019-12-27 05:04:05,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In996755975 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In996755975 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite40_Out996755975| ~a$w_buff0_used~0_In996755975) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite40_Out996755975| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In996755975, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In996755975} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In996755975, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In996755975, P2Thread1of1ForFork1_#t~ite40=|P2Thread1of1ForFork1_#t~ite40_Out996755975|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-27 05:04:05,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In1964111477 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1964111477 256))) (.cse2 (= (mod ~a$r_buff1_thd3~0_In1964111477 256) 0)) (.cse3 (= (mod ~a$w_buff1_used~0_In1964111477 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In1964111477 |P2Thread1of1ForFork1_#t~ite41_Out1964111477|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite41_Out1964111477|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1964111477, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1964111477, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1964111477, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1964111477} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1964111477, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1964111477, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1964111477, P2Thread1of1ForFork1_#t~ite41=|P2Thread1of1ForFork1_#t~ite41_Out1964111477|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1964111477} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite41] because there is no mapped edge [2019-12-27 05:04:05,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L822-->L822-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In2061534550 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In2061534550 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite42_Out2061534550| 0)) (and (= |P2Thread1of1ForFork1_#t~ite42_Out2061534550| ~a$r_buff0_thd3~0_In2061534550) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In2061534550, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2061534550} OutVars{P2Thread1of1ForFork1_#t~ite42=|P2Thread1of1ForFork1_#t~ite42_Out2061534550|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2061534550, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2061534550} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite42] because there is no mapped edge [2019-12-27 05:04:05,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In1294382681 256))) (.cse1 (= (mod ~a$r_buff0_thd3~0_In1294382681 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd3~0_In1294382681 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In1294382681 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite43_Out1294382681|)) (and (or .cse0 .cse1) (= ~a$r_buff1_thd3~0_In1294382681 |P2Thread1of1ForFork1_#t~ite43_Out1294382681|) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1294382681, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1294382681, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1294382681, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1294382681} OutVars{P2Thread1of1ForFork1_#t~ite43=|P2Thread1of1ForFork1_#t~ite43_Out1294382681|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1294382681, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1294382681, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1294382681, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1294382681} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-27 05:04:05,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L823-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~a$r_buff1_thd3~0_40 |v_P2Thread1of1ForFork1_#t~ite43_8|)) InVars {P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_40, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43, P2Thread1of1ForFork1_#res.base, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 05:04:05,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L761-->L761-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1809961007 256))) (.cse1 (= (mod ~a$r_buff0_thd1~0_In-1809961007 256) 0))) (or (and (= 0 |P0Thread1of1ForFork2_#t~ite5_Out-1809961007|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-1809961007 |P0Thread1of1ForFork2_#t~ite5_Out-1809961007|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1809961007, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1809961007} OutVars{P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out-1809961007|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1809961007, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1809961007} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 05:04:05,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L762-->L762-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff1_thd1~0_In1522798897 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In1522798897 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In1522798897 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1522798897 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork2_#t~ite6_Out1522798897| ~a$w_buff1_used~0_In1522798897)) (and (= 0 |P0Thread1of1ForFork2_#t~ite6_Out1522798897|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1522798897, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1522798897, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1522798897, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1522798897} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1522798897, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out1522798897|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1522798897, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1522798897, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1522798897} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 05:04:05,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L763-->L764: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-1346707456 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1346707456 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_In-1346707456 ~a$r_buff0_thd1~0_Out-1346707456)) (and (= ~a$r_buff0_thd1~0_Out-1346707456 0) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1346707456, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1346707456} OutVars{P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out-1346707456|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1346707456, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1346707456} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 05:04:05,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L764-->L764-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In-999246344 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-999246344 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In-999246344 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd1~0_In-999246344 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork2_#t~ite8_Out-999246344| ~a$r_buff1_thd1~0_In-999246344) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork2_#t~ite8_Out-999246344| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-999246344, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-999246344, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-999246344, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-999246344} OutVars{P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-999246344|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-999246344, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-999246344, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-999246344, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-999246344} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 05:04:05,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L764-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= |v_P0Thread1of1ForFork2_#t~ite8_8| v_~a$r_buff1_thd1~0_10)) InVars {P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_7|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_10, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, ~a$r_buff1_thd1~0, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 05:04:05,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L846-1-->L852: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 05:04:05,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L852-2-->L852-4: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In-672742980 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In-672742980 256)))) (or (and (= ~a$w_buff1~0_In-672742980 |ULTIMATE.start_main_#t~ite47_Out-672742980|) (not .cse0) (not .cse1)) (and (= ~a~0_In-672742980 |ULTIMATE.start_main_#t~ite47_Out-672742980|) (or .cse1 .cse0)))) InVars {~a~0=~a~0_In-672742980, ~a$w_buff1~0=~a$w_buff1~0_In-672742980, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-672742980, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-672742980} OutVars{~a~0=~a~0_In-672742980, ~a$w_buff1~0=~a$w_buff1~0_In-672742980, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-672742980|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-672742980, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-672742980} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 05:04:05,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L852-4-->L853: Formula: (= v_~a~0_22 |v_ULTIMATE.start_main_#t~ite47_7|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|} OutVars{~a~0=v_~a~0_22, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 05:04:05,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L853-->L853-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-988259342 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-988259342 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-988259342 |ULTIMATE.start_main_#t~ite49_Out-988259342|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out-988259342|) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-988259342, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-988259342} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-988259342, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-988259342|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-988259342} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 05:04:05,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L854-->L854-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-1321677758 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd0~0_In-1321677758 256) 0)) (.cse3 (= (mod ~a$w_buff1_used~0_In-1321677758 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd0~0_In-1321677758 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out-1321677758| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~a$w_buff1_used~0_In-1321677758 |ULTIMATE.start_main_#t~ite50_Out-1321677758|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1321677758, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1321677758, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1321677758, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1321677758} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1321677758|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1321677758, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1321677758, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1321677758, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1321677758} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 05:04:05,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L855-->L855-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1879486890 256))) (.cse0 (= (mod ~a$r_buff0_thd0~0_In-1879486890 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out-1879486890|)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd0~0_In-1879486890 |ULTIMATE.start_main_#t~ite51_Out-1879486890|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1879486890, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1879486890} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1879486890|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1879486890, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1879486890} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 05:04:05,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L856-->L856-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff1_used~0_In-28061952 256))) (.cse3 (= (mod ~a$r_buff1_thd0~0_In-28061952 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd0~0_In-28061952 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-28061952 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out-28061952| 0)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite52_Out-28061952| ~a$r_buff1_thd0~0_In-28061952) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-28061952, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-28061952, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-28061952, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-28061952} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-28061952|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-28061952, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-28061952, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-28061952, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-28061952} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 05:04:05,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] L856-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_~main$tmp_guard1~0_9 0) (= 1 v_~__unbuffered_p1_EAX~0_8) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~__unbuffered_p2_EBX~0_9 0) (= v_~__unbuffered_p0_EBX~0_8 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= v_~__unbuffered_p0_EAX~0_8 1) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0) (= |v_ULTIMATE.start_main_#t~ite52_12| v_~a$r_buff1_thd0~0_14)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_12|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_11|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_14, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 05:04:05,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:04:05 BasicIcfg [2019-12-27 05:04:05,751 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 05:04:05,753 INFO L168 Benchmark]: Toolchain (without parser) took 147057.12 ms. Allocated memory was 141.0 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 100.6 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-12-27 05:04:05,753 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 141.0 MB. Free memory was 119.9 MB in the beginning and 119.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 05:04:05,754 INFO L168 Benchmark]: CACSL2BoogieTranslator took 825.90 ms. Allocated memory was 141.0 MB in the beginning and 201.3 MB in the end (delta: 60.3 MB). Free memory was 100.2 MB in the beginning and 155.1 MB in the end (delta: -54.9 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. [2019-12-27 05:04:05,754 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.49 ms. Allocated memory is still 201.3 MB. Free memory was 155.1 MB in the beginning and 152.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 05:04:05,754 INFO L168 Benchmark]: Boogie Preprocessor took 55.59 ms. Allocated memory is still 201.3 MB. Free memory was 152.3 MB in the beginning and 149.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 05:04:05,755 INFO L168 Benchmark]: RCFGBuilder took 902.10 ms. Allocated memory is still 201.3 MB. Free memory was 149.5 MB in the beginning and 98.4 MB in the end (delta: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 7.1 GB. [2019-12-27 05:04:05,755 INFO L168 Benchmark]: TraceAbstraction took 145182.37 ms. Allocated memory was 201.3 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 98.4 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-27 05:04:05,757 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 141.0 MB. Free memory was 119.9 MB in the beginning and 119.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 825.90 ms. Allocated memory was 141.0 MB in the beginning and 201.3 MB in the end (delta: 60.3 MB). Free memory was 100.2 MB in the beginning and 155.1 MB in the end (delta: -54.9 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 82.49 ms. Allocated memory is still 201.3 MB. Free memory was 155.1 MB in the beginning and 152.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 55.59 ms. Allocated memory is still 201.3 MB. Free memory was 152.3 MB in the beginning and 149.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 902.10 ms. Allocated memory is still 201.3 MB. Free memory was 149.5 MB in the beginning and 98.4 MB in the end (delta: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 145182.37 ms. Allocated memory was 201.3 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 98.4 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 180 ProgramPointsBefore, 96 ProgramPointsAfterwards, 217 TransitionsBefore, 106 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 31 ChoiceCompositions, 7307 VarBasedMoverChecksPositive, 219 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 96061 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L842] FCALL, FORK 0 pthread_create(&t44, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L744] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L745] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L746] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L747] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L748] 1 a$r_buff0_thd1 = (_Bool)1 [L751] 1 x = 1 [L754] 1 __unbuffered_p0_EAX = x [L757] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L760] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t45, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L774] 2 y = 1 [L777] 2 __unbuffered_p1_EAX = y [L780] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L783] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L760] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L783] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L784] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L785] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L786] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L846] FCALL, FORK 0 pthread_create(&t46, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, y=1, z=0] [L797] 3 z = 1 [L800] 3 __unbuffered_p2_EAX = z [L803] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 3 a$flush_delayed = weak$$choice2 [L806] 3 a$mem_tmp = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L808] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L809] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L809] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L810] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L811] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L811] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L813] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L819] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L820] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L821] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L822] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L761] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L762] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L852] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L853] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L854] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L855] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 171 locations, 2 error locations. Result: UNSAFE, OverallTime: 144.8s, OverallIterations: 43, TraceHistogramMax: 1, AutomataDifference: 62.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 11923 SDtfs, 16045 SDslu, 43797 SDs, 0 SdLazy, 32142 SolverSat, 877 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 785 GetRequests, 126 SyntacticMatches, 47 SemanticMatches, 612 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3979 ImplicationChecksByTransitivity, 8.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166753occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 52.2s AutomataMinimizationTime, 42 MinimizatonAttempts, 557940 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 2328 NumberOfCodeBlocks, 2328 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 2219 ConstructedInterpolants, 0 QuantifiedInterpolants, 596373 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 42 InterpolantComputations, 42 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...