/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix019_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:42:17,393 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:42:17,396 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:42:17,411 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:42:17,412 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:42:17,413 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:42:17,414 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:42:17,416 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:42:17,418 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:42:17,419 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:42:17,420 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:42:17,421 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:42:17,422 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:42:17,423 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:42:17,424 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:42:17,425 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:42:17,426 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:42:17,426 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:42:17,428 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:42:17,430 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:42:17,432 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:42:17,433 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:42:17,434 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:42:17,435 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:42:17,437 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:42:17,437 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:42:17,437 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:42:17,438 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:42:17,439 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:42:17,443 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:42:17,443 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:42:17,444 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:42:17,445 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:42:17,445 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:42:17,446 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:42:17,447 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:42:17,447 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:42:17,447 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:42:17,448 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:42:17,449 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:42:17,449 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:42:17,450 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 12:42:17,479 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:42:17,479 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:42:17,481 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:42:17,481 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:42:17,481 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:42:17,481 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:42:17,482 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:42:17,482 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:42:17,483 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:42:17,483 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:42:17,484 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:42:17,484 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:42:17,484 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:42:17,484 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:42:17,485 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:42:17,485 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:42:17,485 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:42:17,485 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:42:17,485 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:42:17,486 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:42:17,486 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:42:17,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:42:17,486 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:42:17,486 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:42:17,487 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:42:17,487 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:42:17,488 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:42:17,488 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:42:17,488 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:42:17,488 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:42:17,787 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:42:17,804 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:42:17,808 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:42:17,810 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:42:17,810 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:42:17,811 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix019_pso.oepc.i [2019-12-18 12:42:17,894 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7ce28420/fc284ad3ddc24ef49ec5129c69d4d7a8/FLAG4551f2157 [2019-12-18 12:42:18,507 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:42:18,507 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_pso.oepc.i [2019-12-18 12:42:18,522 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7ce28420/fc284ad3ddc24ef49ec5129c69d4d7a8/FLAG4551f2157 [2019-12-18 12:42:18,750 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7ce28420/fc284ad3ddc24ef49ec5129c69d4d7a8 [2019-12-18 12:42:18,763 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:42:18,765 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:42:18,770 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:42:18,770 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:42:18,774 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:42:18,775 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:42:18" (1/1) ... [2019-12-18 12:42:18,778 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5677aabb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:42:18, skipping insertion in model container [2019-12-18 12:42:18,778 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:42:18" (1/1) ... [2019-12-18 12:42:18,787 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:42:18,850 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:42:19,471 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:42:19,488 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:42:19,545 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:42:19,633 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:42:19,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:42:19 WrapperNode [2019-12-18 12:42:19,634 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:42:19,635 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:42:19,635 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:42:19,635 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:42:19,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:42:19" (1/1) ... [2019-12-18 12:42:19,666 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:42:19" (1/1) ... [2019-12-18 12:42:19,700 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:42:19,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:42:19,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:42:19,700 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:42:19,712 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:42:19" (1/1) ... [2019-12-18 12:42:19,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:42:19" (1/1) ... [2019-12-18 12:42:19,722 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:42:19" (1/1) ... [2019-12-18 12:42:19,723 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:42:19" (1/1) ... [2019-12-18 12:42:19,736 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:42:19" (1/1) ... [2019-12-18 12:42:19,743 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:42:19" (1/1) ... [2019-12-18 12:42:19,750 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:42:19" (1/1) ... [2019-12-18 12:42:19,766 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:42:19,767 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:42:19,767 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:42:19,767 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:42:19,768 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:42:19" (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-18 12:42:19,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:42:19,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:42:19,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:42:19,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:42:19,844 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:42:19,844 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:42:19,844 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:42:19,844 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:42:19,845 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:42:19,845 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:42:19,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:42:19,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:42:19,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:42:19,847 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 12:42:20,594 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:42:20,595 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:42:20,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:42:20 BoogieIcfgContainer [2019-12-18 12:42:20,596 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:42:20,598 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:42:20,598 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:42:20,602 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:42:20,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:42:18" (1/3) ... [2019-12-18 12:42:20,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53d5eef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:42:20, skipping insertion in model container [2019-12-18 12:42:20,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:42:19" (2/3) ... [2019-12-18 12:42:20,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53d5eef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:42:20, skipping insertion in model container [2019-12-18 12:42:20,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:42:20" (3/3) ... [2019-12-18 12:42:20,609 INFO L109 eAbstractionObserver]: Analyzing ICFG mix019_pso.oepc.i [2019-12-18 12:42:20,619 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:42:20,620 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:42:20,631 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:42:20,632 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:42:20,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,681 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,681 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,682 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,684 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,684 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,696 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,696 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,721 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,722 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,749 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,751 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,759 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,759 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,759 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,761 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,762 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:42:20,778 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 12:42:20,798 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:42:20,799 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:42:20,799 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:42:20,799 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:42:20,799 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:42:20,799 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:42:20,799 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:42:20,800 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:42:20,817 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-18 12:42:20,819 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 12:42:20,918 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 12:42:20,918 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:42:20,941 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:42:20,974 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 12:42:21,031 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 12:42:21,031 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:42:21,048 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:42:21,069 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 12:42:21,070 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:42:26,236 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 12:42:26,360 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 12:42:26,630 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130103 [2019-12-18 12:42:26,630 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-18 12:42:26,633 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 105 transitions [2019-12-18 12:42:47,546 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 122102 states. [2019-12-18 12:42:47,548 INFO L276 IsEmpty]: Start isEmpty. Operand 122102 states. [2019-12-18 12:42:47,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 12:42:47,552 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:42:47,553 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 12:42:47,553 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-18 12:42:47,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:42:47,558 INFO L82 PathProgramCache]: Analyzing trace with hash 913940, now seen corresponding path program 1 times [2019-12-18 12:42:47,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:42:47,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623339588] [2019-12-18 12:42:47,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:42:47,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:42:47,777 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-18 12:42:47,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623339588] [2019-12-18 12:42:47,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:42:47,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:42:47,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522970516] [2019-12-18 12:42:47,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:42:47,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:42:47,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:42:47,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:42:47,805 INFO L87 Difference]: Start difference. First operand 122102 states. Second operand 3 states. [2019-12-18 12:42:48,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:42:48,985 INFO L93 Difference]: Finished difference Result 121140 states and 517588 transitions. [2019-12-18 12:42:48,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:42:48,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 12:42:48,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:42:49,616 INFO L225 Difference]: With dead ends: 121140 [2019-12-18 12:42:49,616 INFO L226 Difference]: Without dead ends: 107958 [2019-12-18 12:42:49,618 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-18 12:42:57,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107958 states. [2019-12-18 12:43:02,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107958 to 107958. [2019-12-18 12:43:02,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107958 states. [2019-12-18 12:43:02,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107958 states to 107958 states and 460128 transitions. [2019-12-18 12:43:02,966 INFO L78 Accepts]: Start accepts. Automaton has 107958 states and 460128 transitions. Word has length 3 [2019-12-18 12:43:02,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:43:02,966 INFO L462 AbstractCegarLoop]: Abstraction has 107958 states and 460128 transitions. [2019-12-18 12:43:02,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:43:02,967 INFO L276 IsEmpty]: Start isEmpty. Operand 107958 states and 460128 transitions. [2019-12-18 12:43:02,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 12:43:02,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:43:02,971 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:43:02,971 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-18 12:43:02,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:43:02,972 INFO L82 PathProgramCache]: Analyzing trace with hash 2082409598, now seen corresponding path program 1 times [2019-12-18 12:43:02,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:43:02,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858719378] [2019-12-18 12:43:02,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:43:03,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:43:03,128 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-18 12:43:03,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858719378] [2019-12-18 12:43:03,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:43:03,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:43:03,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632228542] [2019-12-18 12:43:03,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:43:03,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:43:03,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:43:03,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:43:03,131 INFO L87 Difference]: Start difference. First operand 107958 states and 460128 transitions. Second operand 4 states. [2019-12-18 12:43:09,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:43:09,073 INFO L93 Difference]: Finished difference Result 172022 states and 703369 transitions. [2019-12-18 12:43:09,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:43:09,074 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 12:43:09,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:43:09,703 INFO L225 Difference]: With dead ends: 172022 [2019-12-18 12:43:09,703 INFO L226 Difference]: Without dead ends: 171924 [2019-12-18 12:43:09,704 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-18 12:43:14,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171924 states. [2019-12-18 12:43:17,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171924 to 156115. [2019-12-18 12:43:17,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156115 states. [2019-12-18 12:43:18,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156115 states to 156115 states and 647087 transitions. [2019-12-18 12:43:18,210 INFO L78 Accepts]: Start accepts. Automaton has 156115 states and 647087 transitions. Word has length 11 [2019-12-18 12:43:18,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:43:18,210 INFO L462 AbstractCegarLoop]: Abstraction has 156115 states and 647087 transitions. [2019-12-18 12:43:18,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:43:18,210 INFO L276 IsEmpty]: Start isEmpty. Operand 156115 states and 647087 transitions. [2019-12-18 12:43:18,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 12:43:18,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:43:18,225 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:43:18,226 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-18 12:43:18,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:43:18,226 INFO L82 PathProgramCache]: Analyzing trace with hash 594088235, now seen corresponding path program 1 times [2019-12-18 12:43:18,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:43:18,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418908030] [2019-12-18 12:43:18,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:43:18,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:43:18,291 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-18 12:43:18,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418908030] [2019-12-18 12:43:18,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:43:18,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:43:18,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475970956] [2019-12-18 12:43:18,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:43:18,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:43:18,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:43:18,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:43:18,294 INFO L87 Difference]: Start difference. First operand 156115 states and 647087 transitions. Second operand 3 states. [2019-12-18 12:43:18,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:43:18,435 INFO L93 Difference]: Finished difference Result 33388 states and 108650 transitions. [2019-12-18 12:43:18,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:43:18,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 12:43:18,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:43:23,350 INFO L225 Difference]: With dead ends: 33388 [2019-12-18 12:43:23,350 INFO L226 Difference]: Without dead ends: 33388 [2019-12-18 12:43:23,351 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-18 12:43:23,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33388 states. [2019-12-18 12:43:23,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33388 to 33388. [2019-12-18 12:43:23,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33388 states. [2019-12-18 12:43:23,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33388 states to 33388 states and 108650 transitions. [2019-12-18 12:43:23,964 INFO L78 Accepts]: Start accepts. Automaton has 33388 states and 108650 transitions. Word has length 13 [2019-12-18 12:43:23,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:43:23,965 INFO L462 AbstractCegarLoop]: Abstraction has 33388 states and 108650 transitions. [2019-12-18 12:43:23,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:43:23,965 INFO L276 IsEmpty]: Start isEmpty. Operand 33388 states and 108650 transitions. [2019-12-18 12:43:23,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:43:23,968 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:43:23,968 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:43:23,968 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-18 12:43:23,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:43:23,969 INFO L82 PathProgramCache]: Analyzing trace with hash -805978823, now seen corresponding path program 1 times [2019-12-18 12:43:23,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:43:23,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353188579] [2019-12-18 12:43:23,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:43:23,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:43:24,024 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-18 12:43:24,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353188579] [2019-12-18 12:43:24,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:43:24,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:43:24,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189095827] [2019-12-18 12:43:24,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:43:24,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:43:24,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:43:24,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:43:24,026 INFO L87 Difference]: Start difference. First operand 33388 states and 108650 transitions. Second operand 3 states. [2019-12-18 12:43:24,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:43:24,235 INFO L93 Difference]: Finished difference Result 52822 states and 170897 transitions. [2019-12-18 12:43:24,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:43:24,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 12:43:24,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:43:24,339 INFO L225 Difference]: With dead ends: 52822 [2019-12-18 12:43:24,339 INFO L226 Difference]: Without dead ends: 52822 [2019-12-18 12:43:24,339 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-18 12:43:24,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52822 states. [2019-12-18 12:43:25,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52822 to 39094. [2019-12-18 12:43:25,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39094 states. [2019-12-18 12:43:25,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39094 states to 39094 states and 127496 transitions. [2019-12-18 12:43:25,099 INFO L78 Accepts]: Start accepts. Automaton has 39094 states and 127496 transitions. Word has length 16 [2019-12-18 12:43:25,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:43:25,100 INFO L462 AbstractCegarLoop]: Abstraction has 39094 states and 127496 transitions. [2019-12-18 12:43:25,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:43:25,100 INFO L276 IsEmpty]: Start isEmpty. Operand 39094 states and 127496 transitions. [2019-12-18 12:43:25,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:43:25,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:43:25,103 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:43:25,103 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-18 12:43:25,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:43:25,104 INFO L82 PathProgramCache]: Analyzing trace with hash -805853304, now seen corresponding path program 1 times [2019-12-18 12:43:25,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:43:25,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474665032] [2019-12-18 12:43:25,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:43:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:43:25,175 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-18 12:43:25,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474665032] [2019-12-18 12:43:25,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:43:25,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:43:25,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34099676] [2019-12-18 12:43:25,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:43:25,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:43:25,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:43:25,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:43:25,177 INFO L87 Difference]: Start difference. First operand 39094 states and 127496 transitions. Second operand 4 states. [2019-12-18 12:43:25,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:43:25,747 INFO L93 Difference]: Finished difference Result 46903 states and 150848 transitions. [2019-12-18 12:43:25,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:43:25,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 12:43:25,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:43:25,819 INFO L225 Difference]: With dead ends: 46903 [2019-12-18 12:43:25,819 INFO L226 Difference]: Without dead ends: 46903 [2019-12-18 12:43:25,819 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-18 12:43:26,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46903 states. [2019-12-18 12:43:26,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46903 to 42953. [2019-12-18 12:43:26,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42953 states. [2019-12-18 12:43:26,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42953 states to 42953 states and 139113 transitions. [2019-12-18 12:43:26,517 INFO L78 Accepts]: Start accepts. Automaton has 42953 states and 139113 transitions. Word has length 16 [2019-12-18 12:43:26,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:43:26,517 INFO L462 AbstractCegarLoop]: Abstraction has 42953 states and 139113 transitions. [2019-12-18 12:43:26,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:43:26,517 INFO L276 IsEmpty]: Start isEmpty. Operand 42953 states and 139113 transitions. [2019-12-18 12:43:26,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:43:26,521 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:43:26,521 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:43:26,521 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-18 12:43:26,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:43:26,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1222928522, now seen corresponding path program 1 times [2019-12-18 12:43:26,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:43:26,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732483422] [2019-12-18 12:43:26,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:43:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:43:26,576 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-18 12:43:26,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732483422] [2019-12-18 12:43:26,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:43:26,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:43:26,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647663929] [2019-12-18 12:43:26,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:43:26,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:43:26,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:43:26,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:43:26,578 INFO L87 Difference]: Start difference. First operand 42953 states and 139113 transitions. Second operand 4 states. [2019-12-18 12:43:26,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:43:26,939 INFO L93 Difference]: Finished difference Result 51478 states and 165621 transitions. [2019-12-18 12:43:26,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:43:26,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 12:43:26,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:43:27,026 INFO L225 Difference]: With dead ends: 51478 [2019-12-18 12:43:27,027 INFO L226 Difference]: Without dead ends: 51478 [2019-12-18 12:43:27,027 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-18 12:43:27,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51478 states. [2019-12-18 12:43:28,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51478 to 44383. [2019-12-18 12:43:28,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44383 states. [2019-12-18 12:43:28,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44383 states to 44383 states and 143934 transitions. [2019-12-18 12:43:28,222 INFO L78 Accepts]: Start accepts. Automaton has 44383 states and 143934 transitions. Word has length 16 [2019-12-18 12:43:28,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:43:28,223 INFO L462 AbstractCegarLoop]: Abstraction has 44383 states and 143934 transitions. [2019-12-18 12:43:28,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:43:28,223 INFO L276 IsEmpty]: Start isEmpty. Operand 44383 states and 143934 transitions. [2019-12-18 12:43:28,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:43:28,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:43:28,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] [2019-12-18 12:43:28,233 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-18 12:43:28,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:43:28,233 INFO L82 PathProgramCache]: Analyzing trace with hash -655013944, now seen corresponding path program 1 times [2019-12-18 12:43:28,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:43:28,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260844430] [2019-12-18 12:43:28,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:43:28,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:43:28,300 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-18 12:43:28,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260844430] [2019-12-18 12:43:28,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:43:28,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:43:28,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034917998] [2019-12-18 12:43:28,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:43:28,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:43:28,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:43:28,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:43:28,302 INFO L87 Difference]: Start difference. First operand 44383 states and 143934 transitions. Second operand 5 states. [2019-12-18 12:43:29,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:43:29,011 INFO L93 Difference]: Finished difference Result 61264 states and 194140 transitions. [2019-12-18 12:43:29,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:43:29,012 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 12:43:29,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:43:29,108 INFO L225 Difference]: With dead ends: 61264 [2019-12-18 12:43:29,109 INFO L226 Difference]: Without dead ends: 61250 [2019-12-18 12:43:29,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:43:29,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61250 states. [2019-12-18 12:43:29,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61250 to 45686. [2019-12-18 12:43:29,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45686 states. [2019-12-18 12:43:29,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45686 states to 45686 states and 147920 transitions. [2019-12-18 12:43:29,955 INFO L78 Accepts]: Start accepts. Automaton has 45686 states and 147920 transitions. Word has length 22 [2019-12-18 12:43:29,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:43:29,955 INFO L462 AbstractCegarLoop]: Abstraction has 45686 states and 147920 transitions. [2019-12-18 12:43:29,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:43:29,955 INFO L276 IsEmpty]: Start isEmpty. Operand 45686 states and 147920 transitions. [2019-12-18 12:43:29,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:43:29,964 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:43:29,964 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-18 12:43:29,965 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-18 12:43:29,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:43:29,965 INFO L82 PathProgramCache]: Analyzing trace with hash -2032339914, now seen corresponding path program 1 times [2019-12-18 12:43:29,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:43:29,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079946109] [2019-12-18 12:43:29,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:43:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:43:30,031 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-18 12:43:30,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079946109] [2019-12-18 12:43:30,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:43:30,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:43:30,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667366598] [2019-12-18 12:43:30,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:43:30,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:43:30,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:43:30,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:43:30,033 INFO L87 Difference]: Start difference. First operand 45686 states and 147920 transitions. Second operand 5 states. [2019-12-18 12:43:30,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:43:30,754 INFO L93 Difference]: Finished difference Result 63752 states and 201665 transitions. [2019-12-18 12:43:30,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:43:30,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 12:43:30,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:43:30,856 INFO L225 Difference]: With dead ends: 63752 [2019-12-18 12:43:30,856 INFO L226 Difference]: Without dead ends: 63738 [2019-12-18 12:43:30,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:43:31,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63738 states. [2019-12-18 12:43:31,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63738 to 44032. [2019-12-18 12:43:31,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44032 states. [2019-12-18 12:43:32,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44032 states to 44032 states and 142639 transitions. [2019-12-18 12:43:32,049 INFO L78 Accepts]: Start accepts. Automaton has 44032 states and 142639 transitions. Word has length 22 [2019-12-18 12:43:32,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:43:32,050 INFO L462 AbstractCegarLoop]: Abstraction has 44032 states and 142639 transitions. [2019-12-18 12:43:32,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:43:32,050 INFO L276 IsEmpty]: Start isEmpty. Operand 44032 states and 142639 transitions. [2019-12-18 12:43:32,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 12:43:32,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:43:32,062 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-18 12:43:32,062 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-18 12:43:32,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:43:32,063 INFO L82 PathProgramCache]: Analyzing trace with hash -701847110, now seen corresponding path program 1 times [2019-12-18 12:43:32,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:43:32,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705729306] [2019-12-18 12:43:32,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:43:32,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:43:32,108 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-18 12:43:32,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705729306] [2019-12-18 12:43:32,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:43:32,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:43:32,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199157573] [2019-12-18 12:43:32,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:43:32,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:43:32,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:43:32,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:43:32,110 INFO L87 Difference]: Start difference. First operand 44032 states and 142639 transitions. Second operand 4 states. [2019-12-18 12:43:32,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:43:32,194 INFO L93 Difference]: Finished difference Result 17193 states and 52641 transitions. [2019-12-18 12:43:32,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:43:32,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 12:43:32,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:43:32,226 INFO L225 Difference]: With dead ends: 17193 [2019-12-18 12:43:32,226 INFO L226 Difference]: Without dead ends: 17193 [2019-12-18 12:43:32,227 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-18 12:43:32,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17193 states. [2019-12-18 12:43:32,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17193 to 16865. [2019-12-18 12:43:32,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16865 states. [2019-12-18 12:43:32,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16865 states to 16865 states and 51705 transitions. [2019-12-18 12:43:32,488 INFO L78 Accepts]: Start accepts. Automaton has 16865 states and 51705 transitions. Word has length 25 [2019-12-18 12:43:32,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:43:32,489 INFO L462 AbstractCegarLoop]: Abstraction has 16865 states and 51705 transitions. [2019-12-18 12:43:32,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:43:32,489 INFO L276 IsEmpty]: Start isEmpty. Operand 16865 states and 51705 transitions. [2019-12-18 12:43:32,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 12:43:32,502 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:43:32,502 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] [2019-12-18 12:43:32,502 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-18 12:43:32,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:43:32,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1083173402, now seen corresponding path program 1 times [2019-12-18 12:43:32,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:43:32,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597758302] [2019-12-18 12:43:32,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:43:32,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:43:32,590 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-18 12:43:32,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597758302] [2019-12-18 12:43:32,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:43:32,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:43:32,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198612319] [2019-12-18 12:43:32,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:43:32,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:43:32,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:43:32,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:43:32,593 INFO L87 Difference]: Start difference. First operand 16865 states and 51705 transitions. Second operand 5 states. [2019-12-18 12:43:32,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:43:32,989 INFO L93 Difference]: Finished difference Result 21613 states and 65127 transitions. [2019-12-18 12:43:32,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:43:32,990 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 12:43:32,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:43:33,032 INFO L225 Difference]: With dead ends: 21613 [2019-12-18 12:43:33,032 INFO L226 Difference]: Without dead ends: 21613 [2019-12-18 12:43:33,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:43:33,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21613 states. [2019-12-18 12:43:33,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21613 to 20225. [2019-12-18 12:43:33,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20225 states. [2019-12-18 12:43:33,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20225 states to 20225 states and 61637 transitions. [2019-12-18 12:43:33,344 INFO L78 Accepts]: Start accepts. Automaton has 20225 states and 61637 transitions. Word has length 26 [2019-12-18 12:43:33,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:43:33,344 INFO L462 AbstractCegarLoop]: Abstraction has 20225 states and 61637 transitions. [2019-12-18 12:43:33,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:43:33,344 INFO L276 IsEmpty]: Start isEmpty. Operand 20225 states and 61637 transitions. [2019-12-18 12:43:33,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 12:43:33,359 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:43:33,360 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] [2019-12-18 12:43:33,360 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-18 12:43:33,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:43:33,360 INFO L82 PathProgramCache]: Analyzing trace with hash -799804073, now seen corresponding path program 1 times [2019-12-18 12:43:33,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:43:33,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41827963] [2019-12-18 12:43:33,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:43:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:43:33,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-18 12:43:33,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41827963] [2019-12-18 12:43:33,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:43:33,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:43:33,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732702394] [2019-12-18 12:43:33,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:43:33,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:43:33,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:43:33,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:43:33,453 INFO L87 Difference]: Start difference. First operand 20225 states and 61637 transitions. Second operand 5 states. [2019-12-18 12:43:33,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:43:33,783 INFO L93 Difference]: Finished difference Result 23624 states and 70894 transitions. [2019-12-18 12:43:33,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:43:33,784 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 12:43:33,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:43:33,816 INFO L225 Difference]: With dead ends: 23624 [2019-12-18 12:43:33,816 INFO L226 Difference]: Without dead ends: 23624 [2019-12-18 12:43:33,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:43:33,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23624 states. [2019-12-18 12:43:34,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23624 to 19452. [2019-12-18 12:43:34,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19452 states. [2019-12-18 12:43:34,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19452 states to 19452 states and 59284 transitions. [2019-12-18 12:43:34,359 INFO L78 Accepts]: Start accepts. Automaton has 19452 states and 59284 transitions. Word has length 28 [2019-12-18 12:43:34,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:43:34,359 INFO L462 AbstractCegarLoop]: Abstraction has 19452 states and 59284 transitions. [2019-12-18 12:43:34,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:43:34,359 INFO L276 IsEmpty]: Start isEmpty. Operand 19452 states and 59284 transitions. [2019-12-18 12:43:34,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 12:43:34,378 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:43:34,378 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] [2019-12-18 12:43:34,379 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-18 12:43:34,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:43:34,379 INFO L82 PathProgramCache]: Analyzing trace with hash -145847770, now seen corresponding path program 1 times [2019-12-18 12:43:34,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:43:34,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841196416] [2019-12-18 12:43:34,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:43:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:43:34,474 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-18 12:43:34,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841196416] [2019-12-18 12:43:34,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:43:34,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:43:34,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111060270] [2019-12-18 12:43:34,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:43:34,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:43:34,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:43:34,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:43:34,477 INFO L87 Difference]: Start difference. First operand 19452 states and 59284 transitions. Second operand 6 states. [2019-12-18 12:43:35,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:43:35,173 INFO L93 Difference]: Finished difference Result 27031 states and 80502 transitions. [2019-12-18 12:43:35,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:43:35,174 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-18 12:43:35,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:43:35,212 INFO L225 Difference]: With dead ends: 27031 [2019-12-18 12:43:35,213 INFO L226 Difference]: Without dead ends: 27031 [2019-12-18 12:43:35,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:43:35,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27031 states. [2019-12-18 12:43:35,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27031 to 20764. [2019-12-18 12:43:35,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20764 states. [2019-12-18 12:43:35,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20764 states to 20764 states and 63071 transitions. [2019-12-18 12:43:35,555 INFO L78 Accepts]: Start accepts. Automaton has 20764 states and 63071 transitions. Word has length 32 [2019-12-18 12:43:35,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:43:35,555 INFO L462 AbstractCegarLoop]: Abstraction has 20764 states and 63071 transitions. [2019-12-18 12:43:35,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:43:35,555 INFO L276 IsEmpty]: Start isEmpty. Operand 20764 states and 63071 transitions. [2019-12-18 12:43:35,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 12:43:35,578 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:43:35,578 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] [2019-12-18 12:43:35,578 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-18 12:43:35,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:43:35,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1380765993, now seen corresponding path program 1 times [2019-12-18 12:43:35,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:43:35,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246005265] [2019-12-18 12:43:35,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:43:35,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:43:35,657 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-18 12:43:35,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246005265] [2019-12-18 12:43:35,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:43:35,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:43:35,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5504602] [2019-12-18 12:43:35,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:43:35,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:43:35,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:43:35,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:43:35,660 INFO L87 Difference]: Start difference. First operand 20764 states and 63071 transitions. Second operand 6 states. [2019-12-18 12:43:36,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:43:36,362 INFO L93 Difference]: Finished difference Result 26334 states and 78684 transitions. [2019-12-18 12:43:36,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:43:36,363 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-18 12:43:36,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:43:36,405 INFO L225 Difference]: With dead ends: 26334 [2019-12-18 12:43:36,405 INFO L226 Difference]: Without dead ends: 26334 [2019-12-18 12:43:36,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:43:36,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26334 states. [2019-12-18 12:43:36,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26334 to 17642. [2019-12-18 12:43:36,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17642 states. [2019-12-18 12:43:36,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17642 states to 17642 states and 53957 transitions. [2019-12-18 12:43:36,716 INFO L78 Accepts]: Start accepts. Automaton has 17642 states and 53957 transitions. Word has length 34 [2019-12-18 12:43:36,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:43:36,717 INFO L462 AbstractCegarLoop]: Abstraction has 17642 states and 53957 transitions. [2019-12-18 12:43:36,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:43:36,717 INFO L276 IsEmpty]: Start isEmpty. Operand 17642 states and 53957 transitions. [2019-12-18 12:43:36,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 12:43:36,734 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:43:36,734 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-18 12:43:36,734 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-18 12:43:36,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:43:36,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1372962452, now seen corresponding path program 1 times [2019-12-18 12:43:36,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:43:36,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346147203] [2019-12-18 12:43:36,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:43:36,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:43:36,807 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-18 12:43:36,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346147203] [2019-12-18 12:43:36,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:43:36,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:43:36,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773215704] [2019-12-18 12:43:36,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:43:36,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:43:36,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:43:36,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:43:36,809 INFO L87 Difference]: Start difference. First operand 17642 states and 53957 transitions. Second operand 3 states. [2019-12-18 12:43:36,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:43:36,870 INFO L93 Difference]: Finished difference Result 17641 states and 53955 transitions. [2019-12-18 12:43:36,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:43:36,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 12:43:36,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:43:36,896 INFO L225 Difference]: With dead ends: 17641 [2019-12-18 12:43:36,896 INFO L226 Difference]: Without dead ends: 17641 [2019-12-18 12:43:36,896 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-18 12:43:36,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17641 states. [2019-12-18 12:43:37,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17641 to 17641. [2019-12-18 12:43:37,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17641 states. [2019-12-18 12:43:37,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17641 states to 17641 states and 53955 transitions. [2019-12-18 12:43:37,146 INFO L78 Accepts]: Start accepts. Automaton has 17641 states and 53955 transitions. Word has length 39 [2019-12-18 12:43:37,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:43:37,147 INFO L462 AbstractCegarLoop]: Abstraction has 17641 states and 53955 transitions. [2019-12-18 12:43:37,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:43:37,147 INFO L276 IsEmpty]: Start isEmpty. Operand 17641 states and 53955 transitions. [2019-12-18 12:43:37,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:43:37,165 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:43:37,165 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-18 12:43:37,165 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-18 12:43:37,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:43:37,165 INFO L82 PathProgramCache]: Analyzing trace with hash -2062304393, now seen corresponding path program 1 times [2019-12-18 12:43:37,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:43:37,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607183697] [2019-12-18 12:43:37,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:43:37,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:43:37,253 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-18 12:43:37,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607183697] [2019-12-18 12:43:37,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:43:37,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:43:37,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231509645] [2019-12-18 12:43:37,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:43:37,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:43:37,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:43:37,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:43:37,255 INFO L87 Difference]: Start difference. First operand 17641 states and 53955 transitions. Second operand 5 states. [2019-12-18 12:43:37,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:43:37,864 INFO L93 Difference]: Finished difference Result 25346 states and 76639 transitions. [2019-12-18 12:43:37,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:43:37,865 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 12:43:37,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:43:37,912 INFO L225 Difference]: With dead ends: 25346 [2019-12-18 12:43:37,912 INFO L226 Difference]: Without dead ends: 25346 [2019-12-18 12:43:37,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-18 12:43:37,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25346 states. [2019-12-18 12:43:38,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25346 to 23560. [2019-12-18 12:43:38,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23560 states. [2019-12-18 12:43:38,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23560 states to 23560 states and 71751 transitions. [2019-12-18 12:43:38,413 INFO L78 Accepts]: Start accepts. Automaton has 23560 states and 71751 transitions. Word has length 40 [2019-12-18 12:43:38,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:43:38,413 INFO L462 AbstractCegarLoop]: Abstraction has 23560 states and 71751 transitions. [2019-12-18 12:43:38,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:43:38,414 INFO L276 IsEmpty]: Start isEmpty. Operand 23560 states and 71751 transitions. [2019-12-18 12:43:38,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:43:38,446 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:43:38,446 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-18 12:43:38,446 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-18 12:43:38,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:43:38,447 INFO L82 PathProgramCache]: Analyzing trace with hash -950700709, now seen corresponding path program 2 times [2019-12-18 12:43:38,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:43:38,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402993025] [2019-12-18 12:43:38,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:43:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:43:38,503 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-18 12:43:38,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402993025] [2019-12-18 12:43:38,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:43:38,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:43:38,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250915688] [2019-12-18 12:43:38,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:43:38,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:43:38,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:43:38,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:43:38,505 INFO L87 Difference]: Start difference. First operand 23560 states and 71751 transitions. Second operand 5 states. [2019-12-18 12:43:38,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:43:38,620 INFO L93 Difference]: Finished difference Result 22175 states and 68518 transitions. [2019-12-18 12:43:38,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:43:38,620 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 12:43:38,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:43:38,674 INFO L225 Difference]: With dead ends: 22175 [2019-12-18 12:43:38,674 INFO L226 Difference]: Without dead ends: 22175 [2019-12-18 12:43:38,674 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-18 12:43:38,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22175 states. [2019-12-18 12:43:39,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22175 to 21251. [2019-12-18 12:43:39,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21251 states. [2019-12-18 12:43:39,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21251 states to 21251 states and 66025 transitions. [2019-12-18 12:43:39,221 INFO L78 Accepts]: Start accepts. Automaton has 21251 states and 66025 transitions. Word has length 40 [2019-12-18 12:43:39,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:43:39,221 INFO L462 AbstractCegarLoop]: Abstraction has 21251 states and 66025 transitions. [2019-12-18 12:43:39,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:43:39,221 INFO L276 IsEmpty]: Start isEmpty. Operand 21251 states and 66025 transitions. [2019-12-18 12:43:39,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:43:39,254 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:43:39,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] [2019-12-18 12:43:39,255 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-18 12:43:39,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:43:39,255 INFO L82 PathProgramCache]: Analyzing trace with hash 20161267, now seen corresponding path program 1 times [2019-12-18 12:43:39,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:43:39,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027228486] [2019-12-18 12:43:39,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:43:39,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:43:39,344 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-18 12:43:39,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027228486] [2019-12-18 12:43:39,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:43:39,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:43:39,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606740676] [2019-12-18 12:43:39,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:43:39,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:43:39,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:43:39,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:43:39,346 INFO L87 Difference]: Start difference. First operand 21251 states and 66025 transitions. Second operand 7 states. [2019-12-18 12:43:39,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:43:39,860 INFO L93 Difference]: Finished difference Result 62478 states and 192933 transitions. [2019-12-18 12:43:39,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 12:43:39,861 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 12:43:39,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:43:39,926 INFO L225 Difference]: With dead ends: 62478 [2019-12-18 12:43:39,926 INFO L226 Difference]: Without dead ends: 47634 [2019-12-18 12:43:39,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 12:43:40,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47634 states. [2019-12-18 12:43:40,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47634 to 25007. [2019-12-18 12:43:40,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25007 states. [2019-12-18 12:43:40,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25007 states to 25007 states and 78146 transitions. [2019-12-18 12:43:40,456 INFO L78 Accepts]: Start accepts. Automaton has 25007 states and 78146 transitions. Word has length 63 [2019-12-18 12:43:40,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:43:40,456 INFO L462 AbstractCegarLoop]: Abstraction has 25007 states and 78146 transitions. [2019-12-18 12:43:40,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:43:40,457 INFO L276 IsEmpty]: Start isEmpty. Operand 25007 states and 78146 transitions. [2019-12-18 12:43:40,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:43:40,484 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:43:40,484 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] [2019-12-18 12:43:40,485 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-18 12:43:40,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:43:40,485 INFO L82 PathProgramCache]: Analyzing trace with hash 618170621, now seen corresponding path program 2 times [2019-12-18 12:43:40,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:43:40,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303204575] [2019-12-18 12:43:40,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:43:40,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:43:40,582 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-18 12:43:40,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303204575] [2019-12-18 12:43:40,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:43:40,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:43:40,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198193166] [2019-12-18 12:43:40,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:43:40,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:43:40,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:43:40,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:43:40,584 INFO L87 Difference]: Start difference. First operand 25007 states and 78146 transitions. Second operand 7 states. [2019-12-18 12:43:41,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:43:41,095 INFO L93 Difference]: Finished difference Result 68433 states and 210070 transitions. [2019-12-18 12:43:41,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:43:41,095 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 12:43:41,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:43:41,162 INFO L225 Difference]: With dead ends: 68433 [2019-12-18 12:43:41,162 INFO L226 Difference]: Without dead ends: 48478 [2019-12-18 12:43:41,163 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-18 12:43:41,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48478 states. [2019-12-18 12:43:41,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48478 to 28798. [2019-12-18 12:43:41,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28798 states. [2019-12-18 12:43:41,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28798 states to 28798 states and 89643 transitions. [2019-12-18 12:43:41,943 INFO L78 Accepts]: Start accepts. Automaton has 28798 states and 89643 transitions. Word has length 63 [2019-12-18 12:43:41,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:43:41,943 INFO L462 AbstractCegarLoop]: Abstraction has 28798 states and 89643 transitions. [2019-12-18 12:43:41,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:43:41,943 INFO L276 IsEmpty]: Start isEmpty. Operand 28798 states and 89643 transitions. [2019-12-18 12:43:41,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:43:41,974 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:43:41,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] [2019-12-18 12:43:41,975 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-18 12:43:41,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:43:41,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1826673419, now seen corresponding path program 3 times [2019-12-18 12:43:41,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:43:41,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183561508] [2019-12-18 12:43:41,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:43:41,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:43:42,063 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-18 12:43:42,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183561508] [2019-12-18 12:43:42,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:43:42,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:43:42,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628744904] [2019-12-18 12:43:42,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:43:42,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:43:42,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:43:42,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:43:42,065 INFO L87 Difference]: Start difference. First operand 28798 states and 89643 transitions. Second operand 7 states. [2019-12-18 12:43:42,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:43:42,764 INFO L93 Difference]: Finished difference Result 59843 states and 183697 transitions. [2019-12-18 12:43:42,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:43:42,765 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 12:43:42,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:43:42,876 INFO L225 Difference]: With dead ends: 59843 [2019-12-18 12:43:42,876 INFO L226 Difference]: Without dead ends: 52762 [2019-12-18 12:43:42,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:43:43,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52762 states. [2019-12-18 12:43:43,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52762 to 29106. [2019-12-18 12:43:43,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29106 states. [2019-12-18 12:43:43,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29106 states to 29106 states and 90594 transitions. [2019-12-18 12:43:43,485 INFO L78 Accepts]: Start accepts. Automaton has 29106 states and 90594 transitions. Word has length 63 [2019-12-18 12:43:43,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:43:43,485 INFO L462 AbstractCegarLoop]: Abstraction has 29106 states and 90594 transitions. [2019-12-18 12:43:43,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:43:43,485 INFO L276 IsEmpty]: Start isEmpty. Operand 29106 states and 90594 transitions. [2019-12-18 12:43:43,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:43:43,514 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:43:43,514 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] [2019-12-18 12:43:43,514 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-18 12:43:43,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:43:43,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1896779851, now seen corresponding path program 4 times [2019-12-18 12:43:43,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:43:43,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572180666] [2019-12-18 12:43:43,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:43:43,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:43:43,570 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-18 12:43:43,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572180666] [2019-12-18 12:43:43,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:43:43,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:43:43,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877900522] [2019-12-18 12:43:43,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:43:43,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:43:43,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:43:43,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:43:43,572 INFO L87 Difference]: Start difference. First operand 29106 states and 90594 transitions. Second operand 3 states. [2019-12-18 12:43:43,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:43:43,757 INFO L93 Difference]: Finished difference Result 35624 states and 109784 transitions. [2019-12-18 12:43:43,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:43:43,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-12-18 12:43:43,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:43:43,806 INFO L225 Difference]: With dead ends: 35624 [2019-12-18 12:43:43,806 INFO L226 Difference]: Without dead ends: 35624 [2019-12-18 12:43:43,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-18 12:43:43,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35624 states. [2019-12-18 12:43:44,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35624 to 31022. [2019-12-18 12:43:44,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31022 states. [2019-12-18 12:43:44,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31022 states to 31022 states and 96384 transitions. [2019-12-18 12:43:44,294 INFO L78 Accepts]: Start accepts. Automaton has 31022 states and 96384 transitions. Word has length 63 [2019-12-18 12:43:44,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:43:44,294 INFO L462 AbstractCegarLoop]: Abstraction has 31022 states and 96384 transitions. [2019-12-18 12:43:44,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:43:44,294 INFO L276 IsEmpty]: Start isEmpty. Operand 31022 states and 96384 transitions. [2019-12-18 12:43:44,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:43:44,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:43:44,332 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-18 12:43:44,332 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-18 12:43:44,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:43:44,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1820548391, now seen corresponding path program 1 times [2019-12-18 12:43:44,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:43:44,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817968027] [2019-12-18 12:43:44,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:43:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:43:44,403 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-18 12:43:44,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817968027] [2019-12-18 12:43:44,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:43:44,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:43:44,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19699170] [2019-12-18 12:43:44,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:43:44,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:43:44,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:43:44,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:43:44,405 INFO L87 Difference]: Start difference. First operand 31022 states and 96384 transitions. Second operand 3 states. [2019-12-18 12:43:44,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:43:44,531 INFO L93 Difference]: Finished difference Result 27331 states and 83817 transitions. [2019-12-18 12:43:44,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:43:44,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 12:43:44,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:43:44,595 INFO L225 Difference]: With dead ends: 27331 [2019-12-18 12:43:44,595 INFO L226 Difference]: Without dead ends: 27331 [2019-12-18 12:43:44,596 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-18 12:43:44,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27331 states. [2019-12-18 12:43:45,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27331 to 25709. [2019-12-18 12:43:45,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25709 states. [2019-12-18 12:43:45,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25709 states to 25709 states and 78689 transitions. [2019-12-18 12:43:45,434 INFO L78 Accepts]: Start accepts. Automaton has 25709 states and 78689 transitions. Word has length 64 [2019-12-18 12:43:45,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:43:45,434 INFO L462 AbstractCegarLoop]: Abstraction has 25709 states and 78689 transitions. [2019-12-18 12:43:45,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:43:45,434 INFO L276 IsEmpty]: Start isEmpty. Operand 25709 states and 78689 transitions. [2019-12-18 12:43:45,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:43:45,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:43:45,460 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-18 12:43:45,460 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-18 12:43:45,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:43:45,460 INFO L82 PathProgramCache]: Analyzing trace with hash -625357365, now seen corresponding path program 1 times [2019-12-18 12:43:45,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:43:45,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208102177] [2019-12-18 12:43:45,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:43:45,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:43:45,581 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-18 12:43:45,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208102177] [2019-12-18 12:43:45,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:43:45,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:43:45,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436164554] [2019-12-18 12:43:45,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:43:45,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:43:45,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:43:45,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:43:45,583 INFO L87 Difference]: Start difference. First operand 25709 states and 78689 transitions. Second operand 8 states. [2019-12-18 12:43:48,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:43:48,186 INFO L93 Difference]: Finished difference Result 37990 states and 113823 transitions. [2019-12-18 12:43:48,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 12:43:48,186 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 12:43:48,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:43:48,271 INFO L225 Difference]: With dead ends: 37990 [2019-12-18 12:43:48,272 INFO L226 Difference]: Without dead ends: 37718 [2019-12-18 12:43:48,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=881, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 12:43:48,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37718 states. [2019-12-18 12:43:48,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37718 to 26817. [2019-12-18 12:43:48,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26817 states. [2019-12-18 12:43:48,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26817 states to 26817 states and 81801 transitions. [2019-12-18 12:43:48,988 INFO L78 Accepts]: Start accepts. Automaton has 26817 states and 81801 transitions. Word has length 65 [2019-12-18 12:43:48,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:43:48,988 INFO L462 AbstractCegarLoop]: Abstraction has 26817 states and 81801 transitions. [2019-12-18 12:43:48,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:43:48,988 INFO L276 IsEmpty]: Start isEmpty. Operand 26817 states and 81801 transitions. [2019-12-18 12:43:49,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:43:49,016 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:43:49,016 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-18 12:43:49,016 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-18 12:43:49,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:43:49,016 INFO L82 PathProgramCache]: Analyzing trace with hash 946511855, now seen corresponding path program 2 times [2019-12-18 12:43:49,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:43:49,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105672506] [2019-12-18 12:43:49,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:43:49,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:43:49,202 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-18 12:43:49,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105672506] [2019-12-18 12:43:49,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:43:49,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:43:49,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279782480] [2019-12-18 12:43:49,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:43:49,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:43:49,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:43:49,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:43:49,204 INFO L87 Difference]: Start difference. First operand 26817 states and 81801 transitions. Second operand 10 states. [2019-12-18 12:43:50,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:43:50,456 INFO L93 Difference]: Finished difference Result 38987 states and 118473 transitions. [2019-12-18 12:43:50,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 12:43:50,456 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-18 12:43:50,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:43:50,500 INFO L225 Difference]: With dead ends: 38987 [2019-12-18 12:43:50,500 INFO L226 Difference]: Without dead ends: 31633 [2019-12-18 12:43:50,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-12-18 12:43:50,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31633 states. [2019-12-18 12:43:50,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31633 to 27253. [2019-12-18 12:43:50,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27253 states. [2019-12-18 12:43:50,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27253 states to 27253 states and 82983 transitions. [2019-12-18 12:43:50,923 INFO L78 Accepts]: Start accepts. Automaton has 27253 states and 82983 transitions. Word has length 65 [2019-12-18 12:43:50,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:43:50,923 INFO L462 AbstractCegarLoop]: Abstraction has 27253 states and 82983 transitions. [2019-12-18 12:43:50,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:43:50,923 INFO L276 IsEmpty]: Start isEmpty. Operand 27253 states and 82983 transitions. [2019-12-18 12:43:50,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:43:50,952 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:43:50,953 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-18 12:43:50,953 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-18 12:43:50,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:43:50,953 INFO L82 PathProgramCache]: Analyzing trace with hash 459691905, now seen corresponding path program 3 times [2019-12-18 12:43:50,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:43:50,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701318088] [2019-12-18 12:43:50,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:43:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:43:51,414 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-18 12:43:51,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701318088] [2019-12-18 12:43:51,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:43:51,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:43:51,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416012332] [2019-12-18 12:43:51,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:43:51,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:43:51,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:43:51,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:43:51,416 INFO L87 Difference]: Start difference. First operand 27253 states and 82983 transitions. Second operand 11 states. [2019-12-18 12:43:52,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:43:52,764 INFO L93 Difference]: Finished difference Result 39847 states and 119869 transitions. [2019-12-18 12:43:52,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:43:52,764 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-18 12:43:52,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:43:52,813 INFO L225 Difference]: With dead ends: 39847 [2019-12-18 12:43:52,813 INFO L226 Difference]: Without dead ends: 34164 [2019-12-18 12:43:52,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2019-12-18 12:43:52,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34164 states. [2019-12-18 12:43:53,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34164 to 27401. [2019-12-18 12:43:53,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27401 states. [2019-12-18 12:43:53,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27401 states to 27401 states and 83166 transitions. [2019-12-18 12:43:53,294 INFO L78 Accepts]: Start accepts. Automaton has 27401 states and 83166 transitions. Word has length 65 [2019-12-18 12:43:53,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:43:53,294 INFO L462 AbstractCegarLoop]: Abstraction has 27401 states and 83166 transitions. [2019-12-18 12:43:53,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:43:53,294 INFO L276 IsEmpty]: Start isEmpty. Operand 27401 states and 83166 transitions. [2019-12-18 12:43:53,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:43:53,323 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:43:53,323 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-18 12:43:53,323 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-18 12:43:53,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:43:53,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1007435361, now seen corresponding path program 4 times [2019-12-18 12:43:53,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:43:53,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455921799] [2019-12-18 12:43:53,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:43:53,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:43:53,483 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-18 12:43:53,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455921799] [2019-12-18 12:43:53,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:43:53,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:43:53,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904297526] [2019-12-18 12:43:53,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:43:53,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:43:53,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:43:53,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:43:53,485 INFO L87 Difference]: Start difference. First operand 27401 states and 83166 transitions. Second operand 11 states. [2019-12-18 12:43:54,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:43:54,795 INFO L93 Difference]: Finished difference Result 60593 states and 183592 transitions. [2019-12-18 12:43:54,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 12:43:54,796 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-18 12:43:54,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:43:54,885 INFO L225 Difference]: With dead ends: 60593 [2019-12-18 12:43:54,886 INFO L226 Difference]: Without dead ends: 55940 [2019-12-18 12:43:54,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-18 12:43:55,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55940 states. [2019-12-18 12:43:55,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55940 to 31383. [2019-12-18 12:43:55,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31383 states. [2019-12-18 12:43:55,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31383 states to 31383 states and 94916 transitions. [2019-12-18 12:43:55,564 INFO L78 Accepts]: Start accepts. Automaton has 31383 states and 94916 transitions. Word has length 65 [2019-12-18 12:43:55,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:43:55,564 INFO L462 AbstractCegarLoop]: Abstraction has 31383 states and 94916 transitions. [2019-12-18 12:43:55,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:43:55,564 INFO L276 IsEmpty]: Start isEmpty. Operand 31383 states and 94916 transitions. [2019-12-18 12:43:55,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:43:55,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:43:55,597 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-18 12:43:55,597 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-18 12:43:55,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:43:55,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1275313811, now seen corresponding path program 5 times [2019-12-18 12:43:55,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:43:55,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578468095] [2019-12-18 12:43:55,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:43:55,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:43:55,988 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-18 12:43:55,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578468095] [2019-12-18 12:43:55,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:43:55,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 12:43:55,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71656182] [2019-12-18 12:43:55,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 12:43:55,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:43:55,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 12:43:55,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-12-18 12:43:55,990 INFO L87 Difference]: Start difference. First operand 31383 states and 94916 transitions. Second operand 18 states. [2019-12-18 12:43:59,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:43:59,819 INFO L93 Difference]: Finished difference Result 39942 states and 121325 transitions. [2019-12-18 12:43:59,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 12:43:59,820 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 65 [2019-12-18 12:43:59,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:43:59,873 INFO L225 Difference]: With dead ends: 39942 [2019-12-18 12:43:59,874 INFO L226 Difference]: Without dead ends: 39384 [2019-12-18 12:43:59,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=176, Invalid=1014, Unknown=0, NotChecked=0, Total=1190 [2019-12-18 12:43:59,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39384 states. [2019-12-18 12:44:00,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39384 to 31435. [2019-12-18 12:44:00,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31435 states. [2019-12-18 12:44:00,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31435 states to 31435 states and 95038 transitions. [2019-12-18 12:44:00,373 INFO L78 Accepts]: Start accepts. Automaton has 31435 states and 95038 transitions. Word has length 65 [2019-12-18 12:44:00,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:44:00,374 INFO L462 AbstractCegarLoop]: Abstraction has 31435 states and 95038 transitions. [2019-12-18 12:44:00,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 12:44:00,374 INFO L276 IsEmpty]: Start isEmpty. Operand 31435 states and 95038 transitions. [2019-12-18 12:44:00,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:44:00,406 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:44:00,407 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-18 12:44:00,407 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-18 12:44:00,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:44:00,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1126220307, now seen corresponding path program 6 times [2019-12-18 12:44:00,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:44:00,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361647645] [2019-12-18 12:44:00,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:44:00,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:44:00,461 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-18 12:44:00,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361647645] [2019-12-18 12:44:00,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:44:00,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:44:00,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242591606] [2019-12-18 12:44:00,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:44:00,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:44:00,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:44:00,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:44:00,463 INFO L87 Difference]: Start difference. First operand 31435 states and 95038 transitions. Second operand 3 states. [2019-12-18 12:44:00,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:44:00,607 INFO L93 Difference]: Finished difference Result 31434 states and 95036 transitions. [2019-12-18 12:44:00,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:44:00,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 12:44:00,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:44:00,663 INFO L225 Difference]: With dead ends: 31434 [2019-12-18 12:44:00,663 INFO L226 Difference]: Without dead ends: 31434 [2019-12-18 12:44:00,663 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-18 12:44:00,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31434 states. [2019-12-18 12:44:01,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31434 to 26389. [2019-12-18 12:44:01,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26389 states. [2019-12-18 12:44:01,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26389 states to 26389 states and 80895 transitions. [2019-12-18 12:44:01,088 INFO L78 Accepts]: Start accepts. Automaton has 26389 states and 80895 transitions. Word has length 65 [2019-12-18 12:44:01,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:44:01,088 INFO L462 AbstractCegarLoop]: Abstraction has 26389 states and 80895 transitions. [2019-12-18 12:44:01,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:44:01,088 INFO L276 IsEmpty]: Start isEmpty. Operand 26389 states and 80895 transitions. [2019-12-18 12:44:01,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:44:01,114 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:44:01,114 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-18 12:44:01,114 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-18 12:44:01,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:44:01,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1239159877, now seen corresponding path program 1 times [2019-12-18 12:44:01,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:44:01,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404463825] [2019-12-18 12:44:01,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:44:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:44:01,812 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-18 12:44:01,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404463825] [2019-12-18 12:44:01,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:44:01,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 12:44:01,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328450178] [2019-12-18 12:44:01,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 12:44:01,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:44:01,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 12:44:01,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2019-12-18 12:44:01,814 INFO L87 Difference]: Start difference. First operand 26389 states and 80895 transitions. Second operand 20 states. [2019-12-18 12:44:05,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:44:05,049 INFO L93 Difference]: Finished difference Result 32510 states and 97574 transitions. [2019-12-18 12:44:05,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-18 12:44:05,049 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 66 [2019-12-18 12:44:05,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:44:05,096 INFO L225 Difference]: With dead ends: 32510 [2019-12-18 12:44:05,096 INFO L226 Difference]: Without dead ends: 32174 [2019-12-18 12:44:05,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=261, Invalid=1631, Unknown=0, NotChecked=0, Total=1892 [2019-12-18 12:44:05,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32174 states. [2019-12-18 12:44:05,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32174 to 28075. [2019-12-18 12:44:05,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28075 states. [2019-12-18 12:44:05,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28075 states to 28075 states and 85118 transitions. [2019-12-18 12:44:05,521 INFO L78 Accepts]: Start accepts. Automaton has 28075 states and 85118 transitions. Word has length 66 [2019-12-18 12:44:05,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:44:05,521 INFO L462 AbstractCegarLoop]: Abstraction has 28075 states and 85118 transitions. [2019-12-18 12:44:05,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 12:44:05,521 INFO L276 IsEmpty]: Start isEmpty. Operand 28075 states and 85118 transitions. [2019-12-18 12:44:05,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:44:05,551 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:44:05,551 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-18 12:44:05,552 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-18 12:44:05,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:44:05,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1626008201, now seen corresponding path program 2 times [2019-12-18 12:44:05,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:44:05,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49897506] [2019-12-18 12:44:05,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:44:05,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:44:05,707 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-18 12:44:05,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49897506] [2019-12-18 12:44:05,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:44:05,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:44:05,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917275926] [2019-12-18 12:44:05,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:44:05,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:44:05,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:44:05,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:44:05,709 INFO L87 Difference]: Start difference. First operand 28075 states and 85118 transitions. Second operand 11 states. [2019-12-18 12:44:06,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:44:06,778 INFO L93 Difference]: Finished difference Result 46876 states and 142020 transitions. [2019-12-18 12:44:06,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:44:06,779 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 12:44:06,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:44:06,837 INFO L225 Difference]: With dead ends: 46876 [2019-12-18 12:44:06,837 INFO L226 Difference]: Without dead ends: 37796 [2019-12-18 12:44:06,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:44:06,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37796 states. [2019-12-18 12:44:07,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37796 to 21889. [2019-12-18 12:44:07,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21889 states. [2019-12-18 12:44:07,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21889 states to 21889 states and 66748 transitions. [2019-12-18 12:44:07,295 INFO L78 Accepts]: Start accepts. Automaton has 21889 states and 66748 transitions. Word has length 66 [2019-12-18 12:44:07,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:44:07,295 INFO L462 AbstractCegarLoop]: Abstraction has 21889 states and 66748 transitions. [2019-12-18 12:44:07,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:44:07,295 INFO L276 IsEmpty]: Start isEmpty. Operand 21889 states and 66748 transitions. [2019-12-18 12:44:07,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:44:07,318 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:44:07,318 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-18 12:44:07,318 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-18 12:44:07,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:44:07,319 INFO L82 PathProgramCache]: Analyzing trace with hash -952881413, now seen corresponding path program 3 times [2019-12-18 12:44:07,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:44:07,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109700442] [2019-12-18 12:44:07,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:44:07,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:44:08,279 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-18 12:44:08,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109700442] [2019-12-18 12:44:08,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:44:08,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-18 12:44:08,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3033992] [2019-12-18 12:44:08,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 12:44:08,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:44:08,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 12:44:08,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2019-12-18 12:44:08,285 INFO L87 Difference]: Start difference. First operand 21889 states and 66748 transitions. Second operand 23 states. [2019-12-18 12:44:15,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:44:15,933 INFO L93 Difference]: Finished difference Result 22599 states and 68194 transitions. [2019-12-18 12:44:15,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-12-18 12:44:15,934 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 66 [2019-12-18 12:44:15,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:44:15,964 INFO L225 Difference]: With dead ends: 22599 [2019-12-18 12:44:15,965 INFO L226 Difference]: Without dead ends: 22080 [2019-12-18 12:44:15,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1396 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=597, Invalid=5103, Unknown=0, NotChecked=0, Total=5700 [2019-12-18 12:44:16,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22080 states. [2019-12-18 12:44:16,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22080 to 20887. [2019-12-18 12:44:16,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20887 states. [2019-12-18 12:44:16,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20887 states to 20887 states and 63847 transitions. [2019-12-18 12:44:16,271 INFO L78 Accepts]: Start accepts. Automaton has 20887 states and 63847 transitions. Word has length 66 [2019-12-18 12:44:16,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:44:16,271 INFO L462 AbstractCegarLoop]: Abstraction has 20887 states and 63847 transitions. [2019-12-18 12:44:16,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 12:44:16,272 INFO L276 IsEmpty]: Start isEmpty. Operand 20887 states and 63847 transitions. [2019-12-18 12:44:16,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:44:16,295 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:44:16,295 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-18 12:44:16,296 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-18 12:44:16,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:44:16,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1173514763, now seen corresponding path program 4 times [2019-12-18 12:44:16,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:44:16,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460040762] [2019-12-18 12:44:16,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:44:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:44:16,539 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-18 12:44:16,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460040762] [2019-12-18 12:44:16,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:44:16,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:44:16,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950133930] [2019-12-18 12:44:16,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 12:44:16,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:44:16,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 12:44:16,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:44:16,542 INFO L87 Difference]: Start difference. First operand 20887 states and 63847 transitions. Second operand 12 states. [2019-12-18 12:44:17,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:44:17,761 INFO L93 Difference]: Finished difference Result 36597 states and 111731 transitions. [2019-12-18 12:44:17,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:44:17,762 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-18 12:44:17,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:44:17,811 INFO L225 Difference]: With dead ends: 36597 [2019-12-18 12:44:17,811 INFO L226 Difference]: Without dead ends: 35606 [2019-12-18 12:44:17,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 12:44:17,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35606 states. [2019-12-18 12:44:18,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35606 to 20213. [2019-12-18 12:44:18,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20213 states. [2019-12-18 12:44:18,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20213 states to 20213 states and 62057 transitions. [2019-12-18 12:44:18,203 INFO L78 Accepts]: Start accepts. Automaton has 20213 states and 62057 transitions. Word has length 66 [2019-12-18 12:44:18,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:44:18,203 INFO L462 AbstractCegarLoop]: Abstraction has 20213 states and 62057 transitions. [2019-12-18 12:44:18,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 12:44:18,203 INFO L276 IsEmpty]: Start isEmpty. Operand 20213 states and 62057 transitions. [2019-12-18 12:44:18,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:44:18,223 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:44:18,223 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-18 12:44:18,223 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-18 12:44:18,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:44:18,223 INFO L82 PathProgramCache]: Analyzing trace with hash 620198601, now seen corresponding path program 5 times [2019-12-18 12:44:18,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:44:18,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514687126] [2019-12-18 12:44:18,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:44:18,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:44:18,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:44:18,333 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:44:18,334 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:44:18,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L825: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t503~0.base_22|)) (= v_~z$w_buff0_used~0_749 0) (= v_~weak$$choice2~0_132 0) (= 0 v_~weak$$choice0~0_14) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_6| 0) (= 0 v_~z$r_buff0_thd3~0_377) (= v_~__unbuffered_cnt~0_128 0) (= v_~z$r_buff0_thd1~0_378 0) (= v_~z$mem_tmp~0_24 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t503~0.base_22| 4)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t503~0.base_22| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t503~0.base_22|) |v_ULTIMATE.start_main_~#t503~0.offset_16| 0)) |v_#memory_int_19|) (< 0 |v_#StackHeapBarrier_15|) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff0_thd0~0_195 0) (= v_~y~0_28 0) (= v_~z$w_buff1_used~0_500 0) (= 0 |v_#NULL.base_6|) (= v_~main$tmp_guard1~0_38 0) (= 0 v_~z$flush_delayed~0_43) (= v_~z$read_delayed~0_7 0) (= |v_ULTIMATE.start_main_~#t503~0.offset_16| 0) (= v_~z$r_buff0_thd2~0_182 0) (= 0 v_~z$r_buff1_thd3~0_396) (= 0 v_~x~0_245) (= v_~z$r_buff1_thd1~0_267 0) (= 0 v_~__unbuffered_p2_EAX~0_35) (= v_~z$r_buff1_thd0~0_294 0) (= v_~z$w_buff0~0_256 0) (= v_~main$tmp_guard0~0_22 0) (= v_~__unbuffered_p2_EBX~0_48 0) (= 0 v_~__unbuffered_p1_EAX~0_41) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t503~0.base_22|) (= v_~z$r_buff1_thd2~0_280 0) (= |v_#valid_69| (store .cse0 |v_ULTIMATE.start_main_~#t503~0.base_22| 1)) (= v_~z$w_buff1~0_199 0) (= v_~z~0_182 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_280, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_63|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_113|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_223|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_72|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_195, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_41, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ULTIMATE.start_main_~#t503~0.base=|v_ULTIMATE.start_main_~#t503~0.base_22|, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_48, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ULTIMATE.start_main_~#t505~0.base=|v_ULTIMATE.start_main_~#t505~0.base_17|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_500, ~z$flush_delayed~0=v_~z$flush_delayed~0_43, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t504~0.base=|v_ULTIMATE.start_main_~#t504~0.base_19|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_267, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_377, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, ~x~0=v_~x~0_245, ULTIMATE.start_main_~#t505~0.offset=|v_ULTIMATE.start_main_~#t505~0.offset_14|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_199, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_45|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_33|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_294, ~y~0=v_~y~0_28, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_182, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_749, ~z$w_buff0~0=v_~z$w_buff0~0_256, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_396, ULTIMATE.start_main_~#t503~0.offset=|v_ULTIMATE.start_main_~#t503~0.offset_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_69|, ULTIMATE.start_main_~#t504~0.offset=|v_ULTIMATE.start_main_~#t504~0.offset_14|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_182, ~weak$$choice2~0=v_~weak$$choice2~0_132, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_378} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t503~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ULTIMATE.start_main_~#t505~0.base, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t504~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t505~0.offset, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t503~0.offset, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~#t504~0.offset, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:44:18,339 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L4-->L746: Formula: (and (= v_~z$r_buff0_thd1~0_29 v_~z$r_buff1_thd1~0_17) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10 0)) (= v_~z$r_buff0_thd2~0_25 v_~z$r_buff1_thd2~0_17) (= v_~x~0_11 1) (= v_~z$r_buff0_thd3~0_70 v_~z$r_buff1_thd3~0_54) (= v_~z$r_buff0_thd1~0_28 1) (= v_~z$r_buff0_thd0~0_26 v_~z$r_buff1_thd0~0_23)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_29, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_54, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_23, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28, ~x~0=v_~x~0_11, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 12:44:18,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L825-1-->L827: Formula: (and (= |v_ULTIMATE.start_main_~#t504~0.offset_10| 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t504~0.base_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t504~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t504~0.base_11| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t504~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t504~0.base_11|) |v_ULTIMATE.start_main_~#t504~0.offset_10| 1)) |v_#memory_int_13|) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t504~0.base_11| 1) |v_#valid_31|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t504~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t504~0.base=|v_ULTIMATE.start_main_~#t504~0.base_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, ULTIMATE.start_main_~#t504~0.offset=|v_ULTIMATE.start_main_~#t504~0.offset_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t504~0.base, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t504~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 12:44:18,342 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L827-1-->L829: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t505~0.base_12|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t505~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t505~0.base_12|) |v_ULTIMATE.start_main_~#t505~0.offset_10| 2)) |v_#memory_int_11|) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t505~0.base_12| 1)) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t505~0.base_12|) 0) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t505~0.base_12| 4) |v_#length_13|) (= |v_ULTIMATE.start_main_~#t505~0.offset_10| 0) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t505~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t505~0.offset=|v_ULTIMATE.start_main_~#t505~0.offset_10|, #valid=|v_#valid_29|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t505~0.base=|v_ULTIMATE.start_main_~#t505~0.base_12|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t505~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t505~0.base, #length] because there is no mapped edge [2019-12-18 12:44:18,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L766-2-->L766-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-1227626347 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1227626347 256) 0)) (.cse2 (= |P1Thread1of1ForFork2_#t~ite9_Out-1227626347| |P1Thread1of1ForFork2_#t~ite10_Out-1227626347|))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out-1227626347| ~z$w_buff1~0_In-1227626347) (not .cse0) (not .cse1) .cse2) (and (= |P1Thread1of1ForFork2_#t~ite9_Out-1227626347| ~z~0_In-1227626347) (or .cse0 .cse1) .cse2))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1227626347, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1227626347, ~z$w_buff1~0=~z$w_buff1~0_In-1227626347, ~z~0=~z~0_In-1227626347} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1227626347|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1227626347, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out-1227626347|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1227626347, ~z$w_buff1~0=~z$w_buff1~0_In-1227626347, ~z~0=~z~0_In-1227626347} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 12:44:18,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L792-->L792-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In855135178 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite24_Out855135178| ~z$w_buff1~0_In855135178) (= |P2Thread1of1ForFork0_#t~ite23_In855135178| |P2Thread1of1ForFork0_#t~ite23_Out855135178|) (not .cse0)) (and (= |P2Thread1of1ForFork0_#t~ite23_Out855135178| ~z$w_buff1~0_In855135178) (= |P2Thread1of1ForFork0_#t~ite24_Out855135178| |P2Thread1of1ForFork0_#t~ite23_Out855135178|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In855135178 256) 0))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In855135178 256))) (and .cse1 (= (mod ~z$w_buff1_used~0_In855135178 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In855135178 256))))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In855135178, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In855135178, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In855135178|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In855135178, ~z$w_buff1~0=~z$w_buff1~0_In855135178, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In855135178, ~weak$$choice2~0=~weak$$choice2~0_In855135178} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In855135178, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out855135178|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In855135178, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out855135178|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In855135178, ~z$w_buff1~0=~z$w_buff1~0_In855135178, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In855135178, ~weak$$choice2~0=~weak$$choice2~0_In855135178} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-18 12:44:18,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L794-->L794-8: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd3~0_In-1259775689 256) 0)) (.cse0 (= 0 (mod ~weak$$choice2~0_In-1259775689 256))) (.cse5 (= |P2Thread1of1ForFork0_#t~ite30_Out-1259775689| |P2Thread1of1ForFork0_#t~ite29_Out-1259775689|)) (.cse4 (= (mod ~z$w_buff1_used~0_In-1259775689 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1259775689 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-1259775689 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite28_In-1259775689| |P2Thread1of1ForFork0_#t~ite28_Out-1259775689|) (or (and (= |P2Thread1of1ForFork0_#t~ite29_In-1259775689| |P2Thread1of1ForFork0_#t~ite29_Out-1259775689|) (= |P2Thread1of1ForFork0_#t~ite30_Out-1259775689| ~z$w_buff1_used~0_In-1259775689) (not .cse0)) (and (or .cse1 (and .cse2 .cse3) (and .cse2 .cse4)) .cse0 (= ~z$w_buff1_used~0_In-1259775689 |P2Thread1of1ForFork0_#t~ite29_Out-1259775689|) .cse5))) (let ((.cse6 (not .cse2))) (and (or .cse6 (not .cse3)) (= 0 |P2Thread1of1ForFork0_#t~ite28_Out-1259775689|) .cse0 .cse5 (or (not .cse4) .cse6) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite29_Out-1259775689| |P2Thread1of1ForFork0_#t~ite28_Out-1259775689|))))) InVars {P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_In-1259775689|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1259775689, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1259775689, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1259775689, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1259775689, ~weak$$choice2~0=~weak$$choice2~0_In-1259775689, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-1259775689|} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-1259775689|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1259775689, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1259775689, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1259775689, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1259775689, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-1259775689|, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-1259775689|, ~weak$$choice2~0=~weak$$choice2~0_In-1259775689} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 12:44:18,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [890] [890] L794-8-->L796: Formula: (and (= v_~z$r_buff0_thd3~0_371 v_~z$r_buff0_thd3~0_370) (= v_~z$w_buff1_used~0_493 |v_P2Thread1of1ForFork0_#t~ite30_38|) (not (= (mod v_~weak$$choice2~0_130 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_371, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_38|, ~weak$$choice2~0=v_~weak$$choice2~0_130} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_39|, P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_15|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_31|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_493, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_370, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_23|, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_37|, ~weak$$choice2~0=v_~weak$$choice2~0_130, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_49|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 12:44:18,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L798-->L802: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9) (= v_~z~0_46 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_46} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 12:44:18,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L802-2-->L802-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In461878434 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In461878434 256) 0)) (.cse1 (= |P2Thread1of1ForFork0_#t~ite39_Out461878434| |P2Thread1of1ForFork0_#t~ite38_Out461878434|))) (or (and (not .cse0) (= ~z$w_buff1~0_In461878434 |P2Thread1of1ForFork0_#t~ite38_Out461878434|) .cse1 (not .cse2)) (and (or .cse0 .cse2) (= ~z~0_In461878434 |P2Thread1of1ForFork0_#t~ite38_Out461878434|) .cse1))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In461878434, ~z$w_buff1_used~0=~z$w_buff1_used~0_In461878434, ~z$w_buff1~0=~z$w_buff1~0_In461878434, ~z~0=~z~0_In461878434} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out461878434|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out461878434|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In461878434, ~z$w_buff1_used~0=~z$w_buff1_used~0_In461878434, ~z$w_buff1~0=~z$w_buff1~0_In461878434, ~z~0=~z~0_In461878434} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 12:44:18,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-903821784 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-903821784 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out-903821784| ~z$w_buff0_used~0_In-903821784)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out-903821784| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-903821784, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-903821784} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-903821784, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-903821784|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-903821784} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 12:44:18,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L804-->L804-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In1916705862 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1916705862 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1916705862 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1916705862 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite41_Out1916705862| ~z$w_buff1_used~0_In1916705862) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite41_Out1916705862| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1916705862, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1916705862, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1916705862, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1916705862} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1916705862, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1916705862, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1916705862, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1916705862, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1916705862|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 12:44:18,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L805-->L805-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1744796272 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1744796272 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out-1744796272| ~z$r_buff0_thd3~0_In-1744796272) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-1744796272|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1744796272, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1744796272} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1744796272, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1744796272, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1744796272|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 12:44:18,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-390281085 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-390281085 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-390281085 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd3~0_In-390281085 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-390281085|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In-390281085 |P2Thread1of1ForFork0_#t~ite43_Out-390281085|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-390281085, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-390281085, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-390281085, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-390281085} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-390281085|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-390281085, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-390281085, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-390281085, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-390281085} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 12:44:18,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L806-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_100 1) v_~__unbuffered_cnt~0_99) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_308 |v_P2Thread1of1ForFork0_#t~ite43_56|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_56|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_55|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_308, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_99, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 12:44:18,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L747-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In772226965 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In772226965 256) 0))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite5_Out772226965|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In772226965 |P0Thread1of1ForFork1_#t~ite5_Out772226965|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In772226965, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In772226965} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out772226965|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In772226965, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In772226965} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 12:44:18,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L748-->L748-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In264074196 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In264074196 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In264074196 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In264074196 256)))) (or (and (= ~z$w_buff1_used~0_In264074196 |P0Thread1of1ForFork1_#t~ite6_Out264074196|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out264074196|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In264074196, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In264074196, ~z$w_buff1_used~0=~z$w_buff1_used~0_In264074196, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In264074196} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In264074196, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out264074196|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In264074196, ~z$w_buff1_used~0=~z$w_buff1_used~0_In264074196, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In264074196} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 12:44:18,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L750: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1114620541 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1114620541 256)))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out1114620541) (not .cse1)) (and (= ~z$r_buff0_thd1~0_Out1114620541 ~z$r_buff0_thd1~0_In1114620541) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1114620541, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1114620541} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1114620541, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1114620541|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1114620541} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:44:18,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L750-->L750-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd1~0_In-60555463 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-60555463 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-60555463 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-60555463 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-60555463|)) (and (= |P0Thread1of1ForFork1_#t~ite8_Out-60555463| ~z$r_buff1_thd1~0_In-60555463) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-60555463, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-60555463, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-60555463, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-60555463} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-60555463|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-60555463, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-60555463, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-60555463, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-60555463} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 12:44:18,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L750-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~z$r_buff1_thd1~0_83 |v_P0Thread1of1ForFork1_#t~ite8_40|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_39|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_83, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 12:44:18,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In125823701 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In125823701 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out125823701| 0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out125823701| ~z$w_buff0_used~0_In125823701) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In125823701, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In125823701} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In125823701, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out125823701|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In125823701} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 12:44:18,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-->L768-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-136663262 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In-136663262 256))) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-136663262 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-136663262 256)))) (or (and (= ~z$w_buff1_used~0_In-136663262 |P1Thread1of1ForFork2_#t~ite12_Out-136663262|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork2_#t~ite12_Out-136663262| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-136663262, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-136663262, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-136663262, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-136663262} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-136663262, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-136663262, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-136663262, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-136663262|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-136663262} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 12:44:18,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L769-->L769-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In1402730083 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1402730083 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite13_Out1402730083| ~z$r_buff0_thd2~0_In1402730083) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out1402730083| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1402730083, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1402730083} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1402730083, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1402730083|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1402730083} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 12:44:18,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L770-->L770-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd2~0_In1148049817 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In1148049817 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1148049817 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In1148049817 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out1148049817|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite14_Out1148049817| ~z$r_buff1_thd2~0_In1148049817)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1148049817, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1148049817, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1148049817, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1148049817} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1148049817, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1148049817, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1148049817, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1148049817|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1148049817} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 12:44:18,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L770-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_94 1) v_~__unbuffered_cnt~0_93) (= v_~z$r_buff1_thd2~0_188 |v_P1Thread1of1ForFork2_#t~ite14_50|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_94, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_50|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_188, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_49|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 12:44:18,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L829-1-->L835: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 12:44:18,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L835-2-->L835-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1339521192 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In1339521192 256) 0))) (or (and (= ~z~0_In1339521192 |ULTIMATE.start_main_#t~ite47_Out1339521192|) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite47_Out1339521192| ~z$w_buff1~0_In1339521192) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1339521192, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1339521192, ~z$w_buff1~0=~z$w_buff1~0_In1339521192, ~z~0=~z~0_In1339521192} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1339521192, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1339521192|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1339521192, ~z$w_buff1~0=~z$w_buff1~0_In1339521192, ~z~0=~z~0_In1339521192} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 12:44:18,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L835-4-->L836: Formula: (= v_~z~0_40 |v_ULTIMATE.start_main_#t~ite47_9|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_9|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_8|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|, ~z~0=v_~z~0_40} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2019-12-18 12:44:18,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L836-->L836-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-2134521839 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2134521839 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-2134521839 |ULTIMATE.start_main_#t~ite49_Out-2134521839|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out-2134521839|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2134521839, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2134521839} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2134521839, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2134521839, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-2134521839|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 12:44:18,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L837-->L837-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1380092603 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1380092603 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1380092603 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-1380092603 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1380092603 |ULTIMATE.start_main_#t~ite50_Out-1380092603|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out-1380092603|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1380092603, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1380092603, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1380092603, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1380092603} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1380092603|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1380092603, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1380092603, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1380092603, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1380092603} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 12:44:18,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L838-->L838-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-175367507 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-175367507 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-175367507| ~z$r_buff0_thd0~0_In-175367507)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-175367507| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-175367507, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-175367507} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-175367507, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-175367507|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-175367507} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 12:44:18,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L839-->L839-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1028993432 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1028993432 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1028993432 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1028993432 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite52_Out1028993432| ~z$r_buff1_thd0~0_In1028993432)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite52_Out1028993432| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1028993432, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1028993432, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1028993432, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1028993432} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1028993432|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1028993432, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1028993432, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1028993432, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1028993432} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 12:44:18,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L839-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z$r_buff1_thd0~0_221 |v_ULTIMATE.start_main_#t~ite52_38|) (= 0 v_~__unbuffered_p1_EAX~0_22) (= 1 v_~__unbuffered_p2_EAX~0_21) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~main$tmp_guard1~0_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~__unbuffered_p2_EBX~0_34 0) (= 2 v_~x~0_186)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~x~0=v_~x~0_186} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_37|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_221, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~x~0=v_~x~0_186, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 12:44:18,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:44:18 BasicIcfg [2019-12-18 12:44:18,437 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:44:18,438 INFO L168 Benchmark]: Toolchain (without parser) took 119673.98 ms. Allocated memory was 145.2 MB in the beginning and 3.7 GB in the end (delta: 3.6 GB). Free memory was 101.7 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-18 12:44:18,441 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 12:44:18,442 INFO L168 Benchmark]: CACSL2BoogieTranslator took 864.45 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.3 MB in the beginning and 156.3 MB in the end (delta: -54.9 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-18 12:44:18,442 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.15 ms. Allocated memory is still 202.9 MB. Free memory was 156.3 MB in the beginning and 153.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 12:44:18,442 INFO L168 Benchmark]: Boogie Preprocessor took 66.02 ms. Allocated memory is still 202.9 MB. Free memory was 153.6 MB in the beginning and 151.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 12:44:18,443 INFO L168 Benchmark]: RCFGBuilder took 829.95 ms. Allocated memory is still 202.9 MB. Free memory was 151.0 MB in the beginning and 101.3 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. [2019-12-18 12:44:18,443 INFO L168 Benchmark]: TraceAbstraction took 117838.91 ms. Allocated memory was 202.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 100.6 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-18 12:44:18,449 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.53 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 864.45 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.3 MB in the beginning and 156.3 MB in the end (delta: -54.9 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.15 ms. Allocated memory is still 202.9 MB. Free memory was 156.3 MB in the beginning and 153.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 66.02 ms. Allocated memory is still 202.9 MB. Free memory was 153.6 MB in the beginning and 151.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 829.95 ms. Allocated memory is still 202.9 MB. Free memory was 151.0 MB in the beginning and 101.3 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 117838.91 ms. Allocated memory was 202.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 100.6 MB in the beginning and 1.4 GB in the end (delta: -1.3 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: 5.8s, 176 ProgramPointsBefore, 94 ProgramPointsAfterwards, 213 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 7044 VarBasedMoverChecksPositive, 336 VarBasedMoverChecksNegative, 168 SemBasedMoverChecksPositive, 252 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 130103 CheckedPairsTotal, 120 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L825] FCALL, FORK 0 pthread_create(&t503, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t504, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 2 [L763] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L829] FCALL, FORK 0 pthread_create(&t505, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 [L783] 3 __unbuffered_p2_EAX = y [L786] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 3 z$flush_delayed = weak$$choice2 [L789] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L766] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L791] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L792] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L793] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L796] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L803] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L804] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L805] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L835] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L838] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 117.5s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 46.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7714 SDtfs, 9162 SDslu, 30842 SDs, 0 SdLazy, 22099 SolverSat, 346 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 472 GetRequests, 53 SyntacticMatches, 20 SemanticMatches, 399 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2738 ImplicationChecksByTransitivity, 8.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156115occurred 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: 38.2s AutomataMinimizationTime, 31 MinimizatonAttempts, 267783 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 1419 NumberOfCodeBlocks, 1419 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1322 ConstructedInterpolants, 0 QuantifiedInterpolants, 373572 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...