/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/mix022_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:27:23,094 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:27:23,097 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:27:23,112 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:27:23,113 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:27:23,114 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:27:23,115 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:27:23,117 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:27:23,119 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:27:23,120 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:27:23,121 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:27:23,125 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:27:23,125 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:27:23,130 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:27:23,131 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:27:23,132 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:27:23,133 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:27:23,134 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:27:23,138 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:27:23,141 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:27:23,146 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:27:23,151 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:27:23,155 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:27:23,156 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:27:23,158 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:27:23,158 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:27:23,158 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:27:23,160 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:27:23,160 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:27:23,164 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:27:23,164 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:27:23,165 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:27:23,165 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:27:23,169 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:27:23,170 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:27:23,170 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:27:23,174 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:27:23,175 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:27:23,175 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:27:23,177 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:27:23,177 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:27:23,180 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 20:27:23,200 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:27:23,200 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:27:23,201 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:27:23,202 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:27:23,202 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:27:23,202 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:27:23,202 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:27:23,202 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:27:23,204 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:27:23,204 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:27:23,205 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:27:23,205 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:27:23,205 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:27:23,206 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:27:23,206 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:27:23,206 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:27:23,206 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:27:23,207 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:27:23,207 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:27:23,207 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:27:23,207 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:27:23,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:27:23,208 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:27:23,208 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:27:23,208 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:27:23,208 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:27:23,208 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:27:23,209 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:27:23,209 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:27:23,209 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:27:23,210 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:27:23,210 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:27:23,539 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:27:23,560 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:27:23,564 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:27:23,565 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:27:23,566 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:27:23,567 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_rmo.oepc.i [2019-12-27 20:27:23,626 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3021b22ec/1a3c8bf5a0874dad95dea37a733b1d86/FLAG960937184 [2019-12-27 20:27:24,187 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:27:24,188 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_rmo.oepc.i [2019-12-27 20:27:24,209 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3021b22ec/1a3c8bf5a0874dad95dea37a733b1d86/FLAG960937184 [2019-12-27 20:27:24,461 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3021b22ec/1a3c8bf5a0874dad95dea37a733b1d86 [2019-12-27 20:27:24,472 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:27:24,474 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:27:24,475 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:27:24,476 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:27:24,479 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:27:24,480 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:27:24" (1/1) ... [2019-12-27 20:27:24,483 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36dd6462 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:24, skipping insertion in model container [2019-12-27 20:27:24,483 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:27:24" (1/1) ... [2019-12-27 20:27:24,490 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:27:24,550 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:27:25,042 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:27:25,059 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:27:25,141 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:27:25,219 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:27:25,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:25 WrapperNode [2019-12-27 20:27:25,220 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:27:25,220 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:27:25,220 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:27:25,221 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:27:25,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:25" (1/1) ... [2019-12-27 20:27:25,260 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:25" (1/1) ... [2019-12-27 20:27:25,289 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:27:25,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:27:25,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:27:25,290 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:27:25,299 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:25" (1/1) ... [2019-12-27 20:27:25,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:25" (1/1) ... [2019-12-27 20:27:25,304 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:25" (1/1) ... [2019-12-27 20:27:25,305 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:25" (1/1) ... [2019-12-27 20:27:25,314 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:25" (1/1) ... [2019-12-27 20:27:25,318 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:25" (1/1) ... [2019-12-27 20:27:25,322 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:25" (1/1) ... [2019-12-27 20:27:25,327 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:27:25,327 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:27:25,327 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:27:25,328 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:27:25,329 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:25" (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 20:27:25,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:27:25,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:27:25,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:27:25,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:27:25,392 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:27:25,392 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:27:25,392 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:27:25,392 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:27:25,392 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:27:25,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:27:25,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:27:25,395 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 20:27:26,068 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:27:26,069 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:27:26,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:27:26 BoogieIcfgContainer [2019-12-27 20:27:26,070 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:27:26,072 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:27:26,072 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:27:26,075 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:27:26,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:27:24" (1/3) ... [2019-12-27 20:27:26,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b5c529d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:27:26, skipping insertion in model container [2019-12-27 20:27:26,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:25" (2/3) ... [2019-12-27 20:27:26,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b5c529d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:27:26, skipping insertion in model container [2019-12-27 20:27:26,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:27:26" (3/3) ... [2019-12-27 20:27:26,079 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_rmo.oepc.i [2019-12-27 20:27:26,090 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:27:26,090 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:27:26,099 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:27:26,100 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:27:26,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,139 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,139 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,139 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,140 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,140 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,150 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,150 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,196 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,197 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,197 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,203 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,206 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:26,222 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 20:27:26,243 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:27:26,243 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:27:26,243 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:27:26,243 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:27:26,243 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:27:26,243 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:27:26,244 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:27:26,244 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:27:26,261 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 20:27:26,263 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 20:27:26,352 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 20:27:26,352 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:27:26,369 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 20:27:26,391 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 20:27:26,435 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 20:27:26,435 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:27:26,442 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 20:27:26,460 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 20:27:26,461 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:27:29,588 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-12-27 20:27:29,811 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 20:27:29,935 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 20:27:29,960 INFO L206 etLargeBlockEncoding]: Checked pairs total: 55625 [2019-12-27 20:27:29,960 INFO L214 etLargeBlockEncoding]: Total number of compositions: 98 [2019-12-27 20:27:29,964 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 89 transitions [2019-12-27 20:27:30,510 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9482 states. [2019-12-27 20:27:30,512 INFO L276 IsEmpty]: Start isEmpty. Operand 9482 states. [2019-12-27 20:27:30,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 20:27:30,520 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:30,520 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 20:27:30,521 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:30,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:30,531 INFO L82 PathProgramCache]: Analyzing trace with hash 786448, now seen corresponding path program 1 times [2019-12-27 20:27:30,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:30,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587302090] [2019-12-27 20:27:30,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:30,779 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 20:27:30,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587302090] [2019-12-27 20:27:30,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:30,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:27:30,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1493577753] [2019-12-27 20:27:30,785 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:30,790 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:30,802 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 20:27:30,803 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:30,807 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:27:30,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:27:30,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:30,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:27:30,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:27:30,826 INFO L87 Difference]: Start difference. First operand 9482 states. Second operand 3 states. [2019-12-27 20:27:31,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:31,128 INFO L93 Difference]: Finished difference Result 9196 states and 29676 transitions. [2019-12-27 20:27:31,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:27:31,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 20:27:31,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:31,373 INFO L225 Difference]: With dead ends: 9196 [2019-12-27 20:27:31,377 INFO L226 Difference]: Without dead ends: 8650 [2019-12-27 20:27:31,382 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 20:27:31,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8650 states. [2019-12-27 20:27:31,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8650 to 8650. [2019-12-27 20:27:31,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8650 states. [2019-12-27 20:27:31,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8650 states to 8650 states and 27866 transitions. [2019-12-27 20:27:31,852 INFO L78 Accepts]: Start accepts. Automaton has 8650 states and 27866 transitions. Word has length 3 [2019-12-27 20:27:31,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:31,853 INFO L462 AbstractCegarLoop]: Abstraction has 8650 states and 27866 transitions. [2019-12-27 20:27:31,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:27:31,853 INFO L276 IsEmpty]: Start isEmpty. Operand 8650 states and 27866 transitions. [2019-12-27 20:27:31,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 20:27:31,856 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:31,856 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:27:31,857 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:31,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:31,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1848805564, now seen corresponding path program 1 times [2019-12-27 20:27:31,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:31,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966581288] [2019-12-27 20:27:31,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:31,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:31,983 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 20:27:31,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966581288] [2019-12-27 20:27:31,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:31,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:27:31,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [106142357] [2019-12-27 20:27:31,985 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:31,986 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:31,988 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 20:27:31,989 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:31,989 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:27:31,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:27:31,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:31,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:27:31,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:27:31,991 INFO L87 Difference]: Start difference. First operand 8650 states and 27866 transitions. Second operand 4 states. [2019-12-27 20:27:32,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:32,594 INFO L93 Difference]: Finished difference Result 13062 states and 40116 transitions. [2019-12-27 20:27:32,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:27:32,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 20:27:32,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:32,669 INFO L225 Difference]: With dead ends: 13062 [2019-12-27 20:27:32,669 INFO L226 Difference]: Without dead ends: 13055 [2019-12-27 20:27:32,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:27:32,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13055 states. [2019-12-27 20:27:33,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13055 to 11681. [2019-12-27 20:27:33,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11681 states. [2019-12-27 20:27:33,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11681 states to 11681 states and 36573 transitions. [2019-12-27 20:27:33,097 INFO L78 Accepts]: Start accepts. Automaton has 11681 states and 36573 transitions. Word has length 11 [2019-12-27 20:27:33,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:33,098 INFO L462 AbstractCegarLoop]: Abstraction has 11681 states and 36573 transitions. [2019-12-27 20:27:33,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:27:33,098 INFO L276 IsEmpty]: Start isEmpty. Operand 11681 states and 36573 transitions. [2019-12-27 20:27:33,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:27:33,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:33,103 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:27:33,104 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:33,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:33,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1479508104, now seen corresponding path program 1 times [2019-12-27 20:27:33,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:33,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59261675] [2019-12-27 20:27:33,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:33,729 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 20:27:33,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59261675] [2019-12-27 20:27:33,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:33,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:27:33,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [41210861] [2019-12-27 20:27:33,730 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:33,732 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:33,734 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 20:27:33,735 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:33,735 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:27:33,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:27:33,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:33,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:27:33,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:27:33,736 INFO L87 Difference]: Start difference. First operand 11681 states and 36573 transitions. Second operand 4 states. [2019-12-27 20:27:33,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:33,973 INFO L93 Difference]: Finished difference Result 13877 states and 43308 transitions. [2019-12-27 20:27:33,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:27:33,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 20:27:33,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:34,024 INFO L225 Difference]: With dead ends: 13877 [2019-12-27 20:27:34,024 INFO L226 Difference]: Without dead ends: 13877 [2019-12-27 20:27:34,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:27:34,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13877 states. [2019-12-27 20:27:34,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13877 to 12389. [2019-12-27 20:27:34,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12389 states. [2019-12-27 20:27:34,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12389 states to 12389 states and 38882 transitions. [2019-12-27 20:27:34,448 INFO L78 Accepts]: Start accepts. Automaton has 12389 states and 38882 transitions. Word has length 14 [2019-12-27 20:27:34,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:34,450 INFO L462 AbstractCegarLoop]: Abstraction has 12389 states and 38882 transitions. [2019-12-27 20:27:34,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:27:34,450 INFO L276 IsEmpty]: Start isEmpty. Operand 12389 states and 38882 transitions. [2019-12-27 20:27:34,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:27:34,454 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:34,454 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:27:34,454 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:34,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:34,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1357739076, now seen corresponding path program 1 times [2019-12-27 20:27:34,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:34,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365272546] [2019-12-27 20:27:34,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:34,565 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 20:27:34,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365272546] [2019-12-27 20:27:34,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:34,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:27:34,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1381196343] [2019-12-27 20:27:34,566 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:34,568 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:34,570 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 22 transitions. [2019-12-27 20:27:34,571 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:34,572 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:27:34,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:27:34,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:34,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:27:34,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:27:34,573 INFO L87 Difference]: Start difference. First operand 12389 states and 38882 transitions. Second operand 3 states. [2019-12-27 20:27:34,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:34,639 INFO L93 Difference]: Finished difference Result 12386 states and 38873 transitions. [2019-12-27 20:27:34,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:27:34,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 20:27:34,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:34,675 INFO L225 Difference]: With dead ends: 12386 [2019-12-27 20:27:34,676 INFO L226 Difference]: Without dead ends: 12386 [2019-12-27 20:27:34,676 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 20:27:34,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12386 states. [2019-12-27 20:27:34,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12386 to 12386. [2019-12-27 20:27:34,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12386 states. [2019-12-27 20:27:35,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12386 states to 12386 states and 38873 transitions. [2019-12-27 20:27:35,032 INFO L78 Accepts]: Start accepts. Automaton has 12386 states and 38873 transitions. Word has length 16 [2019-12-27 20:27:35,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:35,033 INFO L462 AbstractCegarLoop]: Abstraction has 12386 states and 38873 transitions. [2019-12-27 20:27:35,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:27:35,033 INFO L276 IsEmpty]: Start isEmpty. Operand 12386 states and 38873 transitions. [2019-12-27 20:27:35,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 20:27:35,039 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:35,039 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 20:27:35,039 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:35,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:35,040 INFO L82 PathProgramCache]: Analyzing trace with hash 865126068, now seen corresponding path program 1 times [2019-12-27 20:27:35,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:35,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119263306] [2019-12-27 20:27:35,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:35,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:35,153 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 20:27:35,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119263306] [2019-12-27 20:27:35,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:35,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:27:35,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2076290151] [2019-12-27 20:27:35,155 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:35,157 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:35,161 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 37 transitions. [2019-12-27 20:27:35,161 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:35,168 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:27:35,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:27:35,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:35,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:27:35,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:27:35,169 INFO L87 Difference]: Start difference. First operand 12386 states and 38873 transitions. Second operand 4 states. [2019-12-27 20:27:35,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:35,208 INFO L93 Difference]: Finished difference Result 2361 states and 5903 transitions. [2019-12-27 20:27:35,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:27:35,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 20:27:35,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:35,213 INFO L225 Difference]: With dead ends: 2361 [2019-12-27 20:27:35,213 INFO L226 Difference]: Without dead ends: 1670 [2019-12-27 20:27:35,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:27:35,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2019-12-27 20:27:35,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1654. [2019-12-27 20:27:35,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1654 states. [2019-12-27 20:27:35,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 3696 transitions. [2019-12-27 20:27:35,316 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 3696 transitions. Word has length 17 [2019-12-27 20:27:35,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:35,316 INFO L462 AbstractCegarLoop]: Abstraction has 1654 states and 3696 transitions. [2019-12-27 20:27:35,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:27:35,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 3696 transitions. [2019-12-27 20:27:35,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 20:27:35,320 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:35,320 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:27:35,320 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:35,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:35,321 INFO L82 PathProgramCache]: Analyzing trace with hash 935036584, now seen corresponding path program 1 times [2019-12-27 20:27:35,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:35,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923798587] [2019-12-27 20:27:35,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:35,459 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 20:27:35,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923798587] [2019-12-27 20:27:35,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:35,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:27:35,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1948127376] [2019-12-27 20:27:35,460 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:35,465 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:35,471 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 20:27:35,472 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:35,472 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:27:35,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:27:35,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:35,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:27:35,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:27:35,473 INFO L87 Difference]: Start difference. First operand 1654 states and 3696 transitions. Second operand 6 states. [2019-12-27 20:27:36,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:36,096 INFO L93 Difference]: Finished difference Result 4552 states and 10047 transitions. [2019-12-27 20:27:36,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 20:27:36,096 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 20:27:36,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:36,104 INFO L225 Difference]: With dead ends: 4552 [2019-12-27 20:27:36,104 INFO L226 Difference]: Without dead ends: 4517 [2019-12-27 20:27:36,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:27:36,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4517 states. [2019-12-27 20:27:36,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4517 to 2214. [2019-12-27 20:27:36,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2214 states. [2019-12-27 20:27:36,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2214 states to 2214 states and 5000 transitions. [2019-12-27 20:27:36,161 INFO L78 Accepts]: Start accepts. Automaton has 2214 states and 5000 transitions. Word has length 25 [2019-12-27 20:27:36,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:36,161 INFO L462 AbstractCegarLoop]: Abstraction has 2214 states and 5000 transitions. [2019-12-27 20:27:36,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:27:36,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2214 states and 5000 transitions. [2019-12-27 20:27:36,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 20:27:36,165 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:36,165 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:27:36,165 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:36,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:36,166 INFO L82 PathProgramCache]: Analyzing trace with hash -453087513, now seen corresponding path program 1 times [2019-12-27 20:27:36,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:36,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501147857] [2019-12-27 20:27:36,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:36,223 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 20:27:36,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501147857] [2019-12-27 20:27:36,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:36,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:27:36,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1120277696] [2019-12-27 20:27:36,224 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:36,228 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:36,236 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 70 transitions. [2019-12-27 20:27:36,237 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:36,280 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:27:36,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:27:36,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:36,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:27:36,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:27:36,283 INFO L87 Difference]: Start difference. First operand 2214 states and 5000 transitions. Second operand 4 states. [2019-12-27 20:27:36,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:36,314 INFO L93 Difference]: Finished difference Result 3872 states and 8779 transitions. [2019-12-27 20:27:36,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:27:36,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-27 20:27:36,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:36,320 INFO L225 Difference]: With dead ends: 3872 [2019-12-27 20:27:36,320 INFO L226 Difference]: Without dead ends: 2030 [2019-12-27 20:27:36,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:27:36,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2030 states. [2019-12-27 20:27:36,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2030 to 2010. [2019-12-27 20:27:36,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2010 states. [2019-12-27 20:27:36,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2010 states to 2010 states and 4452 transitions. [2019-12-27 20:27:36,358 INFO L78 Accepts]: Start accepts. Automaton has 2010 states and 4452 transitions. Word has length 26 [2019-12-27 20:27:36,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:36,358 INFO L462 AbstractCegarLoop]: Abstraction has 2010 states and 4452 transitions. [2019-12-27 20:27:36,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:27:36,359 INFO L276 IsEmpty]: Start isEmpty. Operand 2010 states and 4452 transitions. [2019-12-27 20:27:36,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 20:27:36,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:36,361 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:27:36,362 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:36,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:36,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1584123616, now seen corresponding path program 1 times [2019-12-27 20:27:36,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:36,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499879424] [2019-12-27 20:27:36,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:36,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:36,473 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 20:27:36,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499879424] [2019-12-27 20:27:36,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:36,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:27:36,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [509554351] [2019-12-27 20:27:36,474 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:36,482 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:36,491 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 26 transitions. [2019-12-27 20:27:36,491 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:36,492 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:27:36,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:27:36,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:36,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:27:36,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:27:36,493 INFO L87 Difference]: Start difference. First operand 2010 states and 4452 transitions. Second operand 6 states. [2019-12-27 20:27:36,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:36,979 INFO L93 Difference]: Finished difference Result 3736 states and 7983 transitions. [2019-12-27 20:27:36,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 20:27:36,980 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-27 20:27:36,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:36,985 INFO L225 Difference]: With dead ends: 3736 [2019-12-27 20:27:36,985 INFO L226 Difference]: Without dead ends: 3707 [2019-12-27 20:27:36,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:27:37,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3707 states. [2019-12-27 20:27:37,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3707 to 1982. [2019-12-27 20:27:37,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1982 states. [2019-12-27 20:27:37,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 4405 transitions. [2019-12-27 20:27:37,043 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 4405 transitions. Word has length 26 [2019-12-27 20:27:37,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:37,047 INFO L462 AbstractCegarLoop]: Abstraction has 1982 states and 4405 transitions. [2019-12-27 20:27:37,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:27:37,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 4405 transitions. [2019-12-27 20:27:37,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 20:27:37,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:37,050 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:27:37,050 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:37,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:37,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1377848575, now seen corresponding path program 1 times [2019-12-27 20:27:37,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:37,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193207968] [2019-12-27 20:27:37,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:37,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:37,156 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 20:27:37,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193207968] [2019-12-27 20:27:37,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:37,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:27:37,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1745011940] [2019-12-27 20:27:37,157 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:37,162 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:37,191 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 89 transitions. [2019-12-27 20:27:37,191 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:37,283 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 20:27:37,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:27:37,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:37,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:27:37,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:27:37,284 INFO L87 Difference]: Start difference. First operand 1982 states and 4405 transitions. Second operand 8 states. [2019-12-27 20:27:38,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:38,095 INFO L93 Difference]: Finished difference Result 2989 states and 6529 transitions. [2019-12-27 20:27:38,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:27:38,096 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-12-27 20:27:38,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:38,100 INFO L225 Difference]: With dead ends: 2989 [2019-12-27 20:27:38,100 INFO L226 Difference]: Without dead ends: 2989 [2019-12-27 20:27:38,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:27:38,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2989 states. [2019-12-27 20:27:38,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2989 to 2553. [2019-12-27 20:27:38,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2553 states. [2019-12-27 20:27:38,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 5641 transitions. [2019-12-27 20:27:38,146 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 5641 transitions. Word has length 27 [2019-12-27 20:27:38,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:38,147 INFO L462 AbstractCegarLoop]: Abstraction has 2553 states and 5641 transitions. [2019-12-27 20:27:38,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:27:38,147 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 5641 transitions. [2019-12-27 20:27:38,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 20:27:38,151 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:38,152 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:27:38,152 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:38,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:38,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1012801820, now seen corresponding path program 1 times [2019-12-27 20:27:38,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:38,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628150894] [2019-12-27 20:27:38,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:38,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:38,228 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 20:27:38,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628150894] [2019-12-27 20:27:38,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:38,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:27:38,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1649217613] [2019-12-27 20:27:38,229 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:38,235 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:38,247 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 92 transitions. [2019-12-27 20:27:38,247 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:38,265 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 20:27:38,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:27:38,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:38,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:27:38,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:27:38,266 INFO L87 Difference]: Start difference. First operand 2553 states and 5641 transitions. Second operand 6 states. [2019-12-27 20:27:38,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:38,314 INFO L93 Difference]: Finished difference Result 1549 states and 3250 transitions. [2019-12-27 20:27:38,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:27:38,315 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 20:27:38,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:38,317 INFO L225 Difference]: With dead ends: 1549 [2019-12-27 20:27:38,317 INFO L226 Difference]: Without dead ends: 1302 [2019-12-27 20:27:38,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:27:38,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2019-12-27 20:27:38,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1207. [2019-12-27 20:27:38,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1207 states. [2019-12-27 20:27:38,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 2612 transitions. [2019-12-27 20:27:38,337 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 2612 transitions. Word has length 28 [2019-12-27 20:27:38,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:38,337 INFO L462 AbstractCegarLoop]: Abstraction has 1207 states and 2612 transitions. [2019-12-27 20:27:38,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:27:38,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 2612 transitions. [2019-12-27 20:27:38,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 20:27:38,341 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:38,341 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] [2019-12-27 20:27:38,341 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:38,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:38,342 INFO L82 PathProgramCache]: Analyzing trace with hash -257669256, now seen corresponding path program 1 times [2019-12-27 20:27:38,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:38,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342799291] [2019-12-27 20:27:38,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:38,431 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 20:27:38,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342799291] [2019-12-27 20:27:38,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:38,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:27:38,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [383728159] [2019-12-27 20:27:38,432 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:38,450 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:38,507 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 135 transitions. [2019-12-27 20:27:38,507 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:38,563 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 20:27:38,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:27:38,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:38,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:27:38,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:27:38,564 INFO L87 Difference]: Start difference. First operand 1207 states and 2612 transitions. Second operand 9 states. [2019-12-27 20:27:38,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:38,864 INFO L93 Difference]: Finished difference Result 2115 states and 4473 transitions. [2019-12-27 20:27:38,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 20:27:38,865 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-12-27 20:27:38,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:38,867 INFO L225 Difference]: With dead ends: 2115 [2019-12-27 20:27:38,868 INFO L226 Difference]: Without dead ends: 1423 [2019-12-27 20:27:38,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:27:38,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2019-12-27 20:27:38,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1214. [2019-12-27 20:27:38,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1214 states. [2019-12-27 20:27:38,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 2602 transitions. [2019-12-27 20:27:38,887 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 2602 transitions. Word has length 51 [2019-12-27 20:27:38,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:38,888 INFO L462 AbstractCegarLoop]: Abstraction has 1214 states and 2602 transitions. [2019-12-27 20:27:38,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:27:38,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 2602 transitions. [2019-12-27 20:27:38,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 20:27:38,892 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:38,892 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] [2019-12-27 20:27:38,892 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:38,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:38,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1643045960, now seen corresponding path program 2 times [2019-12-27 20:27:38,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:38,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127260267] [2019-12-27 20:27:38,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:38,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:39,020 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 20:27:39,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127260267] [2019-12-27 20:27:39,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:39,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 20:27:39,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1642914013] [2019-12-27 20:27:39,022 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:39,040 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:39,100 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 133 transitions. [2019-12-27 20:27:39,100 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:39,151 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 20:27:39,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:27:39,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:39,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:27:39,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:27:39,152 INFO L87 Difference]: Start difference. First operand 1214 states and 2602 transitions. Second operand 8 states. [2019-12-27 20:27:40,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:40,636 INFO L93 Difference]: Finished difference Result 2567 states and 5315 transitions. [2019-12-27 20:27:40,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 20:27:40,636 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-12-27 20:27:40,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:40,640 INFO L225 Difference]: With dead ends: 2567 [2019-12-27 20:27:40,640 INFO L226 Difference]: Without dead ends: 2567 [2019-12-27 20:27:40,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-27 20:27:40,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2567 states. [2019-12-27 20:27:40,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2567 to 1287. [2019-12-27 20:27:40,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1287 states. [2019-12-27 20:27:40,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 2769 transitions. [2019-12-27 20:27:40,686 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 2769 transitions. Word has length 51 [2019-12-27 20:27:40,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:40,687 INFO L462 AbstractCegarLoop]: Abstraction has 1287 states and 2769 transitions. [2019-12-27 20:27:40,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:27:40,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 2769 transitions. [2019-12-27 20:27:40,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 20:27:40,691 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:40,691 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] [2019-12-27 20:27:40,691 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:40,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:40,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1716241888, now seen corresponding path program 3 times [2019-12-27 20:27:40,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:40,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914501485] [2019-12-27 20:27:40,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:40,823 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 20:27:40,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914501485] [2019-12-27 20:27:40,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:40,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:27:40,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1701827565] [2019-12-27 20:27:40,825 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:40,866 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:41,024 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 118 transitions. [2019-12-27 20:27:41,024 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:41,025 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:27:41,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:27:41,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:41,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:27:41,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:27:41,033 INFO L87 Difference]: Start difference. First operand 1287 states and 2769 transitions. Second operand 3 states. [2019-12-27 20:27:41,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:41,112 INFO L93 Difference]: Finished difference Result 1642 states and 3493 transitions. [2019-12-27 20:27:41,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:27:41,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 20:27:41,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:41,116 INFO L225 Difference]: With dead ends: 1642 [2019-12-27 20:27:41,116 INFO L226 Difference]: Without dead ends: 1642 [2019-12-27 20:27:41,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:27:41,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-12-27 20:27:41,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 1271. [2019-12-27 20:27:41,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1271 states. [2019-12-27 20:27:41,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 2729 transitions. [2019-12-27 20:27:41,159 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 2729 transitions. Word has length 51 [2019-12-27 20:27:41,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:41,159 INFO L462 AbstractCegarLoop]: Abstraction has 1271 states and 2729 transitions. [2019-12-27 20:27:41,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:27:41,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 2729 transitions. [2019-12-27 20:27:41,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 20:27:41,163 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:41,164 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] [2019-12-27 20:27:41,164 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:41,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:41,164 INFO L82 PathProgramCache]: Analyzing trace with hash 730196883, now seen corresponding path program 1 times [2019-12-27 20:27:41,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:41,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046250410] [2019-12-27 20:27:41,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:41,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:41,390 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 20:27:41,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046250410] [2019-12-27 20:27:41,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:41,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:27:41,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1289478620] [2019-12-27 20:27:41,391 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:41,409 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:41,473 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 97 states and 138 transitions. [2019-12-27 20:27:41,473 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:41,534 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 20:27:41,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:27:41,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:41,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:27:41,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:27:41,535 INFO L87 Difference]: Start difference. First operand 1271 states and 2729 transitions. Second operand 9 states. [2019-12-27 20:27:43,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:43,230 INFO L93 Difference]: Finished difference Result 2538 states and 5234 transitions. [2019-12-27 20:27:43,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 20:27:43,231 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-12-27 20:27:43,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:43,235 INFO L225 Difference]: With dead ends: 2538 [2019-12-27 20:27:43,235 INFO L226 Difference]: Without dead ends: 2538 [2019-12-27 20:27:43,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=461, Unknown=0, NotChecked=0, Total=600 [2019-12-27 20:27:43,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2019-12-27 20:27:43,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 1286. [2019-12-27 20:27:43,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1286 states. [2019-12-27 20:27:43,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 2747 transitions. [2019-12-27 20:27:43,267 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 2747 transitions. Word has length 52 [2019-12-27 20:27:43,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:43,267 INFO L462 AbstractCegarLoop]: Abstraction has 1286 states and 2747 transitions. [2019-12-27 20:27:43,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:27:43,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 2747 transitions. [2019-12-27 20:27:43,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 20:27:43,270 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:43,270 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] [2019-12-27 20:27:43,271 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:43,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:43,271 INFO L82 PathProgramCache]: Analyzing trace with hash -539154384, now seen corresponding path program 1 times [2019-12-27 20:27:43,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:43,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674072425] [2019-12-27 20:27:43,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:43,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:43,329 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 20:27:43,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674072425] [2019-12-27 20:27:43,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:43,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:27:43,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [772988268] [2019-12-27 20:27:43,330 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:43,370 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:43,440 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 97 states and 138 transitions. [2019-12-27 20:27:43,441 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:43,447 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:27:43,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:27:43,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:43,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:27:43,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:27:43,449 INFO L87 Difference]: Start difference. First operand 1286 states and 2747 transitions. Second operand 4 states. [2019-12-27 20:27:43,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:43,675 INFO L93 Difference]: Finished difference Result 2096 states and 4397 transitions. [2019-12-27 20:27:43,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:27:43,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-27 20:27:43,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:43,679 INFO L225 Difference]: With dead ends: 2096 [2019-12-27 20:27:43,679 INFO L226 Difference]: Without dead ends: 2096 [2019-12-27 20:27:43,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 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 20:27:43,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2096 states. [2019-12-27 20:27:43,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2096 to 1235. [2019-12-27 20:27:43,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1235 states. [2019-12-27 20:27:43,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 2627 transitions. [2019-12-27 20:27:43,705 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 2627 transitions. Word has length 52 [2019-12-27 20:27:43,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:43,706 INFO L462 AbstractCegarLoop]: Abstraction has 1235 states and 2627 transitions. [2019-12-27 20:27:43,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:27:43,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 2627 transitions. [2019-12-27 20:27:43,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 20:27:43,709 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:43,709 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] [2019-12-27 20:27:43,709 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:43,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:43,709 INFO L82 PathProgramCache]: Analyzing trace with hash -930930685, now seen corresponding path program 2 times [2019-12-27 20:27:43,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:43,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012596077] [2019-12-27 20:27:43,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:43,780 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 20:27:43,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012596077] [2019-12-27 20:27:43,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:43,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:27:43,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1393292538] [2019-12-27 20:27:43,781 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:43,799 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:43,867 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 120 transitions. [2019-12-27 20:27:43,868 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:43,868 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:27:43,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:27:43,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:43,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:27:43,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:27:43,869 INFO L87 Difference]: Start difference. First operand 1235 states and 2627 transitions. Second operand 3 states. [2019-12-27 20:27:43,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:43,885 INFO L93 Difference]: Finished difference Result 1234 states and 2625 transitions. [2019-12-27 20:27:43,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:27:43,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 20:27:43,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:43,887 INFO L225 Difference]: With dead ends: 1234 [2019-12-27 20:27:43,887 INFO L226 Difference]: Without dead ends: 1234 [2019-12-27 20:27:43,888 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 20:27:43,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2019-12-27 20:27:43,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 987. [2019-12-27 20:27:43,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 987 states. [2019-12-27 20:27:43,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 2130 transitions. [2019-12-27 20:27:43,904 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 2130 transitions. Word has length 52 [2019-12-27 20:27:43,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:43,904 INFO L462 AbstractCegarLoop]: Abstraction has 987 states and 2130 transitions. [2019-12-27 20:27:43,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:27:43,904 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 2130 transitions. [2019-12-27 20:27:43,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 20:27:43,906 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:43,906 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] [2019-12-27 20:27:43,907 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:43,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:43,907 INFO L82 PathProgramCache]: Analyzing trace with hash -87902062, now seen corresponding path program 1 times [2019-12-27 20:27:43,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:43,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335261940] [2019-12-27 20:27:43,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:27:43,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:27:44,054 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:27:44,054 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:27:44,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_46| 0 0))) (and (= 0 v_~y$w_buff0~0_26) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd2~0_77 0) (= 0 v_~__unbuffered_cnt~0_13) (= 0 v_~__unbuffered_p1_EAX~0_12) (= 0 v_~y$r_buff1_thd2~0_53) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t593~0.base_22| 4)) (= 0 v_~y$r_buff1_thd0~0_22) (= 0 v_~weak$$choice0~0_5) (= v_~y$r_buff0_thd0~0_24 0) (= 0 v_~y$w_buff1~0_25) (= 0 v_~y$r_buff1_thd1~0_21) (= v_~y$w_buff0_used~0_103 0) (= 0 v_~y$flush_delayed~0_14) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t593~0.base_22|)) (= v_~y$read_delayed~0_6 0) (= v_~y$mem_tmp~0_11 0) (= v_~x~0_17 0) (= |v_#valid_44| (store .cse0 |v_ULTIMATE.start_main_~#t593~0.base_22| 1)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t593~0.base_22| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t593~0.base_22|) |v_ULTIMATE.start_main_~#t593~0.offset_17| 0)) |v_#memory_int_17|) (= v_~y$r_buff0_thd1~0_29 0) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~y$read_delayed_var~0.base_7) (= |v_ULTIMATE.start_main_~#t593~0.offset_17| 0) (= v_~main$tmp_guard1~0_15 0) (= |v_#NULL.offset_4| 0) (= v_~y$w_buff1_used~0_67 0) (= v_~__unbuffered_p1_EBX~0_13 0) (= v_~main$tmp_guard0~0_11 0) (= v_~y~0_26 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t593~0.base_22|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t594~0.offset=|v_ULTIMATE.start_main_~#t594~0.offset_15|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_~#t593~0.base=|v_ULTIMATE.start_main_~#t593~0.base_22|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_20|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_~#t594~0.base=|v_ULTIMATE.start_main_~#t594~0.base_18|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_21, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, ~y$w_buff0~0=v_~y$w_buff0~0_26, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, ULTIMATE.start_main_~#t593~0.offset=|v_ULTIMATE.start_main_~#t593~0.offset_17|, #length=|v_#length_17|, ~y~0=v_~y~0_26, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_53, ~weak$$choice0~0=v_~weak$$choice0~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_24, #valid=|v_#valid_44|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_77, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_22, ~x~0=v_~x~0_17, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t594~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t593~0.base, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ULTIMATE.start_main_~#t594~0.base, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t593~0.offset, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 20:27:44,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L797-1-->L799: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t594~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t594~0.base_12|) |v_ULTIMATE.start_main_~#t594~0.offset_10| 1)) |v_#memory_int_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t594~0.base_12|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t594~0.base_12|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t594~0.base_12|)) (= |v_ULTIMATE.start_main_~#t594~0.offset_10| 0) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t594~0.base_12| 4)) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t594~0.base_12| 1) |v_#valid_27|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t594~0.base=|v_ULTIMATE.start_main_~#t594~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t594~0.offset=|v_ULTIMATE.start_main_~#t594~0.offset_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t594~0.base, ULTIMATE.start_main_~#t594~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 20:27:44,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->L738: Formula: (and (= v_~y$r_buff0_thd1~0_17 v_~y$r_buff1_thd1~0_11) (= 1 v_~x~0_5) (= v_~y$r_buff0_thd2~0_55 v_~y$r_buff1_thd2~0_33) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 0)) (= v_~y$r_buff0_thd1~0_16 1) (= v_~y$r_buff0_thd0~0_15 v_~y$r_buff1_thd0~0_10)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_55, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_33, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_11, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_16, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_55, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x~0=v_~x~0_5, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 20:27:44,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1906062099 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In1906062099 256) 0))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1906062099|) (not .cse1)) (and (= ~y$w_buff0_used~0_In1906062099 |P0Thread1of1ForFork0_#t~ite5_Out1906062099|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1906062099, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1906062099} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1906062099|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1906062099, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1906062099} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 20:27:44,067 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L740-->L740-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1677395495 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1677395495 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In1677395495 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1677395495 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1677395495|)) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1677395495 |P0Thread1of1ForFork0_#t~ite6_Out1677395495|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1677395495, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1677395495, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1677395495, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1677395495} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1677395495|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1677395495, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1677395495, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1677395495, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1677395495} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 20:27:44,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L741-->L742: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In495209632 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In495209632 256)))) (or (and (= ~y$r_buff0_thd1~0_Out495209632 ~y$r_buff0_thd1~0_In495209632) (or .cse0 .cse1)) (and (not .cse1) (= ~y$r_buff0_thd1~0_Out495209632 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In495209632, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In495209632} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In495209632, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out495209632|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out495209632} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 20:27:44,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1894840680 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_In-1894840680| |P1Thread1of1ForFork1_#t~ite14_Out-1894840680|) (= ~y$w_buff0~0_In-1894840680 |P1Thread1of1ForFork1_#t~ite15_Out-1894840680|) (not .cse0)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1894840680 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-1894840680 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-1894840680 256)) (and (= (mod ~y$r_buff1_thd2~0_In-1894840680 256) 0) .cse1))) .cse0 (= ~y$w_buff0~0_In-1894840680 |P1Thread1of1ForFork1_#t~ite14_Out-1894840680|) (= |P1Thread1of1ForFork1_#t~ite15_Out-1894840680| |P1Thread1of1ForFork1_#t~ite14_Out-1894840680|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1894840680, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1894840680, ~y$w_buff0~0=~y$w_buff0~0_In-1894840680, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1894840680, ~weak$$choice2~0=~weak$$choice2~0_In-1894840680, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-1894840680|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1894840680} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1894840680, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1894840680, ~y$w_buff0~0=~y$w_buff0~0_In-1894840680, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1894840680, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-1894840680|, ~weak$$choice2~0=~weak$$choice2~0_In-1894840680, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1894840680|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1894840680} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 20:27:44,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-458126506 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite17_In-458126506| |P1Thread1of1ForFork1_#t~ite17_Out-458126506|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite18_Out-458126506| ~y$w_buff1~0_In-458126506)) (and (= ~y$w_buff1~0_In-458126506 |P1Thread1of1ForFork1_#t~ite17_Out-458126506|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-458126506 256)))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-458126506 256))) (= 0 (mod ~y$w_buff0_used~0_In-458126506 256)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-458126506 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite18_Out-458126506| |P1Thread1of1ForFork1_#t~ite17_Out-458126506|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-458126506, ~y$w_buff1~0=~y$w_buff1~0_In-458126506, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-458126506, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-458126506, ~weak$$choice2~0=~weak$$choice2~0_In-458126506, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In-458126506|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-458126506} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-458126506, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out-458126506|, ~y$w_buff1~0=~y$w_buff1~0_In-458126506, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-458126506, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-458126506, ~weak$$choice2~0=~weak$$choice2~0_In-458126506, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-458126506|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-458126506} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-27 20:27:44,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1394097872 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite21_Out1394097872| ~y$w_buff0_used~0_In1394097872) (= |P1Thread1of1ForFork1_#t~ite20_In1394097872| |P1Thread1of1ForFork1_#t~ite20_Out1394097872|)) (and (= |P1Thread1of1ForFork1_#t~ite20_Out1394097872| ~y$w_buff0_used~0_In1394097872) (= |P1Thread1of1ForFork1_#t~ite20_Out1394097872| |P1Thread1of1ForFork1_#t~ite21_Out1394097872|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1394097872 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In1394097872 256) 0)) (= (mod ~y$w_buff0_used~0_In1394097872 256) 0) (and (= (mod ~y$w_buff1_used~0_In1394097872 256) 0) .cse1))) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1394097872, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1394097872, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1394097872|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1394097872, ~weak$$choice2~0=~weak$$choice2~0_In1394097872, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1394097872} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1394097872, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1394097872, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1394097872|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1394097872, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1394097872|, ~weak$$choice2~0=~weak$$choice2~0_In1394097872, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1394097872} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 20:27:44,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L767-->L768: Formula: (and (= v_~y$r_buff0_thd2~0_61 v_~y$r_buff0_thd2~0_60) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_60, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~weak$$choice2~0=v_~weak$$choice2~0_20, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_8|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 20:27:44,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In2146826977 256)))) (or (and (= ~y$r_buff1_thd2~0_In2146826977 |P1Thread1of1ForFork1_#t~ite30_Out2146826977|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In2146826977| |P1Thread1of1ForFork1_#t~ite29_Out2146826977|)) (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In2146826977 256) 0))) (or (= (mod ~y$w_buff0_used~0_In2146826977 256) 0) (and (= 0 (mod ~y$w_buff1_used~0_In2146826977 256)) .cse1) (and (= (mod ~y$r_buff1_thd2~0_In2146826977 256) 0) .cse1))) (= |P1Thread1of1ForFork1_#t~ite30_Out2146826977| |P1Thread1of1ForFork1_#t~ite29_Out2146826977|) (= ~y$r_buff1_thd2~0_In2146826977 |P1Thread1of1ForFork1_#t~ite29_Out2146826977|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2146826977, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In2146826977|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2146826977, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2146826977, ~weak$$choice2~0=~weak$$choice2~0_In2146826977, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2146826977} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2146826977, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out2146826977|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out2146826977|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2146826977, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2146826977, ~weak$$choice2~0=~weak$$choice2~0_In2146826977, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2146826977} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 20:27:44,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-1917491154 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1917491154 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-1917491154 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-1917491154 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1917491154|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd1~0_In-1917491154 |P0Thread1of1ForFork0_#t~ite8_Out-1917491154|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1917491154, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1917491154, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1917491154, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1917491154} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1917491154, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1917491154, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1917491154|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1917491154, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1917491154} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 20:27:44,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L742-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_7 (+ v_~__unbuffered_cnt~0_8 1)) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_16) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_16, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 20:27:44,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L770-->L774: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~y~0_15 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_15} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 20:27:44,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L774-2-->L774-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In-1400677839 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1400677839 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out-1400677839| ~y$w_buff1~0_In-1400677839) (not .cse1)) (and (or .cse0 .cse1) (= ~y~0_In-1400677839 |P1Thread1of1ForFork1_#t~ite32_Out-1400677839|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1400677839, ~y$w_buff1~0=~y$w_buff1~0_In-1400677839, ~y~0=~y~0_In-1400677839, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1400677839} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1400677839, ~y$w_buff1~0=~y$w_buff1~0_In-1400677839, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1400677839|, ~y~0=~y~0_In-1400677839, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1400677839} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 20:27:44,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L774-4-->L775: Formula: (= v_~y~0_16 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~y~0=v_~y~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-27 20:27:44,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In863988401 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In863988401 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out863988401|) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out863988401| ~y$w_buff0_used~0_In863988401)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In863988401, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In863988401} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In863988401, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In863988401, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out863988401|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 20:27:44,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-296516821 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-296516821 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-296516821 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-296516821 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out-296516821| ~y$w_buff1_used~0_In-296516821)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork1_#t~ite35_Out-296516821| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-296516821, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-296516821, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-296516821, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-296516821} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-296516821, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-296516821, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-296516821, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-296516821|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-296516821} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 20:27:44,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1825601230 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1825601230 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In1825601230 |P1Thread1of1ForFork1_#t~ite36_Out1825601230|)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out1825601230|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1825601230, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1825601230} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1825601230, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1825601230, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1825601230|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 20:27:44,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L778-->L778-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-517161794 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-517161794 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-517161794 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-517161794 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out-517161794| 0)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out-517161794| ~y$r_buff1_thd2~0_In-517161794) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-517161794, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-517161794, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-517161794, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-517161794} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-517161794, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-517161794, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-517161794, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-517161794|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-517161794} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 20:27:44,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_45 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_45, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 20:27:44,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= 0 (mod v_~y$w_buff0_used~0_82 256)) (= (mod v_~y$r_buff0_thd0~0_17 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_82, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_17, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_82, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_17, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 20:27:44,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In788639601 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In788639601 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out788639601| ~y~0_In788639601)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out788639601| ~y$w_buff1~0_In788639601)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In788639601, ~y~0=~y~0_In788639601, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In788639601, ~y$w_buff1_used~0=~y$w_buff1_used~0_In788639601} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out788639601|, ~y$w_buff1~0=~y$w_buff1~0_In788639601, ~y~0=~y~0_In788639601, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In788639601, ~y$w_buff1_used~0=~y$w_buff1_used~0_In788639601} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 20:27:44,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L805-4-->L806: Formula: (= v_~y~0_18 |v_ULTIMATE.start_main_#t~ite40_7|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-27 20:27:44,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1991399956 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1991399956 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite42_Out1991399956|)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1991399956 |ULTIMATE.start_main_#t~ite42_Out1991399956|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1991399956, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1991399956} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1991399956, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1991399956, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1991399956|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 20:27:44,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L807-->L807-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-752209158 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-752209158 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-752209158 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-752209158 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out-752209158|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-752209158 |ULTIMATE.start_main_#t~ite43_Out-752209158|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-752209158, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-752209158, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-752209158, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-752209158} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-752209158, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-752209158, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-752209158|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-752209158, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-752209158} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 20:27:44,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1718633721 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1718633721 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1718633721|)) (and (= ~y$r_buff0_thd0~0_In-1718633721 |ULTIMATE.start_main_#t~ite44_Out-1718633721|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1718633721, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1718633721} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1718633721, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1718633721, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1718633721|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 20:27:44,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-520837177 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-520837177 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-520837177 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-520837177 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-520837177|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In-520837177 |ULTIMATE.start_main_#t~ite45_Out-520837177|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-520837177, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-520837177, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-520837177, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-520837177} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-520837177, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-520837177, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-520837177, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-520837177|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-520837177} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 20:27:44,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_main_#t~ite45_10| v_~y$r_buff1_thd0~0_14) (= 2 v_~__unbuffered_p1_EAX~0_7) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~main$tmp_guard1~0_7 0) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= 2 v_~x~0_9) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~x~0=v_~x~0_9, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~x~0=v_~x~0_9, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_14, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_9|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:27:44,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:27:44 BasicIcfg [2019-12-27 20:27:44,198 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:27:44,202 INFO L168 Benchmark]: Toolchain (without parser) took 19725.86 ms. Allocated memory was 141.0 MB in the beginning and 719.3 MB in the end (delta: 578.3 MB). Free memory was 104.8 MB in the beginning and 317.9 MB in the end (delta: -213.1 MB). Peak memory consumption was 365.2 MB. Max. memory is 7.1 GB. [2019-12-27 20:27:44,203 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 141.0 MB. Free memory was 124.2 MB in the beginning and 124.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 20:27:44,204 INFO L168 Benchmark]: CACSL2BoogieTranslator took 744.49 ms. Allocated memory was 141.0 MB in the beginning and 203.9 MB in the end (delta: 62.9 MB). Free memory was 104.3 MB in the beginning and 158.4 MB in the end (delta: -54.1 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-12-27 20:27:44,204 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.75 ms. Allocated memory is still 203.9 MB. Free memory was 158.4 MB in the beginning and 155.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-27 20:27:44,208 INFO L168 Benchmark]: Boogie Preprocessor took 37.73 ms. Allocated memory is still 203.9 MB. Free memory was 155.9 MB in the beginning and 153.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-27 20:27:44,209 INFO L168 Benchmark]: RCFGBuilder took 743.34 ms. Allocated memory is still 203.9 MB. Free memory was 153.4 MB in the beginning and 109.7 MB in the end (delta: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 7.1 GB. [2019-12-27 20:27:44,210 INFO L168 Benchmark]: TraceAbstraction took 18126.17 ms. Allocated memory was 203.9 MB in the beginning and 719.3 MB in the end (delta: 515.4 MB). Free memory was 109.1 MB in the beginning and 317.9 MB in the end (delta: -208.8 MB). Peak memory consumption was 306.6 MB. Max. memory is 7.1 GB. [2019-12-27 20:27:44,218 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.52 ms. Allocated memory is still 141.0 MB. Free memory was 124.2 MB in the beginning and 124.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 744.49 ms. Allocated memory was 141.0 MB in the beginning and 203.9 MB in the end (delta: 62.9 MB). Free memory was 104.3 MB in the beginning and 158.4 MB in the end (delta: -54.1 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.75 ms. Allocated memory is still 203.9 MB. Free memory was 158.4 MB in the beginning and 155.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.73 ms. Allocated memory is still 203.9 MB. Free memory was 155.9 MB in the beginning and 153.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 743.34 ms. Allocated memory is still 203.9 MB. Free memory was 153.4 MB in the beginning and 109.7 MB in the end (delta: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18126.17 ms. Allocated memory was 203.9 MB in the beginning and 719.3 MB in the end (delta: 515.4 MB). Free memory was 109.1 MB in the beginning and 317.9 MB in the end (delta: -208.8 MB). Peak memory consumption was 306.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.6s, 147 ProgramPointsBefore, 79 ProgramPointsAfterwards, 181 TransitionsBefore, 89 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 8 FixpointIterations, 29 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 27 ChoiceCompositions, 4371 VarBasedMoverChecksPositive, 158 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 55625 CheckedPairsTotal, 98 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t593, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L799] FCALL, FORK 0 pthread_create(&t594, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 2 [L755] 2 __unbuffered_p1_EAX = x [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L762] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L763] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L764] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L765] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L776] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L777] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L807] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L808] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 17.8s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2260 SDtfs, 2711 SDslu, 5052 SDs, 0 SdLazy, 4113 SolverSat, 217 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 176 GetRequests, 58 SyntacticMatches, 18 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12389occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 11677 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 555 NumberOfCodeBlocks, 555 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 486 ConstructedInterpolants, 0 QuantifiedInterpolants, 56896 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...