/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix047_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:24:20,044 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:24:20,050 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:24:20,068 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:24:20,068 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:24:20,070 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:24:20,072 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:24:20,082 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:24:20,086 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:24:20,089 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:24:20,090 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:24:20,092 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:24:20,093 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:24:20,095 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:24:20,097 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:24:20,098 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:24:20,099 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:24:20,100 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:24:20,102 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:24:20,106 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:24:20,111 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:24:20,115 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:24:20,116 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:24:20,117 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:24:20,119 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:24:20,119 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:24:20,120 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:24:20,121 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:24:20,122 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:24:20,123 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:24:20,124 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:24:20,125 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:24:20,126 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:24:20,127 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:24:20,128 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:24:20,129 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:24:20,129 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:24:20,129 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:24:20,130 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:24:20,130 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:24:20,132 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:24:20,133 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 21:24:20,158 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:24:20,158 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:24:20,159 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:24:20,162 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:24:20,162 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:24:20,162 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:24:20,163 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:24:20,163 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:24:20,163 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:24:20,163 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:24:20,163 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:24:20,163 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:24:20,164 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:24:20,164 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:24:20,164 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:24:20,164 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:24:20,164 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:24:20,164 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:24:20,165 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:24:20,165 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:24:20,165 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:24:20,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:24:20,166 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:24:20,166 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:24:20,166 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:24:20,166 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:24:20,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:24:20,167 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:24:20,171 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:24:20,172 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:24:20,172 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:24:20,172 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:24:20,476 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:24:20,490 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:24:20,493 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:24:20,494 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:24:20,495 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:24:20,495 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_tso.oepc.i [2019-12-27 21:24:20,572 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94a92dc81/0d910fbae1a84744a01f1163fe34c0c4/FLAG2f8507599 [2019-12-27 21:24:21,185 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:24:21,185 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_tso.oepc.i [2019-12-27 21:24:21,203 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94a92dc81/0d910fbae1a84744a01f1163fe34c0c4/FLAG2f8507599 [2019-12-27 21:24:21,454 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94a92dc81/0d910fbae1a84744a01f1163fe34c0c4 [2019-12-27 21:24:21,462 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:24:21,464 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:24:21,465 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:24:21,465 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:24:21,469 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:24:21,470 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:24:21" (1/1) ... [2019-12-27 21:24:21,473 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@594f23d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:24:21, skipping insertion in model container [2019-12-27 21:24:21,473 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:24:21" (1/1) ... [2019-12-27 21:24:21,481 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:24:21,549 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:24:22,088 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:24:22,113 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:24:22,232 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:24:22,314 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:24:22,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:24:22 WrapperNode [2019-12-27 21:24:22,315 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:24:22,316 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:24:22,316 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:24:22,316 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:24:22,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:24:22" (1/1) ... [2019-12-27 21:24:22,374 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:24:22" (1/1) ... [2019-12-27 21:24:22,450 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:24:22,450 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:24:22,450 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:24:22,452 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:24:22,464 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:24:22" (1/1) ... [2019-12-27 21:24:22,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:24:22" (1/1) ... [2019-12-27 21:24:22,487 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:24:22" (1/1) ... [2019-12-27 21:24:22,487 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:24:22" (1/1) ... [2019-12-27 21:24:22,508 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:24:22" (1/1) ... [2019-12-27 21:24:22,519 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:24:22" (1/1) ... [2019-12-27 21:24:22,529 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:24:22" (1/1) ... [2019-12-27 21:24:22,542 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:24:22,543 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:24:22,543 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:24:22,543 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:24:22,544 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:24:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:24:22,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:24:22,634 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:24:22,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:24:22,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:24:22,635 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:24:22,635 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:24:22,636 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:24:22,636 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:24:22,636 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 21:24:22,636 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 21:24:22,636 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 21:24:22,637 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 21:24:22,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:24:22,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:24:22,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:24:22,640 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 21:24:23,423 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:24:23,423 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:24:23,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:24:23 BoogieIcfgContainer [2019-12-27 21:24:23,425 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:24:23,426 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:24:23,426 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:24:23,429 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:24:23,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:24:21" (1/3) ... [2019-12-27 21:24:23,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d0f4fe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:24:23, skipping insertion in model container [2019-12-27 21:24:23,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:24:22" (2/3) ... [2019-12-27 21:24:23,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d0f4fe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:24:23, skipping insertion in model container [2019-12-27 21:24:23,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:24:23" (3/3) ... [2019-12-27 21:24:23,432 INFO L109 eAbstractionObserver]: Analyzing ICFG mix047_tso.oepc.i [2019-12-27 21:24:23,442 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:24:23,443 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:24:23,451 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:24:23,452 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:24:23,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,490 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,490 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,491 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,492 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,511 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,511 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,522 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,522 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,523 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,523 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,523 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,523 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,523 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,524 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,524 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,524 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,524 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,525 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,525 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,525 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,525 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,525 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,528 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,528 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,529 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,529 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,530 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,530 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,530 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,530 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,532 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,532 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,533 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,533 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,533 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,533 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,534 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,534 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,534 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,534 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,540 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,540 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,545 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,546 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,556 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,556 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,559 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,559 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,559 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,560 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,560 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,560 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,560 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,560 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,560 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,562 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,562 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,562 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:24:23,578 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 21:24:23,596 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:24:23,597 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:24:23,597 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:24:23,597 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:24:23,597 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:24:23,597 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:24:23,597 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:24:23,597 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:24:23,619 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 208 transitions [2019-12-27 21:24:23,620 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-27 21:24:23,726 INFO L132 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-27 21:24:23,727 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:24:23,741 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 21:24:23,760 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-27 21:24:23,811 INFO L132 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-27 21:24:23,811 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:24:23,818 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 21:24:23,833 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-27 21:24:23,834 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:24:27,499 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 21:24:27,672 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 21:24:27,718 INFO L206 etLargeBlockEncoding]: Checked pairs total: 52826 [2019-12-27 21:24:27,718 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-27 21:24:27,721 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 99 transitions [2019-12-27 21:24:30,365 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 38654 states. [2019-12-27 21:24:30,367 INFO L276 IsEmpty]: Start isEmpty. Operand 38654 states. [2019-12-27 21:24:30,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 21:24:30,377 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:24:30,378 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:24:30,378 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:24:30,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:24:30,383 INFO L82 PathProgramCache]: Analyzing trace with hash -313660218, now seen corresponding path program 1 times [2019-12-27 21:24:30,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:24:30,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899171921] [2019-12-27 21:24:30,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:24:30,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:24:30,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:24:30,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899171921] [2019-12-27 21:24:30,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:24:30,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:24:30,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1482619401] [2019-12-27 21:24:30,658 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:24:30,664 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:24:30,676 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 21:24:30,677 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:24:30,680 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:24:30,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:24:30,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:24:30,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:24:30,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:24:30,692 INFO L87 Difference]: Start difference. First operand 38654 states. Second operand 3 states. [2019-12-27 21:24:32,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:24:32,365 INFO L93 Difference]: Finished difference Result 36046 states and 153176 transitions. [2019-12-27 21:24:32,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:24:32,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 21:24:32,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:24:32,823 INFO L225 Difference]: With dead ends: 36046 [2019-12-27 21:24:32,823 INFO L226 Difference]: Without dead ends: 35318 [2019-12-27 21:24:32,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:24:33,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35318 states. [2019-12-27 21:24:34,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35318 to 35318. [2019-12-27 21:24:34,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35318 states. [2019-12-27 21:24:35,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35318 states to 35318 states and 150208 transitions. [2019-12-27 21:24:35,053 INFO L78 Accepts]: Start accepts. Automaton has 35318 states and 150208 transitions. Word has length 9 [2019-12-27 21:24:35,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:24:35,054 INFO L462 AbstractCegarLoop]: Abstraction has 35318 states and 150208 transitions. [2019-12-27 21:24:35,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:24:35,054 INFO L276 IsEmpty]: Start isEmpty. Operand 35318 states and 150208 transitions. [2019-12-27 21:24:35,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 21:24:35,067 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:24:35,068 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:24:35,068 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:24:35,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:24:35,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1224255535, now seen corresponding path program 1 times [2019-12-27 21:24:35,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:24:35,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314766738] [2019-12-27 21:24:35,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:24:35,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:24:35,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:24:35,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314766738] [2019-12-27 21:24:35,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:24:35,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:24:35,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1152001976] [2019-12-27 21:24:35,183 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:24:35,185 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:24:35,192 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 39 transitions. [2019-12-27 21:24:35,193 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:24:35,234 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:24:35,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:24:35,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:24:35,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:24:35,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:24:35,237 INFO L87 Difference]: Start difference. First operand 35318 states and 150208 transitions. Second operand 5 states. [2019-12-27 21:24:37,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:24:37,928 INFO L93 Difference]: Finished difference Result 54990 states and 226052 transitions. [2019-12-27 21:24:37,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:24:37,928 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-12-27 21:24:37,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:24:38,222 INFO L225 Difference]: With dead ends: 54990 [2019-12-27 21:24:38,222 INFO L226 Difference]: Without dead ends: 54962 [2019-12-27 21:24:38,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:24:38,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54962 states. [2019-12-27 21:24:39,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54962 to 50002. [2019-12-27 21:24:39,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50002 states. [2019-12-27 21:24:40,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50002 states to 50002 states and 207548 transitions. [2019-12-27 21:24:40,479 INFO L78 Accepts]: Start accepts. Automaton has 50002 states and 207548 transitions. Word has length 15 [2019-12-27 21:24:40,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:24:40,480 INFO L462 AbstractCegarLoop]: Abstraction has 50002 states and 207548 transitions. [2019-12-27 21:24:40,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:24:40,480 INFO L276 IsEmpty]: Start isEmpty. Operand 50002 states and 207548 transitions. [2019-12-27 21:24:40,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 21:24:40,483 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:24:40,483 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:24:40,484 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:24:40,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:24:40,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1764776836, now seen corresponding path program 1 times [2019-12-27 21:24:40,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:24:40,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72117109] [2019-12-27 21:24:40,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:24:40,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:24:40,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:24:40,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72117109] [2019-12-27 21:24:40,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:24:40,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:24:40,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [667452614] [2019-12-27 21:24:40,542 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:24:40,544 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:24:40,546 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 21:24:40,546 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:24:40,546 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:24:40,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:24:40,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:24:40,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:24:40,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:24:40,548 INFO L87 Difference]: Start difference. First operand 50002 states and 207548 transitions. Second operand 3 states. [2019-12-27 21:24:40,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:24:40,747 INFO L93 Difference]: Finished difference Result 39218 states and 150397 transitions. [2019-12-27 21:24:40,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:24:40,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 21:24:40,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:24:40,908 INFO L225 Difference]: With dead ends: 39218 [2019-12-27 21:24:40,909 INFO L226 Difference]: Without dead ends: 39218 [2019-12-27 21:24:40,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:24:41,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39218 states. [2019-12-27 21:24:43,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39218 to 39218. [2019-12-27 21:24:43,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39218 states. [2019-12-27 21:24:44,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39218 states to 39218 states and 150397 transitions. [2019-12-27 21:24:44,043 INFO L78 Accepts]: Start accepts. Automaton has 39218 states and 150397 transitions. Word has length 15 [2019-12-27 21:24:44,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:24:44,044 INFO L462 AbstractCegarLoop]: Abstraction has 39218 states and 150397 transitions. [2019-12-27 21:24:44,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:24:44,044 INFO L276 IsEmpty]: Start isEmpty. Operand 39218 states and 150397 transitions. [2019-12-27 21:24:44,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:24:44,048 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:24:44,048 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:24:44,048 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:24:44,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:24:44,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1883411785, now seen corresponding path program 1 times [2019-12-27 21:24:44,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:24:44,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456759487] [2019-12-27 21:24:44,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:24:44,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:24:44,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:24:44,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456759487] [2019-12-27 21:24:44,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:24:44,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:24:44,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1614641717] [2019-12-27 21:24:44,131 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:24:44,132 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:24:44,135 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 28 transitions. [2019-12-27 21:24:44,136 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:24:44,153 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:24:44,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:24:44,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:24:44,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:24:44,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:24:44,154 INFO L87 Difference]: Start difference. First operand 39218 states and 150397 transitions. Second operand 5 states. [2019-12-27 21:24:44,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:24:44,540 INFO L93 Difference]: Finished difference Result 16304 states and 51852 transitions. [2019-12-27 21:24:44,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:24:44,541 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 21:24:44,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:24:44,591 INFO L225 Difference]: With dead ends: 16304 [2019-12-27 21:24:44,591 INFO L226 Difference]: Without dead ends: 16304 [2019-12-27 21:24:44,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:24:44,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16304 states. [2019-12-27 21:24:44,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16304 to 16304. [2019-12-27 21:24:44,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16304 states. [2019-12-27 21:24:44,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16304 states to 16304 states and 51852 transitions. [2019-12-27 21:24:44,961 INFO L78 Accepts]: Start accepts. Automaton has 16304 states and 51852 transitions. Word has length 16 [2019-12-27 21:24:44,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:24:44,961 INFO L462 AbstractCegarLoop]: Abstraction has 16304 states and 51852 transitions. [2019-12-27 21:24:44,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:24:44,961 INFO L276 IsEmpty]: Start isEmpty. Operand 16304 states and 51852 transitions. [2019-12-27 21:24:44,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 21:24:44,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:24:44,964 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:24:44,964 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:24:44,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:24:44,964 INFO L82 PathProgramCache]: Analyzing trace with hash 471912602, now seen corresponding path program 1 times [2019-12-27 21:24:44,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:24:44,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464302943] [2019-12-27 21:24:44,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:24:45,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:24:45,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:24:45,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464302943] [2019-12-27 21:24:45,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:24:45,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:24:45,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1335773993] [2019-12-27 21:24:45,067 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:24:45,069 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:24:45,072 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 37 transitions. [2019-12-27 21:24:45,072 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:24:45,089 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:24:45,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:24:45,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:24:45,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:24:45,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:24:45,090 INFO L87 Difference]: Start difference. First operand 16304 states and 51852 transitions. Second operand 6 states. [2019-12-27 21:24:45,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:24:45,142 INFO L93 Difference]: Finished difference Result 2786 states and 7200 transitions. [2019-12-27 21:24:45,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:24:45,143 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-27 21:24:45,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:24:45,147 INFO L225 Difference]: With dead ends: 2786 [2019-12-27 21:24:45,147 INFO L226 Difference]: Without dead ends: 2786 [2019-12-27 21:24:45,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:24:45,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2786 states. [2019-12-27 21:24:45,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2786 to 2786. [2019-12-27 21:24:45,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2786 states. [2019-12-27 21:24:45,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2786 states to 2786 states and 7200 transitions. [2019-12-27 21:24:45,188 INFO L78 Accepts]: Start accepts. Automaton has 2786 states and 7200 transitions. Word has length 17 [2019-12-27 21:24:45,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:24:45,189 INFO L462 AbstractCegarLoop]: Abstraction has 2786 states and 7200 transitions. [2019-12-27 21:24:45,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:24:45,189 INFO L276 IsEmpty]: Start isEmpty. Operand 2786 states and 7200 transitions. [2019-12-27 21:24:45,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 21:24:45,193 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:24:45,194 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] [2019-12-27 21:24:45,194 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:24:45,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:24:45,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1539396208, now seen corresponding path program 1 times [2019-12-27 21:24:45,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:24:45,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392731625] [2019-12-27 21:24:45,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:24:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:24:45,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:24:45,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392731625] [2019-12-27 21:24:45,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:24:45,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:24:45,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1032268244] [2019-12-27 21:24:45,296 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:24:45,301 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:24:45,332 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 273 transitions. [2019-12-27 21:24:45,332 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:24:45,378 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:24:45,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:24:45,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:24:45,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:24:45,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:24:45,380 INFO L87 Difference]: Start difference. First operand 2786 states and 7200 transitions. Second operand 8 states. [2019-12-27 21:24:45,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:24:45,454 INFO L93 Difference]: Finished difference Result 1356 states and 3887 transitions. [2019-12-27 21:24:45,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:24:45,458 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-12-27 21:24:45,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:24:45,460 INFO L225 Difference]: With dead ends: 1356 [2019-12-27 21:24:45,461 INFO L226 Difference]: Without dead ends: 1356 [2019-12-27 21:24:45,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:24:45,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2019-12-27 21:24:45,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1216. [2019-12-27 21:24:45,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1216 states. [2019-12-27 21:24:45,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 3487 transitions. [2019-12-27 21:24:45,481 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 3487 transitions. Word has length 29 [2019-12-27 21:24:45,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:24:45,482 INFO L462 AbstractCegarLoop]: Abstraction has 1216 states and 3487 transitions. [2019-12-27 21:24:45,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:24:45,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 3487 transitions. [2019-12-27 21:24:45,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:24:45,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:24:45,489 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] [2019-12-27 21:24:45,489 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:24:45,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:24:45,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1329665717, now seen corresponding path program 1 times [2019-12-27 21:24:45,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:24:45,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232339764] [2019-12-27 21:24:45,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:24:45,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:24:45,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:24:45,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232339764] [2019-12-27 21:24:45,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:24:45,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:24:45,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1538813131] [2019-12-27 21:24:45,665 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:24:45,685 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:24:45,788 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 210 transitions. [2019-12-27 21:24:45,788 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:24:45,789 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:24:45,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:24:45,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:24:45,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:24:45,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:24:45,790 INFO L87 Difference]: Start difference. First operand 1216 states and 3487 transitions. Second operand 3 states. [2019-12-27 21:24:45,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:24:45,837 INFO L93 Difference]: Finished difference Result 1224 states and 3495 transitions. [2019-12-27 21:24:45,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:24:45,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 21:24:45,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:24:45,842 INFO L225 Difference]: With dead ends: 1224 [2019-12-27 21:24:45,842 INFO L226 Difference]: Without dead ends: 1224 [2019-12-27 21:24:45,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:24:45,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2019-12-27 21:24:46,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1219. [2019-12-27 21:24:46,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1219 states. [2019-12-27 21:24:46,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 3490 transitions. [2019-12-27 21:24:46,294 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 3490 transitions. Word has length 58 [2019-12-27 21:24:46,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:24:46,294 INFO L462 AbstractCegarLoop]: Abstraction has 1219 states and 3490 transitions. [2019-12-27 21:24:46,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:24:46,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 3490 transitions. [2019-12-27 21:24:46,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:24:46,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:24:46,300 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] [2019-12-27 21:24:46,300 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:24:46,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:24:46,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1606563127, now seen corresponding path program 1 times [2019-12-27 21:24:46,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:24:46,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929283827] [2019-12-27 21:24:46,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:24:46,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:24:46,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:24:46,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929283827] [2019-12-27 21:24:46,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:24:46,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:24:46,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [873397732] [2019-12-27 21:24:46,426 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:24:46,444 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:24:46,544 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 210 transitions. [2019-12-27 21:24:46,545 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:24:46,549 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:24:46,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:24:46,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:24:46,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:24:46,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:24:46,551 INFO L87 Difference]: Start difference. First operand 1219 states and 3490 transitions. Second operand 5 states. [2019-12-27 21:24:46,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:24:46,791 INFO L93 Difference]: Finished difference Result 1760 states and 5012 transitions. [2019-12-27 21:24:46,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:24:46,791 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-27 21:24:46,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:24:46,795 INFO L225 Difference]: With dead ends: 1760 [2019-12-27 21:24:46,795 INFO L226 Difference]: Without dead ends: 1760 [2019-12-27 21:24:46,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:24:46,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2019-12-27 21:24:46,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1415. [2019-12-27 21:24:46,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1415 states. [2019-12-27 21:24:46,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 4066 transitions. [2019-12-27 21:24:46,822 INFO L78 Accepts]: Start accepts. Automaton has 1415 states and 4066 transitions. Word has length 58 [2019-12-27 21:24:46,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:24:46,822 INFO L462 AbstractCegarLoop]: Abstraction has 1415 states and 4066 transitions. [2019-12-27 21:24:46,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:24:46,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 4066 transitions. [2019-12-27 21:24:46,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:24:46,826 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:24:46,826 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] [2019-12-27 21:24:46,826 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:24:46,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:24:46,827 INFO L82 PathProgramCache]: Analyzing trace with hash 595510245, now seen corresponding path program 2 times [2019-12-27 21:24:46,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:24:46,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598708294] [2019-12-27 21:24:46,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:24:46,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:24:46,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:24:46,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598708294] [2019-12-27 21:24:46,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:24:46,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:24:46,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [590758139] [2019-12-27 21:24:46,939 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:24:46,957 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:24:47,063 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 158 states and 231 transitions. [2019-12-27 21:24:47,064 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:24:47,161 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 21:24:47,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:24:47,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:24:47,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:24:47,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:24:47,163 INFO L87 Difference]: Start difference. First operand 1415 states and 4066 transitions. Second operand 10 states. [2019-12-27 21:24:48,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:24:48,581 INFO L93 Difference]: Finished difference Result 3057 states and 8420 transitions. [2019-12-27 21:24:48,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 21:24:48,584 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-12-27 21:24:48,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:24:48,591 INFO L225 Difference]: With dead ends: 3057 [2019-12-27 21:24:48,591 INFO L226 Difference]: Without dead ends: 3057 [2019-12-27 21:24:48,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2019-12-27 21:24:48,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3057 states. [2019-12-27 21:24:48,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3057 to 1499. [2019-12-27 21:24:48,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1499 states. [2019-12-27 21:24:48,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 4314 transitions. [2019-12-27 21:24:48,629 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 4314 transitions. Word has length 58 [2019-12-27 21:24:48,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:24:48,629 INFO L462 AbstractCegarLoop]: Abstraction has 1499 states and 4314 transitions. [2019-12-27 21:24:48,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:24:48,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 4314 transitions. [2019-12-27 21:24:48,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:24:48,634 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:24:48,634 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] [2019-12-27 21:24:48,634 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:24:48,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:24:48,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1233712533, now seen corresponding path program 3 times [2019-12-27 21:24:48,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:24:48,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936853535] [2019-12-27 21:24:48,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:24:48,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:24:48,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:24:48,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936853535] [2019-12-27 21:24:48,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:24:48,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:24:48,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1798651948] [2019-12-27 21:24:48,788 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:24:48,806 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:24:48,881 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 138 states and 204 transitions. [2019-12-27 21:24:48,881 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:24:48,885 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:24:48,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:24:48,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:24:48,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:24:48,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:24:48,886 INFO L87 Difference]: Start difference. First operand 1499 states and 4314 transitions. Second operand 6 states. [2019-12-27 21:24:49,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:24:49,230 INFO L93 Difference]: Finished difference Result 2373 states and 6750 transitions. [2019-12-27 21:24:49,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 21:24:49,231 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-27 21:24:49,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:24:49,235 INFO L225 Difference]: With dead ends: 2373 [2019-12-27 21:24:49,235 INFO L226 Difference]: Without dead ends: 2373 [2019-12-27 21:24:49,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:24:49,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2019-12-27 21:24:49,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 1687. [2019-12-27 21:24:49,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1687 states. [2019-12-27 21:24:49,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1687 states to 1687 states and 4858 transitions. [2019-12-27 21:24:49,262 INFO L78 Accepts]: Start accepts. Automaton has 1687 states and 4858 transitions. Word has length 58 [2019-12-27 21:24:49,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:24:49,263 INFO L462 AbstractCegarLoop]: Abstraction has 1687 states and 4858 transitions. [2019-12-27 21:24:49,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:24:49,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 4858 transitions. [2019-12-27 21:24:49,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:24:49,267 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:24:49,267 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] [2019-12-27 21:24:49,267 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:24:49,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:24:49,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1959735343, now seen corresponding path program 4 times [2019-12-27 21:24:49,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:24:49,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451481808] [2019-12-27 21:24:49,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:24:49,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:24:49,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:24:49,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451481808] [2019-12-27 21:24:49,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:24:49,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 21:24:49,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1926806676] [2019-12-27 21:24:49,407 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:24:49,425 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:24:49,506 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 156 states and 239 transitions. [2019-12-27 21:24:49,506 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:24:49,625 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 21:24:49,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 21:24:49,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:24:49,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 21:24:49,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:24:49,626 INFO L87 Difference]: Start difference. First operand 1687 states and 4858 transitions. Second operand 11 states. [2019-12-27 21:24:50,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:24:50,949 INFO L93 Difference]: Finished difference Result 3418 states and 9410 transitions. [2019-12-27 21:24:50,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 21:24:50,955 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-12-27 21:24:50,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:24:50,961 INFO L225 Difference]: With dead ends: 3418 [2019-12-27 21:24:50,961 INFO L226 Difference]: Without dead ends: 3418 [2019-12-27 21:24:50,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=164, Invalid=436, Unknown=0, NotChecked=0, Total=600 [2019-12-27 21:24:50,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3418 states. [2019-12-27 21:24:51,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3418 to 1603. [2019-12-27 21:24:51,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1603 states. [2019-12-27 21:24:51,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 4610 transitions. [2019-12-27 21:24:51,009 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 4610 transitions. Word has length 58 [2019-12-27 21:24:51,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:24:51,010 INFO L462 AbstractCegarLoop]: Abstraction has 1603 states and 4610 transitions. [2019-12-27 21:24:51,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 21:24:51,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 4610 transitions. [2019-12-27 21:24:51,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 21:24:51,015 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:24:51,015 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] [2019-12-27 21:24:51,015 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:24:51,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:24:51,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1379010492, now seen corresponding path program 1 times [2019-12-27 21:24:51,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:24:51,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932028444] [2019-12-27 21:24:51,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:24:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:24:51,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:24:51,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932028444] [2019-12-27 21:24:51,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:24:51,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:24:51,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [920375662] [2019-12-27 21:24:51,120 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:24:51,138 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:24:51,243 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 135 states and 179 transitions. [2019-12-27 21:24:51,243 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:24:51,244 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:24:51,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:24:51,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:24:51,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:24:51,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:24:51,245 INFO L87 Difference]: Start difference. First operand 1603 states and 4610 transitions. Second operand 3 states. [2019-12-27 21:24:51,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:24:51,307 INFO L93 Difference]: Finished difference Result 1603 states and 4609 transitions. [2019-12-27 21:24:51,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:24:51,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-27 21:24:51,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:24:51,311 INFO L225 Difference]: With dead ends: 1603 [2019-12-27 21:24:51,311 INFO L226 Difference]: Without dead ends: 1603 [2019-12-27 21:24:51,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:24:51,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2019-12-27 21:24:51,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1078. [2019-12-27 21:24:51,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1078 states. [2019-12-27 21:24:51,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 3127 transitions. [2019-12-27 21:24:51,332 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 3127 transitions. Word has length 59 [2019-12-27 21:24:51,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:24:51,333 INFO L462 AbstractCegarLoop]: Abstraction has 1078 states and 3127 transitions. [2019-12-27 21:24:51,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:24:51,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 3127 transitions. [2019-12-27 21:24:51,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 21:24:51,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:24:51,336 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] [2019-12-27 21:24:51,336 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:24:51,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:24:51,336 INFO L82 PathProgramCache]: Analyzing trace with hash 2055576731, now seen corresponding path program 1 times [2019-12-27 21:24:51,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:24:51,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944044297] [2019-12-27 21:24:51,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:24:51,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:24:51,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:24:51,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944044297] [2019-12-27 21:24:51,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:24:51,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:24:51,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1671122413] [2019-12-27 21:24:51,485 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:24:51,503 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:24:51,619 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 143 states and 207 transitions. [2019-12-27 21:24:51,620 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:24:51,653 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:24:51,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:24:51,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:24:51,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:24:51,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:24:51,655 INFO L87 Difference]: Start difference. First operand 1078 states and 3127 transitions. Second operand 8 states. [2019-12-27 21:24:51,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:24:51,831 INFO L93 Difference]: Finished difference Result 2240 states and 6163 transitions. [2019-12-27 21:24:51,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 21:24:51,832 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2019-12-27 21:24:51,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:24:51,835 INFO L225 Difference]: With dead ends: 2240 [2019-12-27 21:24:51,835 INFO L226 Difference]: Without dead ends: 1591 [2019-12-27 21:24:51,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:24:51,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2019-12-27 21:24:51,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 948. [2019-12-27 21:24:51,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2019-12-27 21:24:51,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 2687 transitions. [2019-12-27 21:24:51,864 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 2687 transitions. Word has length 59 [2019-12-27 21:24:51,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:24:51,865 INFO L462 AbstractCegarLoop]: Abstraction has 948 states and 2687 transitions. [2019-12-27 21:24:51,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:24:51,865 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 2687 transitions. [2019-12-27 21:24:51,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 21:24:51,869 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:24:51,869 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] [2019-12-27 21:24:51,869 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:24:51,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:24:51,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1719937123, now seen corresponding path program 2 times [2019-12-27 21:24:51,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:24:51,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362224388] [2019-12-27 21:24:51,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:24:51,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:24:52,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:24:52,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362224388] [2019-12-27 21:24:52,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:24:52,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:24:52,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [100478732] [2019-12-27 21:24:52,071 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:24:52,092 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:24:52,216 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 160 states and 248 transitions. [2019-12-27 21:24:52,216 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:24:52,244 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:24:52,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:24:52,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:24:52,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:24:52,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:24:52,245 INFO L87 Difference]: Start difference. First operand 948 states and 2687 transitions. Second operand 7 states. [2019-12-27 21:24:52,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:24:52,490 INFO L93 Difference]: Finished difference Result 2041 states and 5357 transitions. [2019-12-27 21:24:52,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 21:24:52,490 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-12-27 21:24:52,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:24:52,493 INFO L225 Difference]: With dead ends: 2041 [2019-12-27 21:24:52,493 INFO L226 Difference]: Without dead ends: 1153 [2019-12-27 21:24:52,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:24:52,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2019-12-27 21:24:52,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 691. [2019-12-27 21:24:52,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2019-12-27 21:24:52,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1728 transitions. [2019-12-27 21:24:52,505 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1728 transitions. Word has length 59 [2019-12-27 21:24:52,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:24:52,505 INFO L462 AbstractCegarLoop]: Abstraction has 691 states and 1728 transitions. [2019-12-27 21:24:52,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:24:52,505 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1728 transitions. [2019-12-27 21:24:52,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 21:24:52,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:24:52,507 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] [2019-12-27 21:24:52,507 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:24:52,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:24:52,508 INFO L82 PathProgramCache]: Analyzing trace with hash -5405835, now seen corresponding path program 3 times [2019-12-27 21:24:52,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:24:52,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323780272] [2019-12-27 21:24:52,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:24:52,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:24:52,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:24:52,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323780272] [2019-12-27 21:24:52,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:24:52,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:24:52,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1365487009] [2019-12-27 21:24:52,657 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:24:52,683 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:24:52,823 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 147 states and 246 transitions. [2019-12-27 21:24:52,823 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:24:52,848 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:24:52,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:24:52,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:24:52,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:24:52,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:24:52,850 INFO L87 Difference]: Start difference. First operand 691 states and 1728 transitions. Second operand 7 states. [2019-12-27 21:24:53,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:24:53,139 INFO L93 Difference]: Finished difference Result 1534 states and 3822 transitions. [2019-12-27 21:24:53,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 21:24:53,139 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-12-27 21:24:53,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:24:53,140 INFO L225 Difference]: With dead ends: 1534 [2019-12-27 21:24:53,140 INFO L226 Difference]: Without dead ends: 442 [2019-12-27 21:24:53,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:24:53,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2019-12-27 21:24:53,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 287. [2019-12-27 21:24:53,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-12-27 21:24:53,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 530 transitions. [2019-12-27 21:24:53,148 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 530 transitions. Word has length 59 [2019-12-27 21:24:53,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:24:53,148 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 530 transitions. [2019-12-27 21:24:53,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:24:53,148 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 530 transitions. [2019-12-27 21:24:53,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 21:24:53,149 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:24:53,149 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:24:53,149 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:24:53,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:24:53,150 INFO L82 PathProgramCache]: Analyzing trace with hash -2094447461, now seen corresponding path program 4 times [2019-12-27 21:24:53,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:24:53,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055261076] [2019-12-27 21:24:53,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:24:53,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:24:53,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:24:53,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055261076] [2019-12-27 21:24:53,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:24:53,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:24:53,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1108138496] [2019-12-27 21:24:53,238 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:24:53,257 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:24:53,376 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 147 states and 222 transitions. [2019-12-27 21:24:53,376 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:24:53,389 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:24:53,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:24:53,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:24:53,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:24:53,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:24:53,391 INFO L87 Difference]: Start difference. First operand 287 states and 530 transitions. Second operand 4 states. [2019-12-27 21:24:53,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:24:53,495 INFO L93 Difference]: Finished difference Result 328 states and 579 transitions. [2019-12-27 21:24:53,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:24:53,495 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-27 21:24:53,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:24:53,496 INFO L225 Difference]: With dead ends: 328 [2019-12-27 21:24:53,496 INFO L226 Difference]: Without dead ends: 328 [2019-12-27 21:24:53,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:24:53,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-12-27 21:24:53,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 234. [2019-12-27 21:24:53,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-27 21:24:53,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 413 transitions. [2019-12-27 21:24:53,500 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 413 transitions. Word has length 59 [2019-12-27 21:24:53,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:24:53,501 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 413 transitions. [2019-12-27 21:24:53,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:24:53,501 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 413 transitions. [2019-12-27 21:24:53,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 21:24:53,502 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:24:53,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:24:53,502 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:24:53,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:24:53,502 INFO L82 PathProgramCache]: Analyzing trace with hash 91372008, now seen corresponding path program 1 times [2019-12-27 21:24:53,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:24:53,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886025320] [2019-12-27 21:24:53,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:24:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:24:53,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:24:53,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886025320] [2019-12-27 21:24:53,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:24:53,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 21:24:53,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [661322772] [2019-12-27 21:24:53,841 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:24:53,858 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:24:54,002 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 167 states and 258 transitions. [2019-12-27 21:24:54,002 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:24:54,109 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:24:54,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 21:24:54,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:24:54,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 21:24:54,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-27 21:24:54,111 INFO L87 Difference]: Start difference. First operand 234 states and 413 transitions. Second operand 16 states. [2019-12-27 21:24:55,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:24:55,733 INFO L93 Difference]: Finished difference Result 518 states and 889 transitions. [2019-12-27 21:24:55,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 21:24:55,734 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 60 [2019-12-27 21:24:55,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:24:55,735 INFO L225 Difference]: With dead ends: 518 [2019-12-27 21:24:55,735 INFO L226 Difference]: Without dead ends: 488 [2019-12-27 21:24:55,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=231, Invalid=1029, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 21:24:55,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-12-27 21:24:55,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 330. [2019-12-27 21:24:55,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-12-27 21:24:55,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 577 transitions. [2019-12-27 21:24:55,741 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 577 transitions. Word has length 60 [2019-12-27 21:24:55,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:24:55,742 INFO L462 AbstractCegarLoop]: Abstraction has 330 states and 577 transitions. [2019-12-27 21:24:55,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 21:24:55,742 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 577 transitions. [2019-12-27 21:24:55,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 21:24:55,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:24:55,743 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] [2019-12-27 21:24:55,743 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:24:55,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:24:55,743 INFO L82 PathProgramCache]: Analyzing trace with hash 2137491580, now seen corresponding path program 2 times [2019-12-27 21:24:55,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:24:55,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577157567] [2019-12-27 21:24:55,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:24:55,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:24:56,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:24:56,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577157567] [2019-12-27 21:24:56,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:24:56,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 21:24:56,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1478726078] [2019-12-27 21:24:56,024 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:24:56,041 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:24:56,228 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 321 transitions. [2019-12-27 21:24:56,229 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:24:56,375 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:24:56,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 21:24:56,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:24:56,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 21:24:56,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-12-27 21:24:56,377 INFO L87 Difference]: Start difference. First operand 330 states and 577 transitions. Second operand 15 states. [2019-12-27 21:24:56,546 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-12-27 21:24:58,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:24:58,550 INFO L93 Difference]: Finished difference Result 590 states and 995 transitions. [2019-12-27 21:24:58,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 21:24:58,551 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 60 [2019-12-27 21:24:58,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:24:58,552 INFO L225 Difference]: With dead ends: 590 [2019-12-27 21:24:58,552 INFO L226 Difference]: Without dead ends: 560 [2019-12-27 21:24:58,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=265, Invalid=1141, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 21:24:58,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-12-27 21:24:58,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 342. [2019-12-27 21:24:58,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-12-27 21:24:58,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 598 transitions. [2019-12-27 21:24:58,558 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 598 transitions. Word has length 60 [2019-12-27 21:24:58,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:24:58,559 INFO L462 AbstractCegarLoop]: Abstraction has 342 states and 598 transitions. [2019-12-27 21:24:58,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 21:24:58,559 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 598 transitions. [2019-12-27 21:24:58,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 21:24:58,560 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:24:58,560 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] [2019-12-27 21:24:58,560 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:24:58,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:24:58,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1093452108, now seen corresponding path program 3 times [2019-12-27 21:24:58,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:24:58,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733385869] [2019-12-27 21:24:58,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:24:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:24:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:24:58,710 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:24:58,710 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:24:58,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_73| 0 0))) (and (= v_~z$r_buff0_thd0~0_78 0) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~z$w_buff1~0_25) (= 0 v_~weak$$choice0~0_8) (= v_~z$r_buff1_thd2~0_8 0) (= v_~x~0_14 0) (= 0 v_~a~0_8) (= 0 v_~__unbuffered_p3_EBX~0_11) (= v_~z$r_buff0_thd3~0_20 0) (= v_~z$w_buff0_used~0_104 0) (= v_~z$mem_tmp~0_11 0) (= |v_#NULL.offset_6| 0) (= v_~z$r_buff0_thd1~0_8 0) (= v_~z$r_buff1_thd1~0_8 0) (= 0 v_~__unbuffered_p3_EAX~0_11) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1273~0.base_21|) (= 0 v_~z$r_buff1_thd4~0_15) (= 0 v_~weak$$choice2~0_34) (= v_~z$read_delayed~0_5 0) (= v_~z$read_delayed_var~0.base_5 0) (= 0 v_~z$r_buff1_thd0~0_51) (= (select .cse0 |v_ULTIMATE.start_main_~#t1273~0.base_21|) 0) (= 0 v_~__unbuffered_cnt~0_26) (= 0 v_~z$flush_delayed~0_16) (= v_~z$r_buff0_thd4~0_26 0) (= v_~z$read_delayed_var~0.offset_5 0) (= 0 |v_#NULL.base_6|) (= |v_ULTIMATE.start_main_~#t1273~0.offset_17| 0) (= 0 v_~z$r_buff1_thd3~0_15) (< 0 |v_#StackHeapBarrier_20|) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1273~0.base_21| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1273~0.base_21|) |v_ULTIMATE.start_main_~#t1273~0.offset_17| 0)) |v_#memory_int_23|) (= v_~z~0_27 0) (= v_~z$r_buff0_thd2~0_9 0) (= |v_#valid_71| (store .cse0 |v_ULTIMATE.start_main_~#t1273~0.base_21| 1)) (= 0 v_~z$w_buff0~0_26) (= v_~y~0_11 0) (= v_~main$tmp_guard1~0_13 0) (= v_~b~0_12 0) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t1273~0.base_21| 4)) (= 0 v_~z$w_buff1_used~0_66))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_24|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_~#t1274~0.base=|v_ULTIMATE.start_main_~#t1274~0.base_23|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_12|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_8, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_10|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_15|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1273~0.offset=|v_ULTIMATE.start_main_~#t1273~0.offset_17|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_12|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_17|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_15|, ~a~0=v_~a~0_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_78, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_26, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_11, #length=|v_#length_29|, ULTIMATE.start_main_~#t1276~0.offset=|v_ULTIMATE.start_main_~#t1276~0.offset_18|, ~z$mem_tmp~0=v_~z$mem_tmp~0_11, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_15|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_66, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_12|, ULTIMATE.start_main_~#t1275~0.base=|v_ULTIMATE.start_main_~#t1275~0.base_22|, ~z$flush_delayed~0=v_~z$flush_delayed~0_16, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_16|, ULTIMATE.start_main_~#t1275~0.offset=|v_ULTIMATE.start_main_~#t1275~0.offset_18|, ULTIMATE.start_main_~#t1274~0.offset=|v_ULTIMATE.start_main_~#t1274~0.offset_18|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_8, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_5, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_20, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_8|, ULTIMATE.start_main_~#t1276~0.base=|v_ULTIMATE.start_main_~#t1276~0.base_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~x~0=v_~x~0_14, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_15, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_12|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_14|, ~z$w_buff1~0=v_~z$w_buff1~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_12|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_5, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_16|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_10|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_13|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_14|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_51, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_8|, ~y~0=v_~y~0_11, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_9, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~z$w_buff0~0=v_~z$w_buff0~0_26, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_12|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_15, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_13|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_11, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ~b~0=v_~b~0_12, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ULTIMATE.start_main_~#t1273~0.base=|v_ULTIMATE.start_main_~#t1273~0.base_21|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_8|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1274~0.base, ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_~#t1273~0.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_~#t1276~0.offset, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t1275~0.base, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_~#t1275~0.offset, ULTIMATE.start_main_~#t1274~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_~#t1276~0.base, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1273~0.base, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:24:58,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L831-1-->L833: Formula: (and (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1274~0.base_13| 4)) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1274~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1274~0.base_13|) |v_ULTIMATE.start_main_~#t1274~0.offset_11| 1))) (= |v_ULTIMATE.start_main_~#t1274~0.offset_11| 0) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1274~0.base_13| 1)) (= 0 (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1274~0.base_13|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1274~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t1274~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1274~0.offset=|v_ULTIMATE.start_main_~#t1274~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t1274~0.base=|v_ULTIMATE.start_main_~#t1274~0.base_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1274~0.offset, ULTIMATE.start_main_~#t1274~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-27 21:24:58,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L833-1-->L835: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1275~0.base_11| 0)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1275~0.base_11| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1275~0.base_11|) (= |v_ULTIMATE.start_main_~#t1275~0.offset_10| 0) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1275~0.base_11|) 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1275~0.base_11| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1275~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1275~0.base_11|) |v_ULTIMATE.start_main_~#t1275~0.offset_10| 2)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1275~0.base=|v_ULTIMATE.start_main_~#t1275~0.base_11|, ULTIMATE.start_main_~#t1275~0.offset=|v_ULTIMATE.start_main_~#t1275~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1275~0.base, ULTIMATE.start_main_~#t1275~0.offset] because there is no mapped edge [2019-12-27 21:24:58,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L835-1-->L837: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1276~0.base_13|)) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1276~0.base_13| 1) |v_#valid_46|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1276~0.base_13|) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1276~0.base_13|) 0) (= |v_ULTIMATE.start_main_~#t1276~0.offset_11| 0) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1276~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1276~0.base_13|) |v_ULTIMATE.start_main_~#t1276~0.offset_11| 3))) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1276~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1276~0.base=|v_ULTIMATE.start_main_~#t1276~0.base_13|, #length=|v_#length_23|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, ULTIMATE.start_main_~#t1276~0.offset=|v_ULTIMATE.start_main_~#t1276~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t1276~0.base, #length, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_~#t1276~0.offset] because there is no mapped edge [2019-12-27 21:24:58,720 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L4-->L808: Formula: (and (= v_~z$r_buff0_thd3~0_14 v_~z$r_buff1_thd3~0_10) (= v_~z$r_buff0_thd0~0_61 v_~z$r_buff1_thd0~0_39) (= v_~z$r_buff1_thd1~0_4 v_~z$r_buff0_thd1~0_3) (= v_~__unbuffered_p3_EBX~0_4 v_~b~0_5) (not (= 0 v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8)) (= v_~__unbuffered_p3_EAX~0_4 v_~a~0_3) (= v_~z$r_buff0_thd4~0_17 v_~z$r_buff1_thd4~0_10) (= v_~z$r_buff1_thd2~0_4 v_~z$r_buff0_thd2~0_3) (= v_~z$r_buff0_thd4~0_16 1) (= 1 v_~a~0_3)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_61, ~b~0=v_~b~0_5, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_14, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_3} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_10, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_10, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_4, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_4, ~a~0=v_~a~0_3, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_61, ~b~0=v_~b~0_5, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_39, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_4, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_16, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_14, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_3} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-27 21:24:58,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~x~0_10 1) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= 1 v_~b~0_8) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~b~0=v_~b~0_8, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, ~x~0=v_~x~0_10, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 21:24:58,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= 2 v_~x~0_8) (= 1 v_~y~0_5) (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, ~y~0=v_~y~0_5, ~x~0=v_~x~0_8, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~y~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 21:24:58,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L809-->L809-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In1192434552 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1192434552 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork3_#t~ite11_Out1192434552| ~z$w_buff0_used~0_In1192434552)) (and (= |P3Thread1of1ForFork3_#t~ite11_Out1192434552| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1192434552, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1192434552} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1192434552, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1192434552, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out1192434552|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-27 21:24:58,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L810-->L810-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In756814970 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In756814970 256))) (.cse0 (= (mod ~z$r_buff1_thd4~0_In756814970 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In756814970 256) 0))) (or (and (= ~z$w_buff1_used~0_In756814970 |P3Thread1of1ForFork3_#t~ite12_Out756814970|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork3_#t~ite12_Out756814970|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In756814970, ~z$w_buff0_used~0=~z$w_buff0_used~0_In756814970, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In756814970, ~z$w_buff1_used~0=~z$w_buff1_used~0_In756814970} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In756814970, ~z$w_buff0_used~0=~z$w_buff0_used~0_In756814970, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In756814970, ~z$w_buff1_used~0=~z$w_buff1_used~0_In756814970, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out756814970|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-27 21:24:58,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L772-2-->L772-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In84500001 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In84500001 256)))) (or (and (= ~z~0_In84500001 |P2Thread1of1ForFork2_#t~ite3_Out84500001|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In84500001 |P2Thread1of1ForFork2_#t~ite3_Out84500001|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In84500001, ~z$w_buff1_used~0=~z$w_buff1_used~0_In84500001, ~z$w_buff1~0=~z$w_buff1~0_In84500001, ~z~0=~z~0_In84500001} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out84500001|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In84500001, ~z$w_buff1_used~0=~z$w_buff1_used~0_In84500001, ~z$w_buff1~0=~z$w_buff1~0_In84500001, ~z~0=~z~0_In84500001} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 21:24:58,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-4-->L773: Formula: (= v_~z~0_17 |v_P2Thread1of1ForFork2_#t~ite3_8|) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_8|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_7|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_7|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-27 21:24:58,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1768084309 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1768084309 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite5_Out1768084309| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite5_Out1768084309| ~z$w_buff0_used~0_In1768084309)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1768084309, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1768084309} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out1768084309|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1768084309, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1768084309} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 21:24:58,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-1237072294 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1237072294 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-1237072294 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-1237072294 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1237072294 |P2Thread1of1ForFork2_#t~ite6_Out-1237072294|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite6_Out-1237072294|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1237072294, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1237072294, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1237072294, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1237072294} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out-1237072294|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1237072294, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1237072294, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1237072294, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1237072294} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 21:24:58,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In406874968 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In406874968 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite7_Out406874968|)) (and (= ~z$r_buff0_thd3~0_In406874968 |P2Thread1of1ForFork2_#t~ite7_Out406874968|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In406874968, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In406874968} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In406874968, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In406874968, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out406874968|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 21:24:58,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L776-->L776-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1377062438 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1377062438 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In1377062438 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In1377062438 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite8_Out1377062438| ~z$r_buff1_thd3~0_In1377062438) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite8_Out1377062438| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1377062438, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1377062438, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1377062438, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1377062438} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1377062438, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1377062438, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1377062438, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1377062438, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out1377062438|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 21:24:58,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L776-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork2_#t~ite8_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_8|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_12, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_7|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 21:24:58,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L811-->L812: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-617038559 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-617038559 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out-617038559 ~z$r_buff0_thd4~0_In-617038559)) (and (not .cse1) (= ~z$r_buff0_thd4~0_Out-617038559 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-617038559, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-617038559} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-617038559, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-617038559, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out-617038559|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-27 21:24:58,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L812-->L812-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1516554387 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In1516554387 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In1516554387 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1516554387 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork3_#t~ite14_Out1516554387| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork3_#t~ite14_Out1516554387| ~z$r_buff1_thd4~0_In1516554387)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1516554387, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1516554387, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1516554387, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1516554387} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1516554387, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1516554387, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out1516554387|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1516554387, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1516554387} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-27 21:24:58,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L812-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19) (= |v_P3Thread1of1ForFork3_#t~ite14_8| v_~z$r_buff1_thd4~0_13)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_13, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_7|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-27 21:24:58,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L837-1-->L843: Formula: (and (= 4 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_4|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-27 21:24:58,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L843-2-->L843-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite19_Out233718098| |ULTIMATE.start_main_#t~ite20_Out233718098|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In233718098 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In233718098 256) 0))) (or (and .cse0 (or .cse1 .cse2) (= ~z~0_In233718098 |ULTIMATE.start_main_#t~ite19_Out233718098|)) (and .cse0 (= ~z$w_buff1~0_In233718098 |ULTIMATE.start_main_#t~ite19_Out233718098|) (not .cse2) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In233718098, ~z$w_buff1_used~0=~z$w_buff1_used~0_In233718098, ~z$w_buff1~0=~z$w_buff1~0_In233718098, ~z~0=~z~0_In233718098} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out233718098|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In233718098, ~z$w_buff1_used~0=~z$w_buff1_used~0_In233718098, ~z$w_buff1~0=~z$w_buff1~0_In233718098, ~z~0=~z~0_In233718098, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out233718098|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 21:24:58,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L844-->L844-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-1935092730 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1935092730 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out-1935092730| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-1935092730| ~z$w_buff0_used~0_In-1935092730)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1935092730, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1935092730} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1935092730, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1935092730, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1935092730|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 21:24:58,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L845-->L845-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1410463047 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1410463047 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1410463047 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In1410463047 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite22_Out1410463047|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1410463047 |ULTIMATE.start_main_#t~ite22_Out1410463047|) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1410463047, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1410463047, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1410463047, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1410463047} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1410463047, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1410463047, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1410463047, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1410463047, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1410463047|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 21:24:58,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L846-->L846-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1331252377 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1331252377 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite23_Out-1331252377|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-1331252377 |ULTIMATE.start_main_#t~ite23_Out-1331252377|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1331252377, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1331252377} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1331252377, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1331252377, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1331252377|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 21:24:58,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L847-->L847-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-865763160 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-865763160 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-865763160 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-865763160 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite24_Out-865763160| ~z$r_buff1_thd0~0_In-865763160) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite24_Out-865763160| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-865763160, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-865763160, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-865763160, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-865763160} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-865763160, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-865763160, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-865763160, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-865763160|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-865763160} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-27 21:24:58,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L855-->L855-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In878962480 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite31_Out878962480| |ULTIMATE.start_main_#t~ite30_Out878962480|) (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In878962480 256) 0))) (or (and .cse0 (= (mod ~z$r_buff1_thd0~0_In878962480 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In878962480 256)) (and .cse0 (= (mod ~z$w_buff1_used~0_In878962480 256) 0)))) .cse1 (= |ULTIMATE.start_main_#t~ite30_Out878962480| ~z$w_buff0~0_In878962480)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite30_In878962480| |ULTIMATE.start_main_#t~ite30_Out878962480|) (= |ULTIMATE.start_main_#t~ite31_Out878962480| ~z$w_buff0~0_In878962480)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In878962480, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_In878962480|, ~z$w_buff0~0=~z$w_buff0~0_In878962480, ~z$w_buff0_used~0=~z$w_buff0_used~0_In878962480, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In878962480, ~z$w_buff1_used~0=~z$w_buff1_used~0_In878962480, ~weak$$choice2~0=~weak$$choice2~0_In878962480} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In878962480, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out878962480|, ~z$w_buff0~0=~z$w_buff0~0_In878962480, ~z$w_buff0_used~0=~z$w_buff0_used~0_In878962480, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In878962480, ~z$w_buff1_used~0=~z$w_buff1_used~0_In878962480, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out878962480|, ~weak$$choice2~0=~weak$$choice2~0_In878962480} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite31] because there is no mapped edge [2019-12-27 21:24:58,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L856-->L856-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1949816983 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite33_Out-1949816983| ~z$w_buff1~0_In-1949816983) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1949816983 256)))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In-1949816983 256) 0)) (= (mod ~z$w_buff0_used~0_In-1949816983 256) 0) (and .cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1949816983 256))))) (= |ULTIMATE.start_main_#t~ite34_Out-1949816983| |ULTIMATE.start_main_#t~ite33_Out-1949816983|)) (and (= |ULTIMATE.start_main_#t~ite33_In-1949816983| |ULTIMATE.start_main_#t~ite33_Out-1949816983|) (= |ULTIMATE.start_main_#t~ite34_Out-1949816983| ~z$w_buff1~0_In-1949816983) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1949816983, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1949816983, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1949816983, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1949816983, ~z$w_buff1~0=~z$w_buff1~0_In-1949816983, ~weak$$choice2~0=~weak$$choice2~0_In-1949816983, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_In-1949816983|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1949816983, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1949816983, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1949816983, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1949816983, ~z$w_buff1~0=~z$w_buff1~0_In-1949816983, ~weak$$choice2~0=~weak$$choice2~0_In-1949816983, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out-1949816983|, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-1949816983|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 21:24:58,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L859-->L860: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~z$r_buff0_thd0~0_59 v_~z$r_buff0_thd0~0_58)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_58, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_21, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 21:24:58,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L860-->L860-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In606481926 256) 0))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In606481926 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In606481926 256)) (and (= 0 (mod ~z$r_buff1_thd0~0_In606481926 256)) .cse1) (and (= 0 (mod ~z$w_buff1_used~0_In606481926 256)) .cse1))) (= |ULTIMATE.start_main_#t~ite46_Out606481926| |ULTIMATE.start_main_#t~ite45_Out606481926|) (= ~z$r_buff1_thd0~0_In606481926 |ULTIMATE.start_main_#t~ite45_Out606481926|)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite45_In606481926| |ULTIMATE.start_main_#t~ite45_Out606481926|) (= ~z$r_buff1_thd0~0_In606481926 |ULTIMATE.start_main_#t~ite46_Out606481926|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In606481926, ~z$w_buff0_used~0=~z$w_buff0_used~0_In606481926, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In606481926, ~z$w_buff1_used~0=~z$w_buff1_used~0_In606481926, ~weak$$choice2~0=~weak$$choice2~0_In606481926, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In606481926|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In606481926, ~z$w_buff0_used~0=~z$w_buff0_used~0_In606481926, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In606481926, ~z$w_buff1_used~0=~z$w_buff1_used~0_In606481926, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out606481926|, ~weak$$choice2~0=~weak$$choice2~0_In606481926, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out606481926|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 21:24:58,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L862-->L4: Formula: (and (= v_~z~0_20 v_~z$mem_tmp~0_6) (= (mod v_~main$tmp_guard1~0_6 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_6, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_20, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:24:58,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 21:24:58,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:24:58 BasicIcfg [2019-12-27 21:24:58,860 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:24:58,861 INFO L168 Benchmark]: Toolchain (without parser) took 37397.51 ms. Allocated memory was 139.5 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 102.3 MB in the beginning and 615.7 MB in the end (delta: -513.4 MB). Peak memory consumption was 773.2 MB. Max. memory is 7.1 GB. [2019-12-27 21:24:58,862 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 21:24:58,862 INFO L168 Benchmark]: CACSL2BoogieTranslator took 850.27 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 101.9 MB in the beginning and 155.6 MB in the end (delta: -53.8 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-12-27 21:24:58,863 INFO L168 Benchmark]: Boogie Procedure Inliner took 134.43 ms. Allocated memory is still 203.9 MB. Free memory was 155.0 MB in the beginning and 152.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:24:58,864 INFO L168 Benchmark]: Boogie Preprocessor took 92.09 ms. Allocated memory is still 203.9 MB. Free memory was 152.4 MB in the beginning and 149.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:24:58,864 INFO L168 Benchmark]: RCFGBuilder took 882.20 ms. Allocated memory is still 203.9 MB. Free memory was 149.8 MB in the beginning and 100.5 MB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. [2019-12-27 21:24:58,865 INFO L168 Benchmark]: TraceAbstraction took 35433.62 ms. Allocated memory was 203.9 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 99.8 MB in the beginning and 615.7 MB in the end (delta: -515.9 MB). Peak memory consumption was 706.2 MB. Max. memory is 7.1 GB. [2019-12-27 21:24:58,868 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.26 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 850.27 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 101.9 MB in the beginning and 155.6 MB in the end (delta: -53.8 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 134.43 ms. Allocated memory is still 203.9 MB. Free memory was 155.0 MB in the beginning and 152.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 92.09 ms. Allocated memory is still 203.9 MB. Free memory was 152.4 MB in the beginning and 149.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 882.20 ms. Allocated memory is still 203.9 MB. Free memory was 149.8 MB in the beginning and 100.5 MB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 35433.62 ms. Allocated memory was 203.9 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 99.8 MB in the beginning and 615.7 MB in the end (delta: -515.9 MB). Peak memory consumption was 706.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 180 ProgramPointsBefore, 92 ProgramPointsAfterwards, 208 TransitionsBefore, 99 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 26 ChoiceCompositions, 4932 VarBasedMoverChecksPositive, 155 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 52826 CheckedPairsTotal, 119 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L831] FCALL, FORK 0 pthread_create(&t1273, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L833] FCALL, FORK 0 pthread_create(&t1274, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L835] FCALL, FORK 0 pthread_create(&t1275, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L837] FCALL, FORK 0 pthread_create(&t1276, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L786] 4 z$w_buff1 = z$w_buff0 [L787] 4 z$w_buff0 = 2 [L788] 4 z$w_buff1_used = z$w_buff0_used [L789] 4 z$w_buff0_used = (_Bool)1 [L808] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 3 y = 2 [L769] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L772] 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L773] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L774] 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 [L775] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L810] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L843] EXPR 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L844] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L845] 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 [L846] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L847] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L850] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L851] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L852] 0 z$flush_delayed = weak$$choice2 [L853] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L855] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L856] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L857] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L858] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L860] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L861] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 35.1s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 14.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2045 SDtfs, 3323 SDslu, 6064 SDs, 0 SdLazy, 4161 SolverSat, 367 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 297 GetRequests, 93 SyntacticMatches, 27 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 769 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50002occurred 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: 8.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 11764 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 866 NumberOfCodeBlocks, 866 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 788 ConstructedInterpolants, 0 QuantifiedInterpolants, 181994 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...