/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-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix047_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:12:14,235 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:12:14,238 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:12:14,257 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:12:14,257 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:12:14,259 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:12:14,261 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:12:14,272 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:12:14,275 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:12:14,279 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:12:14,281 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:12:14,283 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:12:14,283 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:12:14,285 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:12:14,288 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:12:14,289 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:12:14,289 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:12:14,292 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:12:14,293 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:12:14,298 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:12:14,302 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:12:14,307 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:12:14,308 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:12:14,309 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:12:14,311 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:12:14,311 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:12:14,311 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:12:14,313 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:12:14,314 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:12:14,315 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:12:14,315 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:12:14,317 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:12:14,318 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:12:14,319 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:12:14,320 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:12:14,320 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:12:14,321 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:12:14,321 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:12:14,321 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:12:14,322 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:12:14,323 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:12:14,324 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-SemanticLbe-MCR.epf [2019-12-27 17:12:14,360 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:12:14,361 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:12:14,362 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:12:14,362 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:12:14,362 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:12:14,363 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:12:14,363 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:12:14,363 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:12:14,363 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:12:14,363 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:12:14,363 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:12:14,364 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:12:14,364 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:12:14,364 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:12:14,364 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:12:14,364 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:12:14,364 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:12:14,367 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:12:14,368 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:12:14,368 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:12:14,368 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:12:14,368 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:12:14,368 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:12:14,369 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:12:14,369 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:12:14,369 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:12:14,369 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:12:14,369 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:12:14,369 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:12:14,370 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:12:14,370 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:12:14,689 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:12:14,713 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:12:14,717 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:12:14,718 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:12:14,719 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:12:14,721 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_pso.opt.i [2019-12-27 17:12:14,794 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b08989dd1/00dafe6d11414d69bd43c8ed952f6b98/FLAG14b957585 [2019-12-27 17:12:15,356 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:12:15,357 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_pso.opt.i [2019-12-27 17:12:15,380 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b08989dd1/00dafe6d11414d69bd43c8ed952f6b98/FLAG14b957585 [2019-12-27 17:12:15,609 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b08989dd1/00dafe6d11414d69bd43c8ed952f6b98 [2019-12-27 17:12:15,619 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:12:15,621 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:12:15,622 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:12:15,622 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:12:15,626 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:12:15,627 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:12:15" (1/1) ... [2019-12-27 17:12:15,630 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ad31de0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:12:15, skipping insertion in model container [2019-12-27 17:12:15,630 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:12:15" (1/1) ... [2019-12-27 17:12:15,638 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:12:15,687 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:12:16,208 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:12:16,231 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:12:16,326 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:12:16,401 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:12:16,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:12:16 WrapperNode [2019-12-27 17:12:16,402 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:12:16,403 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:12:16,403 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:12:16,403 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:12:16,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:12:16" (1/1) ... [2019-12-27 17:12:16,435 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:12:16" (1/1) ... [2019-12-27 17:12:16,478 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:12:16,479 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:12:16,479 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:12:16,479 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:12:16,488 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:12:16" (1/1) ... [2019-12-27 17:12:16,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:12:16" (1/1) ... [2019-12-27 17:12:16,493 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:12:16" (1/1) ... [2019-12-27 17:12:16,494 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:12:16" (1/1) ... [2019-12-27 17:12:16,504 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:12:16" (1/1) ... [2019-12-27 17:12:16,508 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:12:16" (1/1) ... [2019-12-27 17:12:16,512 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:12:16" (1/1) ... [2019-12-27 17:12:16,520 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:12:16,521 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:12:16,521 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:12:16,521 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:12:16,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:12:16" (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 17:12:16,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:12:16,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:12:16,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:12:16,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:12:16,603 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:12:16,604 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:12:16,604 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:12:16,605 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:12:16,606 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 17:12:16,606 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 17:12:16,607 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 17:12:16,607 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 17:12:16,607 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:12:16,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:12:16,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:12:16,611 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 17:12:17,380 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:12:17,380 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:12:17,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:12:17 BoogieIcfgContainer [2019-12-27 17:12:17,382 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:12:17,383 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:12:17,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:12:17,387 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:12:17,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:12:15" (1/3) ... [2019-12-27 17:12:17,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2672a2bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:12:17, skipping insertion in model container [2019-12-27 17:12:17,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:12:16" (2/3) ... [2019-12-27 17:12:17,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2672a2bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:12:17, skipping insertion in model container [2019-12-27 17:12:17,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:12:17" (3/3) ... [2019-12-27 17:12:17,391 INFO L109 eAbstractionObserver]: Analyzing ICFG mix047_pso.opt.i [2019-12-27 17:12:17,401 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:12:17,402 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:12:17,410 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:12:17,411 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:12:17,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,451 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,451 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,453 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,453 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,454 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,454 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,479 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,479 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,479 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,479 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,479 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,479 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,480 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,480 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,480 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,481 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,481 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,481 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,481 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,481 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,481 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,482 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,482 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,482 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,482 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,482 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,483 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,483 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,483 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,483 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,483 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,484 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,484 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,484 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,484 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,484 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,485 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,485 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,485 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,485 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,489 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,489 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,494 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,496 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,500 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,500 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,503 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,503 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,504 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,504 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,504 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,504 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,504 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,505 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,505 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,505 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,505 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,505 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:12:17,521 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 17:12:17,539 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:12:17,539 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:12:17,539 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:12:17,539 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:12:17,539 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:12:17,540 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:12:17,540 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:12:17,540 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:12:17,558 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 208 transitions [2019-12-27 17:12:17,560 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-27 17:12:17,665 INFO L132 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-27 17:12:17,666 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:12:17,682 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 17:12:17,702 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-27 17:12:17,791 INFO L132 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-27 17:12:17,791 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:12:17,802 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 17:12:17,819 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-27 17:12:17,821 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:12:22,856 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 17:12:23,004 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 17:12:23,058 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49999 [2019-12-27 17:12:23,058 INFO L214 etLargeBlockEncoding]: Total number of compositions: 122 [2019-12-27 17:12:23,062 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 89 places, 95 transitions [2019-12-27 17:12:25,957 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34566 states. [2019-12-27 17:12:25,959 INFO L276 IsEmpty]: Start isEmpty. Operand 34566 states. [2019-12-27 17:12:25,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 17:12:25,966 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:12:25,967 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:12:25,968 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:12:25,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:12:25,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1471654446, now seen corresponding path program 1 times [2019-12-27 17:12:25,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:12:25,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057632722] [2019-12-27 17:12:25,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:12:26,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:12:26,239 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 17:12:26,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057632722] [2019-12-27 17:12:26,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:12:26,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:12:26,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [277099944] [2019-12-27 17:12:26,243 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:12:26,247 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:12:26,267 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 17:12:26,267 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:12:26,274 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:12:26,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:12:26,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:12:26,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:12:26,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:12:26,292 INFO L87 Difference]: Start difference. First operand 34566 states. Second operand 3 states. [2019-12-27 17:12:26,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:12:26,813 INFO L93 Difference]: Finished difference Result 34366 states and 145616 transitions. [2019-12-27 17:12:26,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:12:26,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 17:12:26,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:12:27,279 INFO L225 Difference]: With dead ends: 34366 [2019-12-27 17:12:27,279 INFO L226 Difference]: Without dead ends: 33638 [2019-12-27 17:12:27,281 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 17:12:27,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33638 states. [2019-12-27 17:12:28,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33638 to 33638. [2019-12-27 17:12:28,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33638 states. [2019-12-27 17:12:29,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33638 states to 33638 states and 142648 transitions. [2019-12-27 17:12:29,017 INFO L78 Accepts]: Start accepts. Automaton has 33638 states and 142648 transitions. Word has length 9 [2019-12-27 17:12:29,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:12:29,018 INFO L462 AbstractCegarLoop]: Abstraction has 33638 states and 142648 transitions. [2019-12-27 17:12:29,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:12:29,018 INFO L276 IsEmpty]: Start isEmpty. Operand 33638 states and 142648 transitions. [2019-12-27 17:12:29,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 17:12:29,030 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:12:29,030 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:12:29,031 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:12:29,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:12:29,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1198985017, now seen corresponding path program 1 times [2019-12-27 17:12:29,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:12:29,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397656311] [2019-12-27 17:12:29,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:12:29,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:12:29,184 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 17:12:29,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397656311] [2019-12-27 17:12:29,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:12:29,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:12:29,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [33081343] [2019-12-27 17:12:29,186 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:12:29,187 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:12:29,195 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 39 transitions. [2019-12-27 17:12:29,196 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:12:29,239 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:12:29,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:12:29,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:12:29,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:12:29,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:12:29,242 INFO L87 Difference]: Start difference. First operand 33638 states and 142648 transitions. Second operand 5 states. [2019-12-27 17:12:31,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:12:31,309 INFO L93 Difference]: Finished difference Result 52350 states and 214824 transitions. [2019-12-27 17:12:31,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:12:31,310 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-12-27 17:12:31,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:12:31,524 INFO L225 Difference]: With dead ends: 52350 [2019-12-27 17:12:31,525 INFO L226 Difference]: Without dead ends: 52322 [2019-12-27 17:12:31,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:12:32,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52322 states. [2019-12-27 17:12:33,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52322 to 47746. [2019-12-27 17:12:33,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47746 states. [2019-12-27 17:12:33,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47746 states to 47746 states and 197744 transitions. [2019-12-27 17:12:33,768 INFO L78 Accepts]: Start accepts. Automaton has 47746 states and 197744 transitions. Word has length 15 [2019-12-27 17:12:33,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:12:33,769 INFO L462 AbstractCegarLoop]: Abstraction has 47746 states and 197744 transitions. [2019-12-27 17:12:33,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:12:33,769 INFO L276 IsEmpty]: Start isEmpty. Operand 47746 states and 197744 transitions. [2019-12-27 17:12:33,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 17:12:33,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:12:33,773 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:12:33,773 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:12:33,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:12:33,773 INFO L82 PathProgramCache]: Analyzing trace with hash -633584, now seen corresponding path program 1 times [2019-12-27 17:12:33,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:12:33,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821227628] [2019-12-27 17:12:33,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:12:33,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:12:33,822 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 17:12:33,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821227628] [2019-12-27 17:12:33,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:12:33,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:12:33,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1757792926] [2019-12-27 17:12:33,823 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:12:33,825 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:12:33,827 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 17:12:33,828 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:12:33,828 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:12:33,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:12:33,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:12:33,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:12:33,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:12:33,829 INFO L87 Difference]: Start difference. First operand 47746 states and 197744 transitions. Second operand 3 states. [2019-12-27 17:12:35,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:12:35,967 INFO L93 Difference]: Finished difference Result 37462 states and 143322 transitions. [2019-12-27 17:12:35,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:12:35,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 17:12:35,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:12:36,085 INFO L225 Difference]: With dead ends: 37462 [2019-12-27 17:12:36,085 INFO L226 Difference]: Without dead ends: 37462 [2019-12-27 17:12:36,086 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 17:12:36,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37462 states. [2019-12-27 17:12:37,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37462 to 37462. [2019-12-27 17:12:37,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37462 states. [2019-12-27 17:12:37,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37462 states to 37462 states and 143322 transitions. [2019-12-27 17:12:37,375 INFO L78 Accepts]: Start accepts. Automaton has 37462 states and 143322 transitions. Word has length 15 [2019-12-27 17:12:37,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:12:37,375 INFO L462 AbstractCegarLoop]: Abstraction has 37462 states and 143322 transitions. [2019-12-27 17:12:37,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:12:37,375 INFO L276 IsEmpty]: Start isEmpty. Operand 37462 states and 143322 transitions. [2019-12-27 17:12:37,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 17:12:37,377 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:12:37,378 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:12:37,378 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:12:37,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:12:37,378 INFO L82 PathProgramCache]: Analyzing trace with hash -375525237, now seen corresponding path program 1 times [2019-12-27 17:12:37,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:12:37,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981515759] [2019-12-27 17:12:37,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:12:37,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:12:37,458 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 17:12:37,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981515759] [2019-12-27 17:12:37,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:12:37,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:12:37,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [606636001] [2019-12-27 17:12:37,459 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:12:37,461 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:12:37,465 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 28 transitions. [2019-12-27 17:12:37,465 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:12:37,487 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:12:37,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:12:37,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:12:37,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:12:37,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:12:37,488 INFO L87 Difference]: Start difference. First operand 37462 states and 143322 transitions. Second operand 5 states. [2019-12-27 17:12:37,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:12:37,587 INFO L93 Difference]: Finished difference Result 15610 states and 49514 transitions. [2019-12-27 17:12:37,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:12:37,588 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 17:12:37,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:12:37,620 INFO L225 Difference]: With dead ends: 15610 [2019-12-27 17:12:37,620 INFO L226 Difference]: Without dead ends: 15610 [2019-12-27 17:12:37,620 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 17:12:37,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15610 states. [2019-12-27 17:12:37,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15610 to 15610. [2019-12-27 17:12:37,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15610 states. [2019-12-27 17:12:37,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15610 states to 15610 states and 49514 transitions. [2019-12-27 17:12:37,960 INFO L78 Accepts]: Start accepts. Automaton has 15610 states and 49514 transitions. Word has length 16 [2019-12-27 17:12:37,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:12:37,961 INFO L462 AbstractCegarLoop]: Abstraction has 15610 states and 49514 transitions. [2019-12-27 17:12:37,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:12:37,961 INFO L276 IsEmpty]: Start isEmpty. Operand 15610 states and 49514 transitions. [2019-12-27 17:12:37,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 17:12:37,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:12:37,963 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:12:37,963 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:12:37,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:12:37,964 INFO L82 PathProgramCache]: Analyzing trace with hash 680326116, now seen corresponding path program 1 times [2019-12-27 17:12:37,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:12:37,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977855024] [2019-12-27 17:12:37,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:12:37,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:12:38,054 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 17:12:38,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977855024] [2019-12-27 17:12:38,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:12:38,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:12:38,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1299229611] [2019-12-27 17:12:38,056 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:12:38,058 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:12:38,061 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 37 transitions. [2019-12-27 17:12:38,062 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:12:38,076 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:12:38,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:12:38,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:12:38,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:12:38,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:12:38,077 INFO L87 Difference]: Start difference. First operand 15610 states and 49514 transitions. Second operand 6 states. [2019-12-27 17:12:38,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:12:38,137 INFO L93 Difference]: Finished difference Result 2718 states and 7032 transitions. [2019-12-27 17:12:38,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:12:38,137 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-27 17:12:38,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:12:38,141 INFO L225 Difference]: With dead ends: 2718 [2019-12-27 17:12:38,141 INFO L226 Difference]: Without dead ends: 2718 [2019-12-27 17:12:38,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:12:38,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2718 states. [2019-12-27 17:12:38,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2718 to 2718. [2019-12-27 17:12:38,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2718 states. [2019-12-27 17:12:38,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2718 states to 2718 states and 7032 transitions. [2019-12-27 17:12:38,173 INFO L78 Accepts]: Start accepts. Automaton has 2718 states and 7032 transitions. Word has length 17 [2019-12-27 17:12:38,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:12:38,173 INFO L462 AbstractCegarLoop]: Abstraction has 2718 states and 7032 transitions. [2019-12-27 17:12:38,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:12:38,173 INFO L276 IsEmpty]: Start isEmpty. Operand 2718 states and 7032 transitions. [2019-12-27 17:12:38,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 17:12:38,178 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:12:38,178 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:12:38,178 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:12:38,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:12:38,178 INFO L82 PathProgramCache]: Analyzing trace with hash 794969432, now seen corresponding path program 1 times [2019-12-27 17:12:38,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:12:38,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202232346] [2019-12-27 17:12:38,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:12:38,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:12:38,251 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 17:12:38,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202232346] [2019-12-27 17:12:38,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:12:38,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:12:38,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [756833163] [2019-12-27 17:12:38,253 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:12:38,257 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:12:38,289 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 273 transitions. [2019-12-27 17:12:38,289 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:12:38,330 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:12:38,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:12:38,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:12:38,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:12:38,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:12:38,332 INFO L87 Difference]: Start difference. First operand 2718 states and 7032 transitions. Second operand 8 states. [2019-12-27 17:12:38,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:12:38,392 INFO L93 Difference]: Finished difference Result 1354 states and 3884 transitions. [2019-12-27 17:12:38,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:12:38,393 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-12-27 17:12:38,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:12:38,396 INFO L225 Difference]: With dead ends: 1354 [2019-12-27 17:12:38,396 INFO L226 Difference]: Without dead ends: 1354 [2019-12-27 17:12:38,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:12:38,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2019-12-27 17:12:38,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1214. [2019-12-27 17:12:38,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1214 states. [2019-12-27 17:12:38,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 3484 transitions. [2019-12-27 17:12:38,418 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 3484 transitions. Word has length 29 [2019-12-27 17:12:38,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:12:38,418 INFO L462 AbstractCegarLoop]: Abstraction has 1214 states and 3484 transitions. [2019-12-27 17:12:38,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:12:38,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 3484 transitions. [2019-12-27 17:12:38,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 17:12:38,423 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:12:38,423 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:12:38,423 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:12:38,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:12:38,423 INFO L82 PathProgramCache]: Analyzing trace with hash 593702588, now seen corresponding path program 1 times [2019-12-27 17:12:38,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:12:38,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879268978] [2019-12-27 17:12:38,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:12:38,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:12:38,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:12:38,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879268978] [2019-12-27 17:12:38,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:12:38,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:12:38,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [825919760] [2019-12-27 17:12:38,615 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:12:38,631 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:12:38,714 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 210 transitions. [2019-12-27 17:12:38,714 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:12:38,715 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:12:38,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:12:38,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:12:38,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:12:38,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:12:38,716 INFO L87 Difference]: Start difference. First operand 1214 states and 3484 transitions. Second operand 3 states. [2019-12-27 17:12:38,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:12:38,770 INFO L93 Difference]: Finished difference Result 1222 states and 3492 transitions. [2019-12-27 17:12:38,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:12:38,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 17:12:38,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:12:38,773 INFO L225 Difference]: With dead ends: 1222 [2019-12-27 17:12:38,774 INFO L226 Difference]: Without dead ends: 1222 [2019-12-27 17:12:38,774 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 17:12:38,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2019-12-27 17:12:38,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1217. [2019-12-27 17:12:38,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-12-27 17:12:38,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 3487 transitions. [2019-12-27 17:12:38,798 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 3487 transitions. Word has length 58 [2019-12-27 17:12:38,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:12:38,799 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 3487 transitions. [2019-12-27 17:12:38,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:12:38,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 3487 transitions. [2019-12-27 17:12:38,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 17:12:38,803 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:12:38,803 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:12:38,803 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:12:38,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:12:38,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1128085639, now seen corresponding path program 1 times [2019-12-27 17:12:38,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:12:38,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062517518] [2019-12-27 17:12:38,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:12:38,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:12:38,906 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 17:12:38,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062517518] [2019-12-27 17:12:38,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:12:38,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:12:38,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1719426913] [2019-12-27 17:12:38,907 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:12:38,925 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:12:39,005 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 210 transitions. [2019-12-27 17:12:39,005 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:12:39,026 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:12:39,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:12:39,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:12:39,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:12:39,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:12:39,027 INFO L87 Difference]: Start difference. First operand 1217 states and 3487 transitions. Second operand 5 states. [2019-12-27 17:12:39,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:12:39,242 INFO L93 Difference]: Finished difference Result 1507 states and 4200 transitions. [2019-12-27 17:12:39,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:12:39,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-27 17:12:39,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:12:39,245 INFO L225 Difference]: With dead ends: 1507 [2019-12-27 17:12:39,245 INFO L226 Difference]: Without dead ends: 1507 [2019-12-27 17:12:39,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:12:39,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2019-12-27 17:12:39,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1165. [2019-12-27 17:12:39,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1165 states. [2019-12-27 17:12:39,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 3279 transitions. [2019-12-27 17:12:39,261 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 3279 transitions. Word has length 58 [2019-12-27 17:12:39,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:12:39,262 INFO L462 AbstractCegarLoop]: Abstraction has 1165 states and 3279 transitions. [2019-12-27 17:12:39,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:12:39,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 3279 transitions. [2019-12-27 17:12:39,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 17:12:39,265 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:12:39,265 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:12:39,265 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:12:39,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:12:39,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1714711898, now seen corresponding path program 1 times [2019-12-27 17:12:39,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:12:39,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255621286] [2019-12-27 17:12:39,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:12:39,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:12:39,355 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 17:12:39,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255621286] [2019-12-27 17:12:39,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:12:39,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:12:39,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2058516225] [2019-12-27 17:12:39,357 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:12:39,375 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:12:39,509 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 129 states and 174 transitions. [2019-12-27 17:12:39,509 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:12:39,510 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:12:39,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:12:39,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:12:39,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:12:39,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:12:39,511 INFO L87 Difference]: Start difference. First operand 1165 states and 3279 transitions. Second operand 3 states. [2019-12-27 17:12:39,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:12:39,584 INFO L93 Difference]: Finished difference Result 1165 states and 3278 transitions. [2019-12-27 17:12:39,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:12:39,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-27 17:12:39,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:12:39,587 INFO L225 Difference]: With dead ends: 1165 [2019-12-27 17:12:39,587 INFO L226 Difference]: Without dead ends: 1165 [2019-12-27 17:12:39,587 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 17:12:39,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2019-12-27 17:12:39,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 952. [2019-12-27 17:12:39,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2019-12-27 17:12:39,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 2696 transitions. [2019-12-27 17:12:39,605 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 2696 transitions. Word has length 59 [2019-12-27 17:12:39,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:12:39,605 INFO L462 AbstractCegarLoop]: Abstraction has 952 states and 2696 transitions. [2019-12-27 17:12:39,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:12:39,606 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 2696 transitions. [2019-12-27 17:12:39,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 17:12:39,608 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:12:39,608 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:12:39,608 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:12:39,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:12:39,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1978644192, now seen corresponding path program 1 times [2019-12-27 17:12:39,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:12:39,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676860606] [2019-12-27 17:12:39,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:12:39,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:12:39,804 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 17:12:39,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676860606] [2019-12-27 17:12:39,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:12:39,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:12:39,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1839750053] [2019-12-27 17:12:39,805 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:12:39,824 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:12:39,895 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 175 transitions. [2019-12-27 17:12:39,896 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:12:39,924 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:12:39,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:12:39,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:12:39,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:12:39,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:12:39,927 INFO L87 Difference]: Start difference. First operand 952 states and 2696 transitions. Second operand 8 states. [2019-12-27 17:12:40,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:12:40,094 INFO L93 Difference]: Finished difference Result 1936 states and 5176 transitions. [2019-12-27 17:12:40,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 17:12:40,095 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2019-12-27 17:12:40,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:12:40,097 INFO L225 Difference]: With dead ends: 1936 [2019-12-27 17:12:40,098 INFO L226 Difference]: Without dead ends: 1353 [2019-12-27 17:12:40,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-12-27 17:12:40,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2019-12-27 17:12:40,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 826. [2019-12-27 17:12:40,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 826 states. [2019-12-27 17:12:40,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 2272 transitions. [2019-12-27 17:12:40,117 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 2272 transitions. Word has length 60 [2019-12-27 17:12:40,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:12:40,117 INFO L462 AbstractCegarLoop]: Abstraction has 826 states and 2272 transitions. [2019-12-27 17:12:40,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:12:40,117 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 2272 transitions. [2019-12-27 17:12:40,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 17:12:40,120 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:12:40,120 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:12:40,120 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:12:40,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:12:40,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1465585068, now seen corresponding path program 2 times [2019-12-27 17:12:40,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:12:40,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462742740] [2019-12-27 17:12:40,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:12:40,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:12:40,311 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 17:12:40,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462742740] [2019-12-27 17:12:40,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:12:40,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:12:40,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1588392839] [2019-12-27 17:12:40,312 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:12:40,355 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:12:40,488 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 144 states and 206 transitions. [2019-12-27 17:12:40,488 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:12:40,513 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:12:40,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:12:40,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:12:40,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:12:40,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:12:40,514 INFO L87 Difference]: Start difference. First operand 826 states and 2272 transitions. Second operand 7 states. [2019-12-27 17:12:40,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:12:40,790 INFO L93 Difference]: Finished difference Result 1777 states and 4520 transitions. [2019-12-27 17:12:40,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 17:12:40,790 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-12-27 17:12:40,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:12:40,792 INFO L225 Difference]: With dead ends: 1777 [2019-12-27 17:12:40,792 INFO L226 Difference]: Without dead ends: 996 [2019-12-27 17:12:40,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:12:40,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2019-12-27 17:12:40,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 600. [2019-12-27 17:12:40,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-12-27 17:12:40,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 1449 transitions. [2019-12-27 17:12:40,806 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 1449 transitions. Word has length 60 [2019-12-27 17:12:40,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:12:40,806 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 1449 transitions. [2019-12-27 17:12:40,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:12:40,807 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 1449 transitions. [2019-12-27 17:12:40,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 17:12:40,809 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:12:40,809 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:12:40,809 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:12:40,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:12:40,809 INFO L82 PathProgramCache]: Analyzing trace with hash -665728346, now seen corresponding path program 3 times [2019-12-27 17:12:40,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:12:40,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304317833] [2019-12-27 17:12:40,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:12:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:12:40,951 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 17:12:40,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304317833] [2019-12-27 17:12:40,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:12:40,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:12:40,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1786509569] [2019-12-27 17:12:40,953 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:12:40,971 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:12:41,126 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 132 states and 213 transitions. [2019-12-27 17:12:41,127 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:12:41,154 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:12:41,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:12:41,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:12:41,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:12:41,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:12:41,155 INFO L87 Difference]: Start difference. First operand 600 states and 1449 transitions. Second operand 7 states. [2019-12-27 17:12:41,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:12:41,445 INFO L93 Difference]: Finished difference Result 1317 states and 3163 transitions. [2019-12-27 17:12:41,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 17:12:41,446 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-12-27 17:12:41,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:12:41,446 INFO L225 Difference]: With dead ends: 1317 [2019-12-27 17:12:41,446 INFO L226 Difference]: Without dead ends: 359 [2019-12-27 17:12:41,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:12:41,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-12-27 17:12:41,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 232. [2019-12-27 17:12:41,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-12-27 17:12:41,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 410 transitions. [2019-12-27 17:12:41,451 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 410 transitions. Word has length 60 [2019-12-27 17:12:41,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:12:41,451 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 410 transitions. [2019-12-27 17:12:41,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:12:41,452 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 410 transitions. [2019-12-27 17:12:41,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 17:12:41,452 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:12:41,453 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:12:41,453 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:12:41,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:12:41,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1097199394, now seen corresponding path program 4 times [2019-12-27 17:12:41,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:12:41,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037948155] [2019-12-27 17:12:41,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:12:41,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:12:41,715 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 17:12:41,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037948155] [2019-12-27 17:12:41,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:12:41,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 17:12:41,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [374941196] [2019-12-27 17:12:41,717 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:12:41,735 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:12:41,921 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 167 states and 258 transitions. [2019-12-27 17:12:41,922 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:12:42,030 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 17:12:42,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 17:12:42,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:12:42,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 17:12:42,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-12-27 17:12:42,031 INFO L87 Difference]: Start difference. First operand 232 states and 410 transitions. Second operand 14 states. [2019-12-27 17:12:43,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:12:43,210 INFO L93 Difference]: Finished difference Result 494 states and 845 transitions. [2019-12-27 17:12:43,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 17:12:43,211 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-12-27 17:12:43,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:12:43,212 INFO L225 Difference]: With dead ends: 494 [2019-12-27 17:12:43,212 INFO L226 Difference]: Without dead ends: 466 [2019-12-27 17:12:43,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=154, Invalid=658, Unknown=0, NotChecked=0, Total=812 [2019-12-27 17:12:43,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-12-27 17:12:43,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 328. [2019-12-27 17:12:43,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-27 17:12:43,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 574 transitions. [2019-12-27 17:12:43,219 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 574 transitions. Word has length 60 [2019-12-27 17:12:43,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:12:43,219 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 574 transitions. [2019-12-27 17:12:43,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 17:12:43,219 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 574 transitions. [2019-12-27 17:12:43,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 17:12:43,220 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:12:43,220 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:12:43,221 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:12:43,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:12:43,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1151648330, now seen corresponding path program 5 times [2019-12-27 17:12:43,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:12:43,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681919610] [2019-12-27 17:12:43,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:12:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:12:43,542 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 17:12:43,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681919610] [2019-12-27 17:12:43,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:12:43,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 17:12:43,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1172368914] [2019-12-27 17:12:43,543 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:12:43,574 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:12:43,746 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 321 transitions. [2019-12-27 17:12:43,746 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:12:43,860 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 17:12:43,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 17:12:43,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:12:43,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 17:12:43,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-12-27 17:12:43,862 INFO L87 Difference]: Start difference. First operand 328 states and 574 transitions. Second operand 16 states. [2019-12-27 17:12:45,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:12:45,849 INFO L93 Difference]: Finished difference Result 670 states and 1117 transitions. [2019-12-27 17:12:45,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 17:12:45,850 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 60 [2019-12-27 17:12:45,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:12:45,851 INFO L225 Difference]: With dead ends: 670 [2019-12-27 17:12:45,851 INFO L226 Difference]: Without dead ends: 642 [2019-12-27 17:12:45,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 4 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=295, Invalid=1427, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 17:12:45,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-12-27 17:12:45,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 332. [2019-12-27 17:12:45,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-12-27 17:12:45,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 581 transitions. [2019-12-27 17:12:45,858 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 581 transitions. Word has length 60 [2019-12-27 17:12:45,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:12:45,858 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 581 transitions. [2019-12-27 17:12:45,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 17:12:45,858 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 581 transitions. [2019-12-27 17:12:45,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 17:12:45,859 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:12:45,859 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:12:45,859 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:12:45,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:12:45,860 INFO L82 PathProgramCache]: Analyzing trace with hash -2140500766, now seen corresponding path program 6 times [2019-12-27 17:12:45,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:12:45,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175926186] [2019-12-27 17:12:45,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:12:45,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:12:46,099 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 17:12:46,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175926186] [2019-12-27 17:12:46,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:12:46,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 17:12:46,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1518685135] [2019-12-27 17:12:46,101 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:12:46,119 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:12:46,250 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 141 states and 210 transitions. [2019-12-27 17:12:46,250 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:12:46,300 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:12:46,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 17:12:46,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:12:46,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 17:12:46,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-27 17:12:46,301 INFO L87 Difference]: Start difference. First operand 332 states and 581 transitions. Second operand 13 states. [2019-12-27 17:12:46,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:12:46,962 INFO L93 Difference]: Finished difference Result 430 states and 728 transitions. [2019-12-27 17:12:46,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 17:12:46,963 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-27 17:12:46,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:12:46,964 INFO L225 Difference]: With dead ends: 430 [2019-12-27 17:12:46,964 INFO L226 Difference]: Without dead ends: 402 [2019-12-27 17:12:46,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2019-12-27 17:12:46,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-12-27 17:12:46,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 340. [2019-12-27 17:12:46,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-12-27 17:12:46,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 595 transitions. [2019-12-27 17:12:46,970 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 595 transitions. Word has length 60 [2019-12-27 17:12:46,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:12:46,970 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 595 transitions. [2019-12-27 17:12:46,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 17:12:46,970 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 595 transitions. [2019-12-27 17:12:46,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 17:12:46,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:12:46,971 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:12:46,972 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:12:46,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:12:46,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1858118138, now seen corresponding path program 7 times [2019-12-27 17:12:46,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:12:46,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918749246] [2019-12-27 17:12:46,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:12:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:12:47,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:12:47,112 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 17:12:47,112 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 17:12:47,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= 0 v_~z$flush_delayed~0_54) (= |v_#NULL.offset_7| 0) (= v_~z$w_buff1_used~0_609 0) (= 0 v_~z$r_buff1_thd3~0_278) (= v_~z$w_buff0_used~0_830 0) (= v_~z$r_buff0_thd1~0_77 0) (= v_~x~0_53 0) (< 0 |v_#StackHeapBarrier_21|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1261~0.base_21|) 0) (= v_~z$w_buff0~0_376 0) (= 0 |v_ULTIMATE.start_main_~#t1261~0.offset_17|) (= v_~z$r_buff0_thd0~0_415 0) (= v_~z$read_delayed~0_5 0) (= 0 v_~weak$$choice0~0_32) (= v_~z$read_delayed_var~0.base_5 0) (= v_~z$w_buff1~0_367 0) (= v_~weak$$choice2~0_172 0) (= v_~z$r_buff1_thd2~0_207 0) (= |v_#valid_73| (store .cse0 |v_ULTIMATE.start_main_~#t1261~0.base_21| 1)) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t1261~0.base_21| 4)) (= v_~z$r_buff1_thd1~0_207 0) (= v_~z$read_delayed_var~0.offset_5 0) (= v_~y~0_52 0) (= |v_#memory_int_23| (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1261~0.base_21| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1261~0.base_21|) |v_ULTIMATE.start_main_~#t1261~0.offset_17| 0))) (= 0 v_~z$r_buff1_thd4~0_260) (= v_~z$mem_tmp~0_37 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1261~0.base_21|) (= 0 v_~z$r_buff0_thd3~0_189) (= v_~__unbuffered_cnt~0_145 0) (= 0 |v_#NULL.base_7|) (= v_~main$tmp_guard0~0_21 0) (= v_~z~0_157 0) (= v_~a~0_207 0) (= 0 v_~z$r_buff0_thd4~0_332) (= 0 v_~__unbuffered_p3_EBX~0_219) (= v_~z$r_buff0_thd2~0_78 0) (= v_~main$tmp_guard1~0_24 0) (= v_~z$r_buff1_thd0~0_431 0) (= v_~b~0_98 0) (= v_~__unbuffered_p3_EAX~0_219 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_24|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_42|, ULTIMATE.start_main_~#t1263~0.offset=|v_ULTIMATE.start_main_~#t1263~0.offset_18|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_207, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_72|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_33|, ULTIMATE.start_main_~#t1262~0.base=|v_ULTIMATE.start_main_~#t1262~0.base_23|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_40|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_35|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_134|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ~a~0=v_~a~0_207, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_415, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_332, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_219, #length=|v_#length_29|, ~z$mem_tmp~0=v_~z$mem_tmp~0_37, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_66|, ULTIMATE.start_main_~#t1264~0.base=|v_ULTIMATE.start_main_~#t1264~0.base_23|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_41|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_609, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_40|, ~z$flush_delayed~0=v_~z$flush_delayed~0_54, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_52|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_76|, ~weak$$choice0~0=v_~weak$$choice0~0_32, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_40|, ULTIMATE.start_main_~#t1264~0.offset=|v_ULTIMATE.start_main_~#t1264~0.offset_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_207, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_5, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_189, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_145, ~x~0=v_~x~0_53, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_260, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_36|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_42|, ~z$w_buff1~0=v_~z$w_buff1~0_367, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_30|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_5, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_44|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_36|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_42|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_48|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_431, ULTIMATE.start_main_~#t1262~0.offset=|v_ULTIMATE.start_main_~#t1262~0.offset_18|, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_56|, ~y~0=v_~y~0_52, ULTIMATE.start_main_~#t1263~0.base=|v_ULTIMATE.start_main_~#t1263~0.base_22|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_78, ULTIMATE.start_main_~#t1261~0.base=|v_ULTIMATE.start_main_~#t1261~0.base_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_830, ~z$w_buff0~0=v_~z$w_buff0~0_376, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_30|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_56|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_278, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_53|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_82|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_219, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_55|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_70|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_34|, ~b~0=v_~b~0_98, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ULTIMATE.start_main_~#t1261~0.offset=|v_ULTIMATE.start_main_~#t1261~0.offset_17|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_20|, ~z~0=v_~z~0_157, ~weak$$choice2~0=v_~weak$$choice2~0_172, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_77} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1263~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t1262~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1264~0.base, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1264~0.offset, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1262~0.offset, ULTIMATE.start_main_#t~nondet26, ~y~0, ULTIMATE.start_main_~#t1263~0.base, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1261~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~#t1261~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 17:12:47,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L831-1-->L833: Formula: (and (= |v_ULTIMATE.start_main_~#t1262~0.offset_11| 0) (= (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1262~0.base_13| 1) |v_#valid_44|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1262~0.base_13|) (= (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1262~0.base_13|) 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1262~0.base_13| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1262~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1262~0.base_13|) |v_ULTIMATE.start_main_~#t1262~0.offset_11| 1)) |v_#memory_int_15|) (not (= 0 |v_ULTIMATE.start_main_~#t1262~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1262~0.base=|v_ULTIMATE.start_main_~#t1262~0.base_13|, ULTIMATE.start_main_~#t1262~0.offset=|v_ULTIMATE.start_main_~#t1262~0.offset_11|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, #length=|v_#length_21|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t1262~0.base, ULTIMATE.start_main_~#t1262~0.offset, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-27 17:12:47,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L833-1-->L835: Formula: (and (= |v_ULTIMATE.start_main_~#t1263~0.offset_10| 0) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1263~0.base_11| 1) |v_#valid_40|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1263~0.base_11| 4)) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1263~0.base_11|) 0) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1263~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1263~0.base_11|) |v_ULTIMATE.start_main_~#t1263~0.offset_10| 2))) (not (= |v_ULTIMATE.start_main_~#t1263~0.base_11| 0)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1263~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1263~0.offset=|v_ULTIMATE.start_main_~#t1263~0.offset_10|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1263~0.base=|v_ULTIMATE.start_main_~#t1263~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1263~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1263~0.base] because there is no mapped edge [2019-12-27 17:12:47,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L835-1-->L837: Formula: (and (= |v_ULTIMATE.start_main_~#t1264~0.offset_11| 0) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1264~0.base_13|) 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1264~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1264~0.base_13|) |v_ULTIMATE.start_main_~#t1264~0.offset_11| 3)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1264~0.base_13|) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1264~0.base_13| 1) |v_#valid_46|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1264~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1264~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1264~0.base=|v_ULTIMATE.start_main_~#t1264~0.base_13|, ULTIMATE.start_main_~#t1264~0.offset=|v_ULTIMATE.start_main_~#t1264~0.offset_11|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_23|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1264~0.base, ULTIMATE.start_main_~#t1264~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-27 17:12:47,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L4-->L808: Formula: (and (= v_~z$r_buff0_thd4~0_36 1) (= v_~z$r_buff1_thd2~0_8 v_~z$r_buff0_thd2~0_7) (= v_~z$r_buff0_thd0~0_114 v_~z$r_buff1_thd0~0_75) (= 1 v_~a~0_7) (= v_~z$r_buff0_thd4~0_37 v_~z$r_buff1_thd4~0_34) (not (= v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_18 0)) (= v_~__unbuffered_p3_EAX~0_8 v_~a~0_7) (= v_~z$r_buff1_thd1~0_8 v_~z$r_buff0_thd1~0_7) (= v_~z$r_buff0_thd3~0_42 v_~z$r_buff1_thd3~0_34) (= v_~b~0_17 v_~__unbuffered_p3_EBX~0_8)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_18, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_114, ~b~0=v_~b~0_17, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_42, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_7} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_18, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_34, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_34, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_8, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~a~0=v_~a~0_7, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_114, ~b~0=v_~b~0_17, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_75, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_8, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_8, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_42, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_7} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-27 17:12:47,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_21 |v_P0Thread1of1ForFork0_#in~arg.offset_21|) (= v_~b~0_62 1) (= v_P0Thread1of1ForFork0_~arg.base_21 |v_P0Thread1of1ForFork0_#in~arg.base_21|) (= |v_P0Thread1of1ForFork0_#res.base_11| 0) (= 0 |v_P0Thread1of1ForFork0_#res.offset_11|) (= v_~__unbuffered_cnt~0_119 (+ v_~__unbuffered_cnt~0_120 1)) (= v_~x~0_42 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_120} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_11|, ~b~0=v_~b~0_62, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_119, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_21, ~x~0=v_~x~0_42, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_21} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 17:12:47,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_14| v_P1Thread1of1ForFork1_~arg.offset_14) (= v_P1Thread1of1ForFork1_~arg.base_14 |v_P1Thread1of1ForFork1_#in~arg.base_14|) (= v_~y~0_33 1) (= v_~x~0_29 2) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_14|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_14, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_14, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_14|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, ~y~0=v_~y~0_33, ~x~0=v_~x~0_29, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~y~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 17:12:47,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-606838509 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-606838509 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork3_#t~ite11_Out-606838509| ~z$w_buff0_used~0_In-606838509)) (and (not .cse1) (= 0 |P3Thread1of1ForFork3_#t~ite11_Out-606838509|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-606838509, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-606838509} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-606838509, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-606838509, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out-606838509|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-27 17:12:47,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L810-->L810-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd4~0_In166021767 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In166021767 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd4~0_In166021767 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In166021767 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork3_#t~ite12_Out166021767| 0)) (and (= ~z$w_buff1_used~0_In166021767 |P3Thread1of1ForFork3_#t~ite12_Out166021767|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In166021767, ~z$w_buff0_used~0=~z$w_buff0_used~0_In166021767, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In166021767, ~z$w_buff1_used~0=~z$w_buff1_used~0_In166021767} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In166021767, ~z$w_buff0_used~0=~z$w_buff0_used~0_In166021767, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In166021767, ~z$w_buff1_used~0=~z$w_buff1_used~0_In166021767, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out166021767|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-27 17:12:47,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L772-2-->L772-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-928311897 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-928311897 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In-928311897 |P2Thread1of1ForFork2_#t~ite3_Out-928311897|)) (and (= ~z~0_In-928311897 |P2Thread1of1ForFork2_#t~ite3_Out-928311897|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-928311897, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-928311897, ~z$w_buff1~0=~z$w_buff1~0_In-928311897, ~z~0=~z~0_In-928311897} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out-928311897|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-928311897, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-928311897, ~z$w_buff1~0=~z$w_buff1~0_In-928311897, ~z~0=~z~0_In-928311897} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 17:12:47,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-4-->L773: Formula: (= |v_P2Thread1of1ForFork2_#t~ite3_10| v_~z~0_32) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_10|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_15|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_9|, ~z~0=v_~z~0_32} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-27 17:12:47,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-1179010153 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1179010153 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite5_Out-1179010153|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1179010153 |P2Thread1of1ForFork2_#t~ite5_Out-1179010153|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1179010153, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1179010153} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out-1179010153|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1179010153, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1179010153} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 17:12:47,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L774-->L774-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In1236109269 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In1236109269 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1236109269 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In1236109269 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite6_Out1236109269| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork2_#t~ite6_Out1236109269| ~z$w_buff1_used~0_In1236109269) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1236109269, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1236109269, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1236109269, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1236109269} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out1236109269|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1236109269, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1236109269, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1236109269, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1236109269} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 17:12:47,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1837251619 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1837251619 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite7_Out-1837251619| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite7_Out-1837251619| ~z$r_buff0_thd3~0_In-1837251619)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1837251619, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1837251619} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1837251619, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1837251619, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out-1837251619|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 17:12:47,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L776-->L776-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-1362517174 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1362517174 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1362517174 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1362517174 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite8_Out-1362517174|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In-1362517174 |P2Thread1of1ForFork2_#t~ite8_Out-1362517174|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1362517174, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1362517174, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1362517174, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1362517174} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1362517174, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1362517174, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1362517174, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1362517174, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out-1362517174|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 17:12:47,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L776-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite8_36| v_~z$r_buff1_thd3~0_64) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_36|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_64, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_35|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 17:12:47,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L811-->L812: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1449209705 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1449209705 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_In-1449209705 ~z$r_buff0_thd4~0_Out-1449209705)) (and (= 0 ~z$r_buff0_thd4~0_Out-1449209705) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1449209705, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1449209705} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1449209705, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1449209705, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out-1449209705|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-27 17:12:47,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L812-->L812-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In2043379882 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In2043379882 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In2043379882 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In2043379882 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd4~0_In2043379882 |P3Thread1of1ForFork3_#t~ite14_Out2043379882|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork3_#t~ite14_Out2043379882|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In2043379882, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2043379882, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2043379882, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2043379882} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In2043379882, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2043379882, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out2043379882|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2043379882, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2043379882} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-27 17:12:47,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L812-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_107 (+ v_~__unbuffered_cnt~0_108 1)) (= |v_P3Thread1of1ForFork3_#t~ite14_46| v_~z$r_buff1_thd4~0_75) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_46|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_108} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_75, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_45|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-27 17:12:47,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L837-1-->L843: Formula: (and (= 4 v_~__unbuffered_cnt~0_62) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_8|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-27 17:12:47,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L843-2-->L843-5: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In2023794242 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In2023794242 256) 0)) (.cse0 (= |ULTIMATE.start_main_#t~ite19_Out2023794242| |ULTIMATE.start_main_#t~ite20_Out2023794242|))) (or (and .cse0 (not .cse1) (= |ULTIMATE.start_main_#t~ite19_Out2023794242| ~z$w_buff1~0_In2023794242) (not .cse2)) (and (or .cse1 .cse2) .cse0 (= |ULTIMATE.start_main_#t~ite19_Out2023794242| ~z~0_In2023794242)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2023794242, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2023794242, ~z$w_buff1~0=~z$w_buff1~0_In2023794242, ~z~0=~z~0_In2023794242} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out2023794242|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2023794242, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2023794242, ~z$w_buff1~0=~z$w_buff1~0_In2023794242, ~z~0=~z~0_In2023794242, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out2023794242|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 17:12:47,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L844-->L844-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In2108251456 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In2108251456 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite21_Out2108251456|)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite21_Out2108251456| ~z$w_buff0_used~0_In2108251456)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2108251456, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2108251456} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2108251456, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2108251456, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out2108251456|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 17:12:47,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L845-->L845-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-1628468268 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1628468268 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1628468268 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1628468268 256)))) (or (and (= ~z$w_buff1_used~0_In-1628468268 |ULTIMATE.start_main_#t~ite22_Out-1628468268|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite22_Out-1628468268| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1628468268, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1628468268, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1628468268, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1628468268} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1628468268, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1628468268, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1628468268, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1628468268, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1628468268|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 17:12:47,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L846-->L846-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1487586738 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1487586738 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite23_Out-1487586738| 0)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-1487586738 |ULTIMATE.start_main_#t~ite23_Out-1487586738|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1487586738, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1487586738} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1487586738, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1487586738, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1487586738|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 17:12:47,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L847-->L847-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-2136844676 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-2136844676 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-2136844676 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-2136844676 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite24_Out-2136844676| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite24_Out-2136844676| ~z$r_buff1_thd0~0_In-2136844676) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2136844676, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2136844676, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2136844676, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2136844676} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2136844676, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2136844676, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2136844676, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-2136844676|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2136844676} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-27 17:12:47,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L855-->L855-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In2997776 256)))) (or (and (= ~z$w_buff0~0_In2997776 |ULTIMATE.start_main_#t~ite30_Out2997776|) (= |ULTIMATE.start_main_#t~ite31_Out2997776| |ULTIMATE.start_main_#t~ite30_Out2997776|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In2997776 256)))) (or (and .cse1 (= (mod ~z$r_buff1_thd0~0_In2997776 256) 0)) (and .cse1 (= (mod ~z$w_buff1_used~0_In2997776 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In2997776 256))))) (and (= |ULTIMATE.start_main_#t~ite31_Out2997776| ~z$w_buff0~0_In2997776) (not .cse0) (= |ULTIMATE.start_main_#t~ite30_In2997776| |ULTIMATE.start_main_#t~ite30_Out2997776|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2997776, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_In2997776|, ~z$w_buff0~0=~z$w_buff0~0_In2997776, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2997776, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2997776, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2997776, ~weak$$choice2~0=~weak$$choice2~0_In2997776} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2997776, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out2997776|, ~z$w_buff0~0=~z$w_buff0~0_In2997776, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2997776, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2997776, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2997776, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out2997776|, ~weak$$choice2~0=~weak$$choice2~0_In2997776} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite31] because there is no mapped edge [2019-12-27 17:12:47,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L856-->L856-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1218030192 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite33_In1218030192| |ULTIMATE.start_main_#t~ite33_Out1218030192|) (= ~z$w_buff1~0_In1218030192 |ULTIMATE.start_main_#t~ite34_Out1218030192|) (not .cse0)) (and (= ~z$w_buff1~0_In1218030192 |ULTIMATE.start_main_#t~ite33_Out1218030192|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1218030192 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In1218030192 256)) (and (= 0 (mod ~z$w_buff1_used~0_In1218030192 256)) .cse1) (and (= 0 (mod ~z$r_buff1_thd0~0_In1218030192 256)) .cse1))) (= |ULTIMATE.start_main_#t~ite33_Out1218030192| |ULTIMATE.start_main_#t~ite34_Out1218030192|) .cse0))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1218030192, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1218030192, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1218030192, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1218030192, ~z$w_buff1~0=~z$w_buff1~0_In1218030192, ~weak$$choice2~0=~weak$$choice2~0_In1218030192, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_In1218030192|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1218030192, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1218030192, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1218030192, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1218030192, ~z$w_buff1~0=~z$w_buff1~0_In1218030192, ~weak$$choice2~0=~weak$$choice2~0_In1218030192, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out1218030192|, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out1218030192|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 17:12:47,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L859-->L860: Formula: (and (= v_~z$r_buff0_thd0~0_108 v_~z$r_buff0_thd0~0_107) (not (= 0 (mod v_~weak$$choice2~0_33 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_108, ~weak$$choice2~0=v_~weak$$choice2~0_33} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_107, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 17:12:47,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L860-->L860-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In574503389 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite45_In574503389| |ULTIMATE.start_main_#t~ite45_Out574503389|) (= ~z$r_buff1_thd0~0_In574503389 |ULTIMATE.start_main_#t~ite46_Out574503389|)) (and .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In574503389 256) 0))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd0~0_In574503389 256))) (= 0 (mod ~z$w_buff0_used~0_In574503389 256)) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In574503389 256))))) (= |ULTIMATE.start_main_#t~ite46_Out574503389| |ULTIMATE.start_main_#t~ite45_Out574503389|) (= ~z$r_buff1_thd0~0_In574503389 |ULTIMATE.start_main_#t~ite45_Out574503389|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In574503389, ~z$w_buff0_used~0=~z$w_buff0_used~0_In574503389, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In574503389, ~z$w_buff1_used~0=~z$w_buff1_used~0_In574503389, ~weak$$choice2~0=~weak$$choice2~0_In574503389, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In574503389|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In574503389, ~z$w_buff0_used~0=~z$w_buff0_used~0_In574503389, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In574503389, ~z$w_buff1_used~0=~z$w_buff1_used~0_In574503389, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out574503389|, ~weak$$choice2~0=~weak$$choice2~0_In574503389, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out574503389|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 17:12:47,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L862-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5| (mod v_~main$tmp_guard1~0_8 256)) (not (= 0 (mod v_~z$flush_delayed~0_30 256))) (= v_~z$mem_tmp~0_20 v_~z~0_83) (= 0 v_~z$flush_delayed~0_29)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z$flush_delayed~0=v_~z$flush_delayed~0_30} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_20, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_17|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z$flush_delayed~0=v_~z$flush_delayed~0_29, ~z~0=v_~z~0_83, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 17:12:47,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 17:12:47,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:12:47 BasicIcfg [2019-12-27 17:12:47,288 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:12:47,291 INFO L168 Benchmark]: Toolchain (without parser) took 31669.00 ms. Allocated memory was 138.9 MB in the beginning and 1.5 GB in the end (delta: 1.4 GB). Free memory was 102.3 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-27 17:12:47,291 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 17:12:47,298 INFO L168 Benchmark]: CACSL2BoogieTranslator took 780.41 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 101.8 MB in the beginning and 154.2 MB in the end (delta: -52.4 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:12:47,299 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.45 ms. Allocated memory is still 202.9 MB. Free memory was 154.2 MB in the beginning and 151.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 17:12:47,299 INFO L168 Benchmark]: Boogie Preprocessor took 41.85 ms. Allocated memory is still 202.9 MB. Free memory was 151.5 MB in the beginning and 148.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 17:12:47,300 INFO L168 Benchmark]: RCFGBuilder took 861.41 ms. Allocated memory is still 202.9 MB. Free memory was 148.8 MB in the beginning and 99.3 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2019-12-27 17:12:47,308 INFO L168 Benchmark]: TraceAbstraction took 29904.75 ms. Allocated memory was 202.9 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 98.6 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-27 17:12:47,311 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.22 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 780.41 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 101.8 MB in the beginning and 154.2 MB in the end (delta: -52.4 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.45 ms. Allocated memory is still 202.9 MB. Free memory was 154.2 MB in the beginning and 151.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.85 ms. Allocated memory is still 202.9 MB. Free memory was 151.5 MB in the beginning and 148.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 861.41 ms. Allocated memory is still 202.9 MB. Free memory was 148.8 MB in the beginning and 99.3 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 29904.75 ms. Allocated memory was 202.9 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 98.6 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 180 ProgramPointsBefore, 89 ProgramPointsAfterwards, 208 TransitionsBefore, 95 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 27 ChoiceCompositions, 5121 VarBasedMoverChecksPositive, 269 VarBasedMoverChecksNegative, 136 SemBasedMoverChecksPositive, 198 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 49999 CheckedPairsTotal, 122 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L831] FCALL, FORK 0 pthread_create(&t1261, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L833] FCALL, FORK 0 pthread_create(&t1262, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] FCALL, FORK 0 pthread_create(&t1263, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1264, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] 4 z$w_buff1 = z$w_buff0 [L787] 4 z$w_buff0 = 2 [L788] 4 z$w_buff1_used = z$w_buff0_used [L789] 4 z$w_buff0_used = (_Bool)1 [L808] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 3 y = 2 [L769] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L772] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L773] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L774] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L775] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L810] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L843] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L844] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L845] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L846] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L847] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L850] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L851] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L852] 0 z$flush_delayed = weak$$choice2 [L853] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L855] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L856] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L857] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L858] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L860] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L861] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 29.5s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 10.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1527 SDtfs, 2523 SDslu, 4489 SDs, 0 SdLazy, 2482 SolverSat, 232 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 188 GetRequests, 28 SyntacticMatches, 19 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47746occurred 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: 5.7s AutomataMinimizationTime, 15 MinimizatonAttempts, 6836 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 696 NumberOfCodeBlocks, 696 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 621 ConstructedInterpolants, 0 QuantifiedInterpolants, 186020 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...