/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix045_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:35:08,090 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:35:08,092 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:35:08,105 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:35:08,105 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:35:08,106 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:35:08,107 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:35:08,109 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:35:08,111 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:35:08,112 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:35:08,113 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:35:08,114 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:35:08,114 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:35:08,115 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:35:08,116 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:35:08,118 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:35:08,118 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:35:08,119 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:35:08,121 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:35:08,123 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:35:08,125 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:35:08,126 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:35:08,127 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:35:08,128 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:35:08,130 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:35:08,130 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:35:08,131 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:35:08,132 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:35:08,133 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:35:08,134 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:35:08,134 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:35:08,137 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:35:08,139 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:35:08,140 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:35:08,142 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:35:08,143 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:35:08,144 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:35:08,144 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:35:08,144 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:35:08,145 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:35:08,149 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:35:08,150 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 06:35:08,173 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:35:08,173 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:35:08,175 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:35:08,176 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:35:08,176 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:35:08,176 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:35:08,176 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:35:08,177 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:35:08,177 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:35:08,177 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:35:08,178 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:35:08,178 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:35:08,179 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:35:08,179 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:35:08,179 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:35:08,179 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:35:08,179 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:35:08,180 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:35:08,180 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:35:08,180 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:35:08,180 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:35:08,180 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:35:08,181 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:35:08,181 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:35:08,181 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:35:08,181 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:35:08,181 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:35:08,182 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:35:08,182 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:35:08,182 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:35:08,460 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:35:08,477 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:35:08,480 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:35:08,482 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:35:08,482 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:35:08,483 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_power.opt.i [2019-12-27 06:35:08,561 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91a6e525f/6bba7371e46f47f38572325af633d708/FLAG1b448f1b7 [2019-12-27 06:35:09,098 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:35:09,099 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_power.opt.i [2019-12-27 06:35:09,117 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91a6e525f/6bba7371e46f47f38572325af633d708/FLAG1b448f1b7 [2019-12-27 06:35:09,376 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91a6e525f/6bba7371e46f47f38572325af633d708 [2019-12-27 06:35:09,385 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:35:09,387 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:35:09,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:35:09,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:35:09,391 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:35:09,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:35:09" (1/1) ... [2019-12-27 06:35:09,395 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a3a9b46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:35:09, skipping insertion in model container [2019-12-27 06:35:09,396 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:35:09" (1/1) ... [2019-12-27 06:35:09,403 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:35:09,474 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:35:10,126 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:35:10,146 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:35:10,248 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:35:10,328 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:35:10,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:35:10 WrapperNode [2019-12-27 06:35:10,328 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:35:10,329 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:35:10,329 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:35:10,330 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:35:10,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:35:10" (1/1) ... [2019-12-27 06:35:10,372 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:35:10" (1/1) ... [2019-12-27 06:35:10,410 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:35:10,412 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:35:10,412 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:35:10,412 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:35:10,425 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:35:10" (1/1) ... [2019-12-27 06:35:10,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:35:10" (1/1) ... [2019-12-27 06:35:10,431 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:35:10" (1/1) ... [2019-12-27 06:35:10,431 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:35:10" (1/1) ... [2019-12-27 06:35:10,444 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:35:10" (1/1) ... [2019-12-27 06:35:10,448 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:35:10" (1/1) ... [2019-12-27 06:35:10,451 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:35:10" (1/1) ... [2019-12-27 06:35:10,456 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:35:10,463 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:35:10,463 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:35:10,464 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:35:10,465 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:35:10" (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 06:35:10,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:35:10,524 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:35:10,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:35:10,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:35:10,524 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:35:10,525 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:35:10,525 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:35:10,526 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:35:10,526 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:35:10,527 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:35:10,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:35:10,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:35:10,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:35:10,530 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 06:35:11,301 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:35:11,301 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:35:11,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:35:11 BoogieIcfgContainer [2019-12-27 06:35:11,303 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:35:11,304 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:35:11,304 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:35:11,307 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:35:11,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:35:09" (1/3) ... [2019-12-27 06:35:11,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@539b8ec7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:35:11, skipping insertion in model container [2019-12-27 06:35:11,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:35:10" (2/3) ... [2019-12-27 06:35:11,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@539b8ec7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:35:11, skipping insertion in model container [2019-12-27 06:35:11,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:35:11" (3/3) ... [2019-12-27 06:35:11,312 INFO L109 eAbstractionObserver]: Analyzing ICFG mix045_power.opt.i [2019-12-27 06:35:11,322 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:35:11,323 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:35:11,330 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:35:11,331 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:35:11,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,368 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,368 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,370 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,370 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,378 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,379 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,379 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,379 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,380 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,391 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,392 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,392 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,397 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,397 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,400 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,418 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:11,436 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 06:35:11,457 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:35:11,457 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:35:11,457 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:35:11,457 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:35:11,457 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:35:11,458 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:35:11,458 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:35:11,458 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:35:11,475 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-27 06:35:11,478 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 06:35:11,588 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 06:35:11,588 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:35:11,602 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 272 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 06:35:11,621 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 06:35:11,713 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 06:35:11,714 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:35:11,719 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 272 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 06:35:11,732 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-27 06:35:11,734 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:35:15,356 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 06:35:15,503 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 06:35:15,534 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48939 [2019-12-27 06:35:15,535 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-27 06:35:15,538 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 93 transitions [2019-12-27 06:35:16,543 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 17702 states. [2019-12-27 06:35:16,545 INFO L276 IsEmpty]: Start isEmpty. Operand 17702 states. [2019-12-27 06:35:16,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 06:35:16,551 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:35:16,552 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:35:16,552 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:35:16,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:35:16,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1021258717, now seen corresponding path program 1 times [2019-12-27 06:35:16,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:35:16,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198929108] [2019-12-27 06:35:16,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:35:16,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:35:16,830 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 06:35:16,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198929108] [2019-12-27 06:35:16,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:35:16,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:35:16,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57960632] [2019-12-27 06:35:16,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:35:16,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:35:16,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:35:16,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:35:16,856 INFO L87 Difference]: Start difference. First operand 17702 states. Second operand 3 states. [2019-12-27 06:35:17,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:35:17,432 INFO L93 Difference]: Finished difference Result 17518 states and 65786 transitions. [2019-12-27 06:35:17,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:35:17,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 06:35:17,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:35:17,612 INFO L225 Difference]: With dead ends: 17518 [2019-12-27 06:35:17,612 INFO L226 Difference]: Without dead ends: 17154 [2019-12-27 06:35:17,614 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 06:35:17,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17154 states. [2019-12-27 06:35:18,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17154 to 17154. [2019-12-27 06:35:18,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17154 states. [2019-12-27 06:35:18,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17154 states to 17154 states and 64484 transitions. [2019-12-27 06:35:18,477 INFO L78 Accepts]: Start accepts. Automaton has 17154 states and 64484 transitions. Word has length 7 [2019-12-27 06:35:18,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:35:18,478 INFO L462 AbstractCegarLoop]: Abstraction has 17154 states and 64484 transitions. [2019-12-27 06:35:18,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:35:18,479 INFO L276 IsEmpty]: Start isEmpty. Operand 17154 states and 64484 transitions. [2019-12-27 06:35:18,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:35:18,491 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:35:18,491 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:35:18,491 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:35:18,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:35:18,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1042029575, now seen corresponding path program 1 times [2019-12-27 06:35:18,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:35:18,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082322852] [2019-12-27 06:35:18,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:35:18,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:35:18,677 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 06:35:18,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082322852] [2019-12-27 06:35:18,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:35:18,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:35:18,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689907720] [2019-12-27 06:35:18,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:35:18,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:35:18,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:35:18,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:35:18,682 INFO L87 Difference]: Start difference. First operand 17154 states and 64484 transitions. Second operand 4 states. [2019-12-27 06:35:20,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:35:20,389 INFO L93 Difference]: Finished difference Result 26570 states and 95594 transitions. [2019-12-27 06:35:20,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:35:20,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 06:35:20,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:35:20,502 INFO L225 Difference]: With dead ends: 26570 [2019-12-27 06:35:20,502 INFO L226 Difference]: Without dead ends: 26556 [2019-12-27 06:35:20,504 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 06:35:20,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26556 states. [2019-12-27 06:35:21,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26556 to 24300. [2019-12-27 06:35:21,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24300 states. [2019-12-27 06:35:21,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24300 states to 24300 states and 88453 transitions. [2019-12-27 06:35:21,422 INFO L78 Accepts]: Start accepts. Automaton has 24300 states and 88453 transitions. Word has length 13 [2019-12-27 06:35:21,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:35:21,422 INFO L462 AbstractCegarLoop]: Abstraction has 24300 states and 88453 transitions. [2019-12-27 06:35:21,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:35:21,423 INFO L276 IsEmpty]: Start isEmpty. Operand 24300 states and 88453 transitions. [2019-12-27 06:35:21,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:35:21,424 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:35:21,425 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:35:21,425 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:35:21,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:35:21,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1362987190, now seen corresponding path program 1 times [2019-12-27 06:35:21,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:35:21,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012946688] [2019-12-27 06:35:21,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:35:21,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:35:21,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 06:35:21,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012946688] [2019-12-27 06:35:21,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:35:21,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:35:21,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621760927] [2019-12-27 06:35:21,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:35:21,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:35:21,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:35:21,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:35:21,476 INFO L87 Difference]: Start difference. First operand 24300 states and 88453 transitions. Second operand 3 states. [2019-12-27 06:35:21,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:35:21,538 INFO L93 Difference]: Finished difference Result 13809 states and 43497 transitions. [2019-12-27 06:35:21,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:35:21,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 06:35:21,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:35:21,601 INFO L225 Difference]: With dead ends: 13809 [2019-12-27 06:35:21,601 INFO L226 Difference]: Without dead ends: 13809 [2019-12-27 06:35:21,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:35:21,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13809 states. [2019-12-27 06:35:22,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13809 to 13809. [2019-12-27 06:35:22,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13809 states. [2019-12-27 06:35:22,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13809 states to 13809 states and 43497 transitions. [2019-12-27 06:35:22,193 INFO L78 Accepts]: Start accepts. Automaton has 13809 states and 43497 transitions. Word has length 13 [2019-12-27 06:35:22,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:35:22,193 INFO L462 AbstractCegarLoop]: Abstraction has 13809 states and 43497 transitions. [2019-12-27 06:35:22,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:35:22,194 INFO L276 IsEmpty]: Start isEmpty. Operand 13809 states and 43497 transitions. [2019-12-27 06:35:22,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 06:35:22,195 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:35:22,195 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:35:22,195 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:35:22,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:35:22,196 INFO L82 PathProgramCache]: Analyzing trace with hash -824782782, now seen corresponding path program 1 times [2019-12-27 06:35:22,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:35:22,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313144379] [2019-12-27 06:35:22,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:35:22,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:35:22,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:35:22,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313144379] [2019-12-27 06:35:22,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:35:22,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:35:22,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479668635] [2019-12-27 06:35:22,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:35:22,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:35:22,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:35:22,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:35:22,242 INFO L87 Difference]: Start difference. First operand 13809 states and 43497 transitions. Second operand 4 states. [2019-12-27 06:35:22,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:35:22,266 INFO L93 Difference]: Finished difference Result 2006 states and 4674 transitions. [2019-12-27 06:35:22,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:35:22,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 06:35:22,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:35:22,271 INFO L225 Difference]: With dead ends: 2006 [2019-12-27 06:35:22,271 INFO L226 Difference]: Without dead ends: 2006 [2019-12-27 06:35:22,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:35:22,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2006 states. [2019-12-27 06:35:22,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2006 to 2006. [2019-12-27 06:35:22,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2006 states. [2019-12-27 06:35:22,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2006 states to 2006 states and 4674 transitions. [2019-12-27 06:35:22,306 INFO L78 Accepts]: Start accepts. Automaton has 2006 states and 4674 transitions. Word has length 14 [2019-12-27 06:35:22,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:35:22,306 INFO L462 AbstractCegarLoop]: Abstraction has 2006 states and 4674 transitions. [2019-12-27 06:35:22,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:35:22,307 INFO L276 IsEmpty]: Start isEmpty. Operand 2006 states and 4674 transitions. [2019-12-27 06:35:22,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 06:35:22,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:35:22,309 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 06:35:22,309 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:35:22,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:35:22,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1888947731, now seen corresponding path program 1 times [2019-12-27 06:35:22,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:35:22,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631903370] [2019-12-27 06:35:22,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:35:22,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:35:22,425 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 06:35:22,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631903370] [2019-12-27 06:35:22,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:35:22,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:35:22,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214746851] [2019-12-27 06:35:22,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:35:22,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:35:22,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:35:22,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:35:22,428 INFO L87 Difference]: Start difference. First operand 2006 states and 4674 transitions. Second operand 5 states. [2019-12-27 06:35:22,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:35:22,452 INFO L93 Difference]: Finished difference Result 653 states and 1533 transitions. [2019-12-27 06:35:22,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:35:22,453 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 06:35:22,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:35:22,454 INFO L225 Difference]: With dead ends: 653 [2019-12-27 06:35:22,454 INFO L226 Difference]: Without dead ends: 653 [2019-12-27 06:35:22,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:35:22,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-12-27 06:35:22,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 597. [2019-12-27 06:35:22,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-12-27 06:35:22,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 1401 transitions. [2019-12-27 06:35:22,465 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 1401 transitions. Word has length 26 [2019-12-27 06:35:22,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:35:22,466 INFO L462 AbstractCegarLoop]: Abstraction has 597 states and 1401 transitions. [2019-12-27 06:35:22,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:35:22,466 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1401 transitions. [2019-12-27 06:35:22,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 06:35:22,469 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:35:22,469 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:35:22,469 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:35:22,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:35:22,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1558229958, now seen corresponding path program 1 times [2019-12-27 06:35:22,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:35:22,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194778043] [2019-12-27 06:35:22,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:35:22,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:35:22,547 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 06:35:22,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194778043] [2019-12-27 06:35:22,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:35:22,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:35:22,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689604316] [2019-12-27 06:35:22,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:35:22,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:35:22,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:35:22,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:35:22,550 INFO L87 Difference]: Start difference. First operand 597 states and 1401 transitions. Second operand 3 states. [2019-12-27 06:35:22,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:35:22,595 INFO L93 Difference]: Finished difference Result 609 states and 1418 transitions. [2019-12-27 06:35:22,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:35:22,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 06:35:22,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:35:22,596 INFO L225 Difference]: With dead ends: 609 [2019-12-27 06:35:22,597 INFO L226 Difference]: Without dead ends: 609 [2019-12-27 06:35:22,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:35:22,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-12-27 06:35:22,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 605. [2019-12-27 06:35:22,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-27 06:35:22,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1414 transitions. [2019-12-27 06:35:22,609 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1414 transitions. Word has length 55 [2019-12-27 06:35:22,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:35:22,609 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1414 transitions. [2019-12-27 06:35:22,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:35:22,610 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1414 transitions. [2019-12-27 06:35:22,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 06:35:22,611 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:35:22,612 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:35:22,612 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:35:22,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:35:22,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1993278178, now seen corresponding path program 1 times [2019-12-27 06:35:22,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:35:22,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517837252] [2019-12-27 06:35:22,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:35:22,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:35:22,680 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 06:35:22,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517837252] [2019-12-27 06:35:22,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:35:22,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:35:22,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433639726] [2019-12-27 06:35:22,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:35:22,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:35:22,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:35:22,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:35:22,683 INFO L87 Difference]: Start difference. First operand 605 states and 1414 transitions. Second operand 3 states. [2019-12-27 06:35:22,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:35:22,728 INFO L93 Difference]: Finished difference Result 609 states and 1411 transitions. [2019-12-27 06:35:22,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:35:22,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 06:35:22,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:35:22,730 INFO L225 Difference]: With dead ends: 609 [2019-12-27 06:35:22,730 INFO L226 Difference]: Without dead ends: 609 [2019-12-27 06:35:22,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:35:22,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-12-27 06:35:22,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 605. [2019-12-27 06:35:22,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-27 06:35:22,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1407 transitions. [2019-12-27 06:35:22,740 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1407 transitions. Word has length 55 [2019-12-27 06:35:22,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:35:22,741 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1407 transitions. [2019-12-27 06:35:22,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:35:22,741 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1407 transitions. [2019-12-27 06:35:22,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 06:35:22,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:35:22,743 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:35:22,743 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:35:22,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:35:22,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1988838358, now seen corresponding path program 1 times [2019-12-27 06:35:22,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:35:22,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753767151] [2019-12-27 06:35:22,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:35:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:35:22,834 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 06:35:22,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753767151] [2019-12-27 06:35:22,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:35:22,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:35:22,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710795870] [2019-12-27 06:35:22,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:35:22,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:35:22,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:35:22,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:35:22,837 INFO L87 Difference]: Start difference. First operand 605 states and 1407 transitions. Second operand 5 states. [2019-12-27 06:35:23,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:35:23,062 INFO L93 Difference]: Finished difference Result 894 states and 2079 transitions. [2019-12-27 06:35:23,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:35:23,062 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-27 06:35:23,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:35:23,064 INFO L225 Difference]: With dead ends: 894 [2019-12-27 06:35:23,064 INFO L226 Difference]: Without dead ends: 894 [2019-12-27 06:35:23,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:35:23,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2019-12-27 06:35:23,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 719. [2019-12-27 06:35:23,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2019-12-27 06:35:23,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1688 transitions. [2019-12-27 06:35:23,078 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1688 transitions. Word has length 55 [2019-12-27 06:35:23,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:35:23,078 INFO L462 AbstractCegarLoop]: Abstraction has 719 states and 1688 transitions. [2019-12-27 06:35:23,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:35:23,079 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1688 transitions. [2019-12-27 06:35:23,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 06:35:23,087 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:35:23,088 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:35:23,088 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:35:23,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:35:23,088 INFO L82 PathProgramCache]: Analyzing trace with hash -2112589232, now seen corresponding path program 2 times [2019-12-27 06:35:23,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:35:23,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84684899] [2019-12-27 06:35:23,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:35:23,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:35:23,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:35:23,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84684899] [2019-12-27 06:35:23,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:35:23,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:35:23,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121937732] [2019-12-27 06:35:23,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:35:23,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:35:23,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:35:23,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:35:23,240 INFO L87 Difference]: Start difference. First operand 719 states and 1688 transitions. Second operand 6 states. [2019-12-27 06:35:23,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:35:23,643 INFO L93 Difference]: Finished difference Result 990 states and 2305 transitions. [2019-12-27 06:35:23,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:35:23,647 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-27 06:35:23,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:35:23,648 INFO L225 Difference]: With dead ends: 990 [2019-12-27 06:35:23,648 INFO L226 Difference]: Without dead ends: 990 [2019-12-27 06:35:23,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:35:23,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2019-12-27 06:35:23,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 781. [2019-12-27 06:35:23,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2019-12-27 06:35:23,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1833 transitions. [2019-12-27 06:35:23,662 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1833 transitions. Word has length 55 [2019-12-27 06:35:23,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:35:23,662 INFO L462 AbstractCegarLoop]: Abstraction has 781 states and 1833 transitions. [2019-12-27 06:35:23,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:35:23,663 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1833 transitions. [2019-12-27 06:35:23,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 06:35:23,665 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:35:23,665 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:35:23,665 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:35:23,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:35:23,666 INFO L82 PathProgramCache]: Analyzing trace with hash 187307682, now seen corresponding path program 3 times [2019-12-27 06:35:23,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:35:23,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623743904] [2019-12-27 06:35:23,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:35:23,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:35:23,766 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 06:35:23,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623743904] [2019-12-27 06:35:23,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:35:23,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:35:23,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782085783] [2019-12-27 06:35:23,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:35:23,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:35:23,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:35:23,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:35:23,769 INFO L87 Difference]: Start difference. First operand 781 states and 1833 transitions. Second operand 6 states. [2019-12-27 06:35:24,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:35:24,144 INFO L93 Difference]: Finished difference Result 1298 states and 3014 transitions. [2019-12-27 06:35:24,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:35:24,144 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-27 06:35:24,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:35:24,146 INFO L225 Difference]: With dead ends: 1298 [2019-12-27 06:35:24,146 INFO L226 Difference]: Without dead ends: 1298 [2019-12-27 06:35:24,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:35:24,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2019-12-27 06:35:24,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 841. [2019-12-27 06:35:24,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2019-12-27 06:35:24,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1983 transitions. [2019-12-27 06:35:24,164 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1983 transitions. Word has length 55 [2019-12-27 06:35:24,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:35:24,165 INFO L462 AbstractCegarLoop]: Abstraction has 841 states and 1983 transitions. [2019-12-27 06:35:24,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:35:24,165 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1983 transitions. [2019-12-27 06:35:24,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 06:35:24,168 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:35:24,168 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:35:24,168 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:35:24,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:35:24,169 INFO L82 PathProgramCache]: Analyzing trace with hash 869164756, now seen corresponding path program 4 times [2019-12-27 06:35:24,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:35:24,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802781824] [2019-12-27 06:35:24,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:35:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:35:24,284 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 06:35:24,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802781824] [2019-12-27 06:35:24,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:35:24,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:35:24,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841409619] [2019-12-27 06:35:24,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:35:24,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:35:24,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:35:24,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:35:24,289 INFO L87 Difference]: Start difference. First operand 841 states and 1983 transitions. Second operand 3 states. [2019-12-27 06:35:24,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:35:24,308 INFO L93 Difference]: Finished difference Result 739 states and 1700 transitions. [2019-12-27 06:35:24,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:35:24,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 06:35:24,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:35:24,311 INFO L225 Difference]: With dead ends: 739 [2019-12-27 06:35:24,312 INFO L226 Difference]: Without dead ends: 739 [2019-12-27 06:35:24,312 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 06:35:24,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2019-12-27 06:35:24,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2019-12-27 06:35:24,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2019-12-27 06:35:24,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1700 transitions. [2019-12-27 06:35:24,332 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1700 transitions. Word has length 55 [2019-12-27 06:35:24,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:35:24,332 INFO L462 AbstractCegarLoop]: Abstraction has 739 states and 1700 transitions. [2019-12-27 06:35:24,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:35:24,333 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1700 transitions. [2019-12-27 06:35:24,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 06:35:24,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:35:24,335 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:35:24,336 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:35:24,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:35:24,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1505935980, now seen corresponding path program 1 times [2019-12-27 06:35:24,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:35:24,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123117860] [2019-12-27 06:35:24,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:35:24,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:35:24,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:35:24,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123117860] [2019-12-27 06:35:24,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:35:24,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:35:24,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408911750] [2019-12-27 06:35:24,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:35:24,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:35:24,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:35:24,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:35:24,541 INFO L87 Difference]: Start difference. First operand 739 states and 1700 transitions. Second operand 6 states. [2019-12-27 06:35:24,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:35:24,630 INFO L93 Difference]: Finished difference Result 1225 states and 2651 transitions. [2019-12-27 06:35:24,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:35:24,631 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-27 06:35:24,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:35:24,632 INFO L225 Difference]: With dead ends: 1225 [2019-12-27 06:35:24,632 INFO L226 Difference]: Without dead ends: 481 [2019-12-27 06:35:24,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:35:24,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2019-12-27 06:35:24,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 421. [2019-12-27 06:35:24,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-12-27 06:35:24,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 760 transitions. [2019-12-27 06:35:24,643 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 760 transitions. Word has length 56 [2019-12-27 06:35:24,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:35:24,644 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 760 transitions. [2019-12-27 06:35:24,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:35:24,645 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 760 transitions. [2019-12-27 06:35:24,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 06:35:24,646 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:35:24,646 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:35:24,647 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:35:24,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:35:24,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1676967486, now seen corresponding path program 2 times [2019-12-27 06:35:24,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:35:24,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971665144] [2019-12-27 06:35:24,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:35:24,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:35:24,776 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 06:35:24,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971665144] [2019-12-27 06:35:24,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:35:24,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:35:24,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596110019] [2019-12-27 06:35:24,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:35:24,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:35:24,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:35:24,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:35:24,779 INFO L87 Difference]: Start difference. First operand 421 states and 760 transitions. Second operand 3 states. [2019-12-27 06:35:24,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:35:24,828 INFO L93 Difference]: Finished difference Result 421 states and 759 transitions. [2019-12-27 06:35:24,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:35:24,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-27 06:35:24,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:35:24,829 INFO L225 Difference]: With dead ends: 421 [2019-12-27 06:35:24,829 INFO L226 Difference]: Without dead ends: 421 [2019-12-27 06:35:24,829 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 06:35:24,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-12-27 06:35:24,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 280. [2019-12-27 06:35:24,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-12-27 06:35:24,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 501 transitions. [2019-12-27 06:35:24,836 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 501 transitions. Word has length 56 [2019-12-27 06:35:24,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:35:24,836 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 501 transitions. [2019-12-27 06:35:24,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:35:24,836 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 501 transitions. [2019-12-27 06:35:24,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:35:24,837 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:35:24,837 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:35:24,837 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:35:24,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:35:24,838 INFO L82 PathProgramCache]: Analyzing trace with hash 776087573, now seen corresponding path program 1 times [2019-12-27 06:35:24,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:35:24,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516809360] [2019-12-27 06:35:24,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:35:24,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:35:25,199 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 06:35:25,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516809360] [2019-12-27 06:35:25,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:35:25,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 06:35:25,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478579696] [2019-12-27 06:35:25,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 06:35:25,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:35:25,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 06:35:25,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-12-27 06:35:25,201 INFO L87 Difference]: Start difference. First operand 280 states and 501 transitions. Second operand 15 states. [2019-12-27 06:35:25,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:35:25,855 INFO L93 Difference]: Finished difference Result 440 states and 760 transitions. [2019-12-27 06:35:25,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 06:35:25,855 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2019-12-27 06:35:25,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:35:25,856 INFO L225 Difference]: With dead ends: 440 [2019-12-27 06:35:25,857 INFO L226 Difference]: Without dead ends: 406 [2019-12-27 06:35:25,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2019-12-27 06:35:25,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-12-27 06:35:25,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 388. [2019-12-27 06:35:25,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-12-27 06:35:25,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 686 transitions. [2019-12-27 06:35:25,866 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 686 transitions. Word has length 57 [2019-12-27 06:35:25,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:35:25,866 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 686 transitions. [2019-12-27 06:35:25,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 06:35:25,866 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 686 transitions. [2019-12-27 06:35:25,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:35:25,868 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:35:25,868 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:35:25,869 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:35:25,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:35:25,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1732220053, now seen corresponding path program 2 times [2019-12-27 06:35:25,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:35:25,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999202912] [2019-12-27 06:35:25,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:35:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:35:25,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:35:25,995 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:35:25,995 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:35:25,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 v_~y$w_buff1~0_26) (= v_~__unbuffered_p2_EBX~0_10 0) (= v_~y$r_buff0_thd2~0_20 0) (= v_~main$tmp_guard0~0_9 0) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t1196~0.base_25| 1)) (= v_~a~0_11 0) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~main$tmp_guard1~0_11 0) (= 0 v_~y$r_buff1_thd0~0_51) (= v_~y$w_buff0_used~0_108 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~y$flush_delayed~0_14) (= v_~y$r_buff0_thd3~0_26 0) (= 0 v_~y$w_buff0~0_29) (= v_~y$r_buff1_thd1~0_9 0) (= 0 v_~__unbuffered_p2_EAX~0_10) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~y$r_buff0_thd0~0_80 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1196~0.base_25|) (= 0 v_~y$read_delayed_var~0.base_7) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1196~0.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1196~0.base_25|) |v_ULTIMATE.start_main_~#t1196~0.offset_19| 0)) |v_#memory_int_21|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1196~0.base_25| 4) |v_#length_23|) (= 0 v_~y$r_buff1_thd2~0_17) (= 0 v_~z~0_9) (= 0 v_~__unbuffered_cnt~0_22) (= (select .cse0 |v_ULTIMATE.start_main_~#t1196~0.base_25|) 0) (= 0 |v_ULTIMATE.start_main_~#t1196~0.offset_19|) (= v_~y$mem_tmp~0_10 0) (= v_~x~0_12 0) (= v_~y$w_buff1_used~0_69 0) (= 0 v_~y$r_buff1_thd3~0_19) (= v_~y~0_26 0) (= v_~y$r_buff0_thd1~0_6 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_13|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_12|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_10|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_13|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_11, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_6, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ULTIMATE.start_main_~#t1197~0.base=|v_ULTIMATE.start_main_~#t1197~0.base_25|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_12|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_14|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_8|, ULTIMATE.start_main_~#t1198~0.base=|v_ULTIMATE.start_main_~#t1198~0.base_25|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_15|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_13|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_12|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_14|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~y$w_buff1~0=v_~y$w_buff1~0_26, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_20, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_51, ~x~0=v_~x~0_12, ~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_108, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_15|, ULTIMATE.start_main_~#t1196~0.offset=|v_ULTIMATE.start_main_~#t1196~0.offset_19|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_12|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_17|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_10|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_15|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_9, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_12|, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y~0=v_~y~0_26, ULTIMATE.start_main_~#t1198~0.offset=|v_ULTIMATE.start_main_~#t1198~0.offset_19|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_12|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_8|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_14|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_13|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_~#t1197~0.offset=|v_ULTIMATE.start_main_~#t1197~0.offset_19|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_80, ULTIMATE.start_main_~#t1196~0.base=|v_ULTIMATE.start_main_~#t1196~0.base_25|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_69} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1197~0.base, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_~#t1198~0.base, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t1196~0.offset, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t1198~0.offset, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1197~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ULTIMATE.start_main_~#t1196~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 06:35:26,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L810-1-->L812: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1197~0.base_13|)) (= |v_ULTIMATE.start_main_~#t1197~0.offset_11| 0) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1197~0.base_13| 1)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1197~0.base_13| 4) |v_#length_17|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1197~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1197~0.base_13|) |v_ULTIMATE.start_main_~#t1197~0.offset_11| 1)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1197~0.base_13|) (= (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1197~0.base_13|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1197~0.offset=|v_ULTIMATE.start_main_~#t1197~0.offset_11|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1197~0.base=|v_ULTIMATE.start_main_~#t1197~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1197~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1197~0.base] because there is no mapped edge [2019-12-27 06:35:26,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L812-1-->L814: Formula: (and (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1198~0.base_13| 1) |v_#valid_40|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1198~0.base_13|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1198~0.base_13|)) (not (= |v_ULTIMATE.start_main_~#t1198~0.base_13| 0)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1198~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1198~0.base_13|) |v_ULTIMATE.start_main_~#t1198~0.offset_11| 2))) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1198~0.base_13| 4)) (= |v_ULTIMATE.start_main_~#t1198~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1198~0.offset=|v_ULTIMATE.start_main_~#t1198~0.offset_11|, ULTIMATE.start_main_~#t1198~0.base=|v_ULTIMATE.start_main_~#t1198~0.base_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1198~0.offset, ULTIMATE.start_main_~#t1198~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-27 06:35:26,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] P2ENTRY-->L4-3: Formula: (and (= 0 (mod v_~y$w_buff1_used~0_47 256)) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_4| v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_6) (= 1 v_~y$w_buff0_used~0_77) (= 2 v_~y$w_buff0~0_14) (= v_P2Thread1of1ForFork0_~arg.offset_4 |v_P2Thread1of1ForFork0_#in~arg.offset_4|) (= v_P2Thread1of1ForFork0_~arg.base_4 |v_P2Thread1of1ForFork0_#in~arg.base_4|) (= v_~y$w_buff1_used~0_47 v_~y$w_buff0_used~0_78) (= v_~y$w_buff0~0_15 v_~y$w_buff1~0_14)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff0~0=v_~y$w_buff0~0_15, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_4|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_4, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_4|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_14, ~y$w_buff0~0=v_~y$w_buff0~0_14, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_4, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_4|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_47} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 06:35:26,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] P0ENTRY-->P0EXIT: Formula: (and (= 1 v_~a~0_7) (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 1 v_~x~0_9) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{~a~0=v_~a~0_7, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_9, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 06:35:26,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L788-->L788-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1722110415 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1722110415 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1722110415 |P2Thread1of1ForFork0_#t~ite11_Out-1722110415|)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite11_Out-1722110415|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1722110415, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1722110415} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1722110415, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out-1722110415|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1722110415} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 06:35:26,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L789-->L789-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-1822578526 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-1822578526 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1822578526 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-1822578526 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite12_Out-1822578526| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork0_#t~ite12_Out-1822578526| ~y$w_buff1_used~0_In-1822578526) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1822578526, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1822578526, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1822578526, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1822578526} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1822578526, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1822578526, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out-1822578526|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1822578526, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1822578526} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 06:35:26,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L790-->L791: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In842587771 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In842587771 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd3~0_Out842587771)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In842587771 ~y$r_buff0_thd3~0_Out842587771)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In842587771, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In842587771} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In842587771, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out842587771, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out842587771|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 06:35:26,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L791-->L791-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In231329871 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In231329871 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In231329871 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In231329871 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite14_Out231329871| 0)) (and (= |P2Thread1of1ForFork0_#t~ite14_Out231329871| ~y$r_buff1_thd3~0_In231329871) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In231329871, ~y$w_buff0_used~0=~y$w_buff0_used~0_In231329871, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In231329871, ~y$w_buff1_used~0=~y$w_buff1_used~0_In231329871} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out231329871|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In231329871, ~y$w_buff0_used~0=~y$w_buff0_used~0_In231329871, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In231329871, ~y$w_buff1_used~0=~y$w_buff1_used~0_In231329871} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 06:35:26,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L791-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~y$r_buff1_thd3~0_15 |v_P2Thread1of1ForFork0_#t~ite14_8|)) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_7|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 06:35:26,067 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L752-2-->L752-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-319805130 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-319805130 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite3_Out-319805130| ~y~0_In-319805130) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork2_#t~ite3_Out-319805130| ~y$w_buff1~0_In-319805130) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-319805130, ~y$w_buff1~0=~y$w_buff1~0_In-319805130, ~y~0=~y~0_In-319805130, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-319805130} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-319805130, ~y$w_buff1~0=~y$w_buff1~0_In-319805130, ~y~0=~y~0_In-319805130, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out-319805130|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-319805130} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 06:35:26,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L752-4-->L753: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork2_#t~ite3_8|) InVars {P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_8|} OutVars{P1Thread1of1ForFork2_#t~ite4=|v_P1Thread1of1ForFork2_#t~ite4_7|, ~y~0=v_~y~0_18, P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, ~y~0, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 06:35:26,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L753-->L753-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1845327733 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1845327733 256)))) (or (and (= ~y$w_buff0_used~0_In1845327733 |P1Thread1of1ForFork2_#t~ite5_Out1845327733|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork2_#t~ite5_Out1845327733|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1845327733, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1845327733} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1845327733, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1845327733, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out1845327733|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 06:35:26,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L754-->L754-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-410136254 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-410136254 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-410136254 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-410136254 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite6_Out-410136254|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-410136254 |P1Thread1of1ForFork2_#t~ite6_Out-410136254|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-410136254, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-410136254, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-410136254, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-410136254} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-410136254, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-410136254, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-410136254, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out-410136254|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-410136254} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 06:35:26,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L755-->L755-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1206542505 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1206542505 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite7_Out1206542505|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In1206542505 |P1Thread1of1ForFork2_#t~ite7_Out1206542505|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1206542505, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1206542505} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1206542505, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1206542505, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out1206542505|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 06:35:26,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L756-->L756-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1906712684 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1906712684 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1906712684 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-1906712684 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite8_Out-1906712684| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P1Thread1of1ForFork2_#t~ite8_Out-1906712684| ~y$r_buff1_thd2~0_In-1906712684)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1906712684, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1906712684, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1906712684, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1906712684} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1906712684, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1906712684, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-1906712684|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1906712684, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1906712684} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 06:35:26,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L756-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite8_8| v_~y$r_buff1_thd2~0_13) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 06:35:26,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L814-1-->L820: Formula: (and (= v_~main$tmp_guard0~0_5 1) (= 3 v_~__unbuffered_cnt~0_12)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 06:35:26,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L820-2-->L820-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite19_Out396105491| |ULTIMATE.start_main_#t~ite18_Out396105491|)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In396105491 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In396105491 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite18_Out396105491| ~y$w_buff1~0_In396105491) (not .cse0) .cse1 (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite18_Out396105491| ~y~0_In396105491) .cse1 (or .cse0 .cse2)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In396105491, ~y~0=~y~0_In396105491, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In396105491, ~y$w_buff1_used~0=~y$w_buff1_used~0_In396105491} OutVars{~y$w_buff1~0=~y$w_buff1~0_In396105491, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out396105491|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out396105491|, ~y~0=~y~0_In396105491, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In396105491, ~y$w_buff1_used~0=~y$w_buff1_used~0_In396105491} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 06:35:26,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In810456670 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In810456670 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite20_Out810456670|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In810456670 |ULTIMATE.start_main_#t~ite20_Out810456670|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In810456670, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In810456670} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In810456670, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In810456670, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out810456670|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 06:35:26,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L822-->L822-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In39892155 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In39892155 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In39892155 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In39892155 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In39892155 |ULTIMATE.start_main_#t~ite21_Out39892155|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite21_Out39892155|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In39892155, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In39892155, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In39892155, ~y$w_buff1_used~0=~y$w_buff1_used~0_In39892155} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In39892155, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In39892155, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out39892155|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In39892155, ~y$w_buff1_used~0=~y$w_buff1_used~0_In39892155} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 06:35:26,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1298858867 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1298858867 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite22_Out1298858867|)) (and (= |ULTIMATE.start_main_#t~ite22_Out1298858867| ~y$r_buff0_thd0~0_In1298858867) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1298858867, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1298858867} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1298858867, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1298858867, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1298858867|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 06:35:26,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L824-->L824-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In1062832802 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In1062832802 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In1062832802 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1062832802 256) 0))) (or (and (= ~y$r_buff1_thd0~0_In1062832802 |ULTIMATE.start_main_#t~ite23_Out1062832802|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite23_Out1062832802| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1062832802, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1062832802, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1062832802, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1062832802} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1062832802, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1062832802, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1062832802, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1062832802|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1062832802} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 06:35:26,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L833-->L833-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-721567767 256)))) (or (and (= |ULTIMATE.start_main_#t~ite32_Out-721567767| ~y$w_buff1~0_In-721567767) (= |ULTIMATE.start_main_#t~ite32_Out-721567767| |ULTIMATE.start_main_#t~ite33_Out-721567767|) (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-721567767 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-721567767 256)) (and .cse0 (= (mod ~y$r_buff1_thd0~0_In-721567767 256) 0)) (and (= 0 (mod ~y$w_buff1_used~0_In-721567767 256)) .cse0))) .cse1) (and (= |ULTIMATE.start_main_#t~ite32_In-721567767| |ULTIMATE.start_main_#t~ite32_Out-721567767|) (not .cse1) (= ~y$w_buff1~0_In-721567767 |ULTIMATE.start_main_#t~ite33_Out-721567767|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-721567767, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-721567767, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-721567767, ~weak$$choice2~0=~weak$$choice2~0_In-721567767, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-721567767, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_In-721567767|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-721567767} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-721567767, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-721567767, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-721567767, ~weak$$choice2~0=~weak$$choice2~0_In-721567767, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-721567767|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-721567767, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out-721567767|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-721567767} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_#t~ite33] because there is no mapped edge [2019-12-27 06:35:26,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L834-->L834-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1355957942 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite35_In1355957942| |ULTIMATE.start_main_#t~ite35_Out1355957942|) (= |ULTIMATE.start_main_#t~ite36_Out1355957942| ~y$w_buff0_used~0_In1355957942)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1355957942 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1355957942 256))) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1355957942 256))) (= 0 (mod ~y$w_buff0_used~0_In1355957942 256)))) (= |ULTIMATE.start_main_#t~ite36_Out1355957942| |ULTIMATE.start_main_#t~ite35_Out1355957942|) (= ~y$w_buff0_used~0_In1355957942 |ULTIMATE.start_main_#t~ite35_Out1355957942|) .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1355957942, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1355957942, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In1355957942|, ~weak$$choice2~0=~weak$$choice2~0_In1355957942, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1355957942, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1355957942} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1355957942, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1355957942, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1355957942|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1355957942|, ~weak$$choice2~0=~weak$$choice2~0_In1355957942, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1355957942, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1355957942} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 06:35:26,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L835-->L835-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1272620357 256)))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out1272620357| |ULTIMATE.start_main_#t~ite39_Out1272620357|) .cse0 (= ~y$w_buff1_used~0_In1272620357 |ULTIMATE.start_main_#t~ite38_Out1272620357|) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1272620357 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In1272620357 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In1272620357 256)) (and .cse1 (= (mod ~y$r_buff1_thd0~0_In1272620357 256) 0))))) (and (= ~y$w_buff1_used~0_In1272620357 |ULTIMATE.start_main_#t~ite39_Out1272620357|) (not .cse0) (= |ULTIMATE.start_main_#t~ite38_In1272620357| |ULTIMATE.start_main_#t~ite38_Out1272620357|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1272620357, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1272620357, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In1272620357|, ~weak$$choice2~0=~weak$$choice2~0_In1272620357, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1272620357, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1272620357} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1272620357, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1272620357|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1272620357, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1272620357|, ~weak$$choice2~0=~weak$$choice2~0_In1272620357, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1272620357, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1272620357} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 06:35:26,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L836-->L837: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~y$r_buff0_thd0~0_64 v_~y$r_buff0_thd0~0_63)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_63, ~weak$$choice2~0=v_~weak$$choice2~0_21, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 06:35:26,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L839-->L4: Formula: (and (= 0 v_~y$flush_delayed~0_10) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_8 256)) (= v_~y~0_23 v_~y$mem_tmp~0_7) (not (= 0 (mod v_~y$flush_delayed~0_11 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y~0=v_~y~0_23, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:35:26,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 06:35:26,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:35:26 BasicIcfg [2019-12-27 06:35:26,158 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:35:26,160 INFO L168 Benchmark]: Toolchain (without parser) took 16774.10 ms. Allocated memory was 146.3 MB in the beginning and 800.1 MB in the end (delta: 653.8 MB). Free memory was 101.7 MB in the beginning and 569.3 MB in the end (delta: -467.6 MB). Peak memory consumption was 580.9 MB. Max. memory is 7.1 GB. [2019-12-27 06:35:26,161 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 146.3 MB. Free memory was 121.4 MB in the beginning and 121.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 06:35:26,162 INFO L168 Benchmark]: CACSL2BoogieTranslator took 941.17 ms. Allocated memory was 146.3 MB in the beginning and 205.5 MB in the end (delta: 59.2 MB). Free memory was 101.5 MB in the beginning and 159.1 MB in the end (delta: -57.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:35:26,162 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.60 ms. Allocated memory is still 205.5 MB. Free memory was 159.1 MB in the beginning and 156.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:35:26,163 INFO L168 Benchmark]: Boogie Preprocessor took 44.45 ms. Allocated memory is still 205.5 MB. Free memory was 156.5 MB in the beginning and 153.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:35:26,164 INFO L168 Benchmark]: RCFGBuilder took 839.58 ms. Allocated memory is still 205.5 MB. Free memory was 153.9 MB in the beginning and 107.4 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. [2019-12-27 06:35:26,165 INFO L168 Benchmark]: TraceAbstraction took 14854.45 ms. Allocated memory was 205.5 MB in the beginning and 800.1 MB in the end (delta: 594.5 MB). Free memory was 106.8 MB in the beginning and 569.3 MB in the end (delta: -462.5 MB). Peak memory consumption was 526.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:35:26,169 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.50 ms. Allocated memory is still 146.3 MB. Free memory was 121.4 MB in the beginning and 121.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 941.17 ms. Allocated memory was 146.3 MB in the beginning and 205.5 MB in the end (delta: 59.2 MB). Free memory was 101.5 MB in the beginning and 159.1 MB in the end (delta: -57.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 82.60 ms. Allocated memory is still 205.5 MB. Free memory was 159.1 MB in the beginning and 156.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.45 ms. Allocated memory is still 205.5 MB. Free memory was 156.5 MB in the beginning and 153.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 839.58 ms. Allocated memory is still 205.5 MB. Free memory was 153.9 MB in the beginning and 107.4 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14854.45 ms. Allocated memory was 205.5 MB in the beginning and 800.1 MB in the end (delta: 594.5 MB). Free memory was 106.8 MB in the beginning and 569.3 MB in the end (delta: -462.5 MB). Peak memory consumption was 526.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 164 ProgramPointsBefore, 84 ProgramPointsAfterwards, 195 TransitionsBefore, 93 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 26 ChoiceCompositions, 4106 VarBasedMoverChecksPositive, 151 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 48939 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t1196, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L812] FCALL, FORK 0 pthread_create(&t1197, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L814] FCALL, FORK 0 pthread_create(&t1198, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L771] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L772] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L773] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L774] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L775] 3 y$r_buff0_thd3 = (_Bool)1 [L778] 3 z = 1 [L781] 3 __unbuffered_p2_EAX = z [L784] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 2 x = 2 [L749] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L788] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L789] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L752] 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 [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L754] 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 [L755] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L820] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L821] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L822] 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 [L823] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L824] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L827] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L828] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L829] 0 y$flush_delayed = weak$$choice2 [L830] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L832] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L832] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L833] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L834] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L835] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L837] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.5s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1396 SDtfs, 1135 SDslu, 2550 SDs, 0 SdLazy, 1436 SolverSat, 108 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 24 SyntacticMatches, 9 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24300occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 3380 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 629 NumberOfCodeBlocks, 629 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 558 ConstructedInterpolants, 0 QuantifiedInterpolants, 96219 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...