/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix017_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:36:49,324 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:36:49,327 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:36:49,346 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:36:49,346 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:36:49,348 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:36:49,350 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:36:49,359 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:36:49,363 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:36:49,367 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:36:49,369 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:36:49,371 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:36:49,371 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:36:49,373 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:36:49,375 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:36:49,377 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:36:49,378 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:36:49,379 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:36:49,380 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:36:49,385 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:36:49,386 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:36:49,387 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:36:49,389 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:36:49,390 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:36:49,392 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:36:49,393 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:36:49,393 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:36:49,395 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:36:49,396 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:36:49,397 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:36:49,397 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:36:49,398 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:36:49,398 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:36:49,399 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:36:49,400 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:36:49,400 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:36:49,401 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:36:49,401 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:36:49,401 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:36:49,402 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:36:49,402 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:36:49,403 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 12:36:49,416 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:36:49,417 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:36:49,418 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:36:49,418 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:36:49,418 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:36:49,418 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:36:49,419 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:36:49,419 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:36:49,419 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:36:49,419 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:36:49,419 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:36:49,419 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:36:49,420 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:36:49,420 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:36:49,420 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:36:49,420 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:36:49,420 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:36:49,421 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:36:49,421 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:36:49,421 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:36:49,421 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:36:49,421 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:36:49,422 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:36:49,422 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:36:49,422 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:36:49,422 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:36:49,422 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:36:49,422 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:36:49,423 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:36:49,423 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:36:49,692 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:36:49,713 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:36:49,716 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:36:49,718 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:36:49,718 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:36:49,719 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix017_rmo.opt.i [2019-12-18 12:36:49,802 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9743c9bea/1e2a7474ceb74810b553ffccf1abea29/FLAG815b9e834 [2019-12-18 12:36:50,280 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:36:50,281 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017_rmo.opt.i [2019-12-18 12:36:50,307 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9743c9bea/1e2a7474ceb74810b553ffccf1abea29/FLAG815b9e834 [2019-12-18 12:36:50,803 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9743c9bea/1e2a7474ceb74810b553ffccf1abea29 [2019-12-18 12:36:50,812 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:36:50,814 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:36:50,815 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:36:50,815 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:36:50,819 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:36:50,820 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:36:50" (1/1) ... [2019-12-18 12:36:50,823 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@409c8d49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:36:50, skipping insertion in model container [2019-12-18 12:36:50,823 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:36:50" (1/1) ... [2019-12-18 12:36:50,831 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:36:50,876 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:36:51,372 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:36:51,385 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:36:51,480 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:36:51,558 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:36:51,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:36:51 WrapperNode [2019-12-18 12:36:51,558 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:36:51,559 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:36:51,559 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:36:51,559 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:36:51,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:36:51" (1/1) ... [2019-12-18 12:36:51,593 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:36:51" (1/1) ... [2019-12-18 12:36:51,631 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:36:51,631 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:36:51,631 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:36:51,631 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:36:51,642 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:36:51" (1/1) ... [2019-12-18 12:36:51,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:36:51" (1/1) ... [2019-12-18 12:36:51,647 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:36:51" (1/1) ... [2019-12-18 12:36:51,648 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:36:51" (1/1) ... [2019-12-18 12:36:51,662 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:36:51" (1/1) ... [2019-12-18 12:36:51,667 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:36:51" (1/1) ... [2019-12-18 12:36:51,671 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:36:51" (1/1) ... [2019-12-18 12:36:51,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:36:51,683 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:36:51,683 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:36:51,684 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:36:51,685 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:36:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:36:51,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:36:51,743 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:36:51,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:36:51,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:36:51,743 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:36:51,743 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:36:51,744 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:36:51,744 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:36:51,744 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:36:51,744 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:36:51,744 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 12:36:51,744 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 12:36:51,745 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:36:51,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:36:51,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:36:51,747 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 12:36:52,513 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:36:52,514 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:36:52,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:36:52 BoogieIcfgContainer [2019-12-18 12:36:52,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:36:52,518 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:36:52,519 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:36:52,524 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:36:52,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:36:50" (1/3) ... [2019-12-18 12:36:52,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b280139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:36:52, skipping insertion in model container [2019-12-18 12:36:52,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:36:51" (2/3) ... [2019-12-18 12:36:52,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b280139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:36:52, skipping insertion in model container [2019-12-18 12:36:52,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:36:52" (3/3) ... [2019-12-18 12:36:52,530 INFO L109 eAbstractionObserver]: Analyzing ICFG mix017_rmo.opt.i [2019-12-18 12:36:52,541 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:36:52,541 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:36:52,554 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:36:52,555 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:36:52,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,620 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,620 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,623 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,623 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,682 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,682 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,689 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,690 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,691 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,701 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,701 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,701 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,701 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,702 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,702 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,702 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,702 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,702 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,703 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,703 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,703 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,704 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,704 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,704 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,704 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,704 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,705 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,705 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,705 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,705 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,705 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,706 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,706 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,706 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,706 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,707 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,707 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,707 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,707 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,712 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,713 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,713 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,713 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,714 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,714 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,714 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,715 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,715 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,716 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,722 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,722 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,725 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,728 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,732 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,732 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,733 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:36:52,749 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 12:36:52,771 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:36:52,771 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:36:52,771 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:36:52,771 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:36:52,771 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:36:52,771 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:36:52,771 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:36:52,771 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:36:52,785 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 210 transitions [2019-12-18 12:36:52,787 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-18 12:36:52,881 INFO L126 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-18 12:36:52,881 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:36:52,901 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 440 event pairs. 12/175 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 12:36:52,930 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-18 12:36:52,977 INFO L126 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-18 12:36:52,977 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:36:52,986 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 440 event pairs. 12/175 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 12:36:53,008 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-18 12:36:53,009 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:36:59,040 WARN L192 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-18 12:36:59,218 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-18 12:36:59,241 INFO L206 etLargeBlockEncoding]: Checked pairs total: 72619 [2019-12-18 12:36:59,241 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-18 12:36:59,245 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 88 places, 92 transitions [2019-12-18 12:37:31,011 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 160086 states. [2019-12-18 12:37:31,013 INFO L276 IsEmpty]: Start isEmpty. Operand 160086 states. [2019-12-18 12:37:31,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 12:37:31,019 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:37:31,021 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:37:31,022 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:37:31,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:37:31,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1489169700, now seen corresponding path program 1 times [2019-12-18 12:37:31,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:37:31,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019458953] [2019-12-18 12:37:31,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:37:31,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:37:31,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:37:31,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019458953] [2019-12-18 12:37:31,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:37:31,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:37:31,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036473175] [2019-12-18 12:37:31,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:37:31,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:37:31,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:37:31,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:37:31,422 INFO L87 Difference]: Start difference. First operand 160086 states. Second operand 3 states. [2019-12-18 12:37:33,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:37:33,166 INFO L93 Difference]: Finished difference Result 158106 states and 752394 transitions. [2019-12-18 12:37:33,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:37:33,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 12:37:33,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:37:39,047 INFO L225 Difference]: With dead ends: 158106 [2019-12-18 12:37:39,047 INFO L226 Difference]: Without dead ends: 149058 [2019-12-18 12:37:39,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:37:44,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149058 states. [2019-12-18 12:37:48,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149058 to 149058. [2019-12-18 12:37:48,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149058 states. [2019-12-18 12:37:48,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149058 states to 149058 states and 708428 transitions. [2019-12-18 12:37:48,683 INFO L78 Accepts]: Start accepts. Automaton has 149058 states and 708428 transitions. Word has length 7 [2019-12-18 12:37:48,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:37:48,684 INFO L462 AbstractCegarLoop]: Abstraction has 149058 states and 708428 transitions. [2019-12-18 12:37:48,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:37:48,684 INFO L276 IsEmpty]: Start isEmpty. Operand 149058 states and 708428 transitions. [2019-12-18 12:37:48,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 12:37:48,697 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:37:48,697 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:37:48,697 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:37:48,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:37:48,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1593754123, now seen corresponding path program 1 times [2019-12-18 12:37:48,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:37:48,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214093851] [2019-12-18 12:37:48,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:37:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:37:48,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:37:48,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214093851] [2019-12-18 12:37:48,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:37:48,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:37:48,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626729861] [2019-12-18 12:37:48,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:37:48,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:37:48,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:37:48,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:37:48,811 INFO L87 Difference]: Start difference. First operand 149058 states and 708428 transitions. Second operand 4 states. [2019-12-18 12:37:56,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:37:56,459 INFO L93 Difference]: Finished difference Result 235386 states and 1077036 transitions. [2019-12-18 12:37:56,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:37:56,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 12:37:56,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:37:57,321 INFO L225 Difference]: With dead ends: 235386 [2019-12-18 12:37:57,321 INFO L226 Difference]: Without dead ends: 235190 [2019-12-18 12:37:57,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:38:10,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235190 states. [2019-12-18 12:38:15,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235190 to 218838. [2019-12-18 12:38:15,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218838 states. [2019-12-18 12:38:26,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218838 states to 218838 states and 1009170 transitions. [2019-12-18 12:38:26,121 INFO L78 Accepts]: Start accepts. Automaton has 218838 states and 1009170 transitions. Word has length 15 [2019-12-18 12:38:26,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:38:26,121 INFO L462 AbstractCegarLoop]: Abstraction has 218838 states and 1009170 transitions. [2019-12-18 12:38:26,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:38:26,121 INFO L276 IsEmpty]: Start isEmpty. Operand 218838 states and 1009170 transitions. [2019-12-18 12:38:26,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 12:38:26,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:38:26,126 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:38:26,126 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:38:26,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:38:26,126 INFO L82 PathProgramCache]: Analyzing trace with hash -314430534, now seen corresponding path program 1 times [2019-12-18 12:38:26,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:38:26,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086114415] [2019-12-18 12:38:26,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:38:26,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:38:26,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:38:26,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086114415] [2019-12-18 12:38:26,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:38:26,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:38:26,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897893647] [2019-12-18 12:38:26,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:38:26,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:38:26,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:38:26,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:38:26,243 INFO L87 Difference]: Start difference. First operand 218838 states and 1009170 transitions. Second operand 3 states. [2019-12-18 12:38:26,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:38:26,949 INFO L93 Difference]: Finished difference Result 136511 states and 567133 transitions. [2019-12-18 12:38:26,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:38:26,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 12:38:26,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:38:27,511 INFO L225 Difference]: With dead ends: 136511 [2019-12-18 12:38:27,512 INFO L226 Difference]: Without dead ends: 136511 [2019-12-18 12:38:27,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:38:37,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136511 states. [2019-12-18 12:38:40,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136511 to 136511. [2019-12-18 12:38:40,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136511 states. [2019-12-18 12:38:40,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136511 states to 136511 states and 567133 transitions. [2019-12-18 12:38:40,758 INFO L78 Accepts]: Start accepts. Automaton has 136511 states and 567133 transitions. Word has length 15 [2019-12-18 12:38:40,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:38:40,759 INFO L462 AbstractCegarLoop]: Abstraction has 136511 states and 567133 transitions. [2019-12-18 12:38:40,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:38:40,759 INFO L276 IsEmpty]: Start isEmpty. Operand 136511 states and 567133 transitions. [2019-12-18 12:38:40,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:38:40,764 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:38:40,764 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:38:40,764 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:38:40,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:38:40,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1173494608, now seen corresponding path program 1 times [2019-12-18 12:38:40,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:38:40,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746943452] [2019-12-18 12:38:40,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:38:40,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:38:40,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:38:40,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746943452] [2019-12-18 12:38:40,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:38:40,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:38:40,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970530754] [2019-12-18 12:38:40,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:38:40,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:38:40,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:38:40,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:38:40,845 INFO L87 Difference]: Start difference. First operand 136511 states and 567133 transitions. Second operand 4 states. [2019-12-18 12:38:41,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:38:41,017 INFO L93 Difference]: Finished difference Result 37132 states and 130918 transitions. [2019-12-18 12:38:41,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:38:41,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 12:38:41,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:38:41,083 INFO L225 Difference]: With dead ends: 37132 [2019-12-18 12:38:41,083 INFO L226 Difference]: Without dead ends: 37132 [2019-12-18 12:38:41,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:38:41,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37132 states. [2019-12-18 12:38:42,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37132 to 37132. [2019-12-18 12:38:42,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37132 states. [2019-12-18 12:38:42,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37132 states to 37132 states and 130918 transitions. [2019-12-18 12:38:42,614 INFO L78 Accepts]: Start accepts. Automaton has 37132 states and 130918 transitions. Word has length 16 [2019-12-18 12:38:42,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:38:42,614 INFO L462 AbstractCegarLoop]: Abstraction has 37132 states and 130918 transitions. [2019-12-18 12:38:42,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:38:42,615 INFO L276 IsEmpty]: Start isEmpty. Operand 37132 states and 130918 transitions. [2019-12-18 12:38:42,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:38:42,617 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:38:42,617 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:38:42,617 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:38:42,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:38:42,617 INFO L82 PathProgramCache]: Analyzing trace with hash 24118251, now seen corresponding path program 1 times [2019-12-18 12:38:42,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:38:42,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728367740] [2019-12-18 12:38:42,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:38:42,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:38:42,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:38:42,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728367740] [2019-12-18 12:38:42,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:38:42,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:38:42,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020276509] [2019-12-18 12:38:42,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:38:42,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:38:42,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:38:42,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:38:42,684 INFO L87 Difference]: Start difference. First operand 37132 states and 130918 transitions. Second operand 4 states. [2019-12-18 12:38:43,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:38:43,079 INFO L93 Difference]: Finished difference Result 47278 states and 165300 transitions. [2019-12-18 12:38:43,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:38:43,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 12:38:43,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:38:43,165 INFO L225 Difference]: With dead ends: 47278 [2019-12-18 12:38:43,166 INFO L226 Difference]: Without dead ends: 47267 [2019-12-18 12:38:43,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:38:43,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47267 states. [2019-12-18 12:38:43,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47267 to 41603. [2019-12-18 12:38:43,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41603 states. [2019-12-18 12:38:47,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41603 states to 41603 states and 146400 transitions. [2019-12-18 12:38:47,187 INFO L78 Accepts]: Start accepts. Automaton has 41603 states and 146400 transitions. Word has length 16 [2019-12-18 12:38:47,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:38:47,187 INFO L462 AbstractCegarLoop]: Abstraction has 41603 states and 146400 transitions. [2019-12-18 12:38:47,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:38:47,187 INFO L276 IsEmpty]: Start isEmpty. Operand 41603 states and 146400 transitions. [2019-12-18 12:38:47,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 12:38:47,205 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:38:47,206 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] [2019-12-18 12:38:47,206 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:38:47,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:38:47,206 INFO L82 PathProgramCache]: Analyzing trace with hash -116240952, now seen corresponding path program 1 times [2019-12-18 12:38:47,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:38:47,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322876001] [2019-12-18 12:38:47,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:38:47,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:38:47,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:38:47,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322876001] [2019-12-18 12:38:47,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:38:47,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:38:47,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762194939] [2019-12-18 12:38:47,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:38:47,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:38:47,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:38:47,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:38:47,312 INFO L87 Difference]: Start difference. First operand 41603 states and 146400 transitions. Second operand 5 states. [2019-12-18 12:38:48,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:38:48,025 INFO L93 Difference]: Finished difference Result 52097 states and 180773 transitions. [2019-12-18 12:38:48,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:38:48,026 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-18 12:38:48,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:38:48,123 INFO L225 Difference]: With dead ends: 52097 [2019-12-18 12:38:48,123 INFO L226 Difference]: Without dead ends: 52074 [2019-12-18 12:38:48,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:38:48,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52074 states. [2019-12-18 12:38:48,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52074 to 40948. [2019-12-18 12:38:48,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40948 states. [2019-12-18 12:38:48,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40948 states to 40948 states and 143892 transitions. [2019-12-18 12:38:48,919 INFO L78 Accepts]: Start accepts. Automaton has 40948 states and 143892 transitions. Word has length 24 [2019-12-18 12:38:48,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:38:48,919 INFO L462 AbstractCegarLoop]: Abstraction has 40948 states and 143892 transitions. [2019-12-18 12:38:48,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:38:48,920 INFO L276 IsEmpty]: Start isEmpty. Operand 40948 states and 143892 transitions. [2019-12-18 12:38:48,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 12:38:48,939 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:38:48,939 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:38:48,939 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:38:48,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:38:48,940 INFO L82 PathProgramCache]: Analyzing trace with hash 2109697444, now seen corresponding path program 1 times [2019-12-18 12:38:48,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:38:48,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188372662] [2019-12-18 12:38:48,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:38:48,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:38:49,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:38:49,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188372662] [2019-12-18 12:38:49,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:38:49,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:38:49,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283138932] [2019-12-18 12:38:49,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:38:49,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:38:49,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:38:49,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:38:49,275 INFO L87 Difference]: Start difference. First operand 40948 states and 143892 transitions. Second operand 5 states. [2019-12-18 12:38:49,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:38:49,384 INFO L93 Difference]: Finished difference Result 20928 states and 74435 transitions. [2019-12-18 12:38:49,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:38:49,390 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 12:38:49,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:38:49,429 INFO L225 Difference]: With dead ends: 20928 [2019-12-18 12:38:49,430 INFO L226 Difference]: Without dead ends: 20928 [2019-12-18 12:38:49,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:38:49,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20928 states. [2019-12-18 12:38:49,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20928 to 20736. [2019-12-18 12:38:49,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20736 states. [2019-12-18 12:38:49,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20736 states to 20736 states and 73779 transitions. [2019-12-18 12:38:49,772 INFO L78 Accepts]: Start accepts. Automaton has 20736 states and 73779 transitions. Word has length 28 [2019-12-18 12:38:49,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:38:49,773 INFO L462 AbstractCegarLoop]: Abstraction has 20736 states and 73779 transitions. [2019-12-18 12:38:49,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:38:49,773 INFO L276 IsEmpty]: Start isEmpty. Operand 20736 states and 73779 transitions. [2019-12-18 12:38:49,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 12:38:49,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:38:49,807 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] [2019-12-18 12:38:49,807 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:38:49,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:38:49,807 INFO L82 PathProgramCache]: Analyzing trace with hash 708784038, now seen corresponding path program 1 times [2019-12-18 12:38:49,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:38:49,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473588941] [2019-12-18 12:38:49,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:38:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:38:49,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:38:49,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473588941] [2019-12-18 12:38:49,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:38:49,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:38:49,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749373924] [2019-12-18 12:38:49,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:38:49,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:38:49,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:38:49,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:38:49,877 INFO L87 Difference]: Start difference. First operand 20736 states and 73779 transitions. Second operand 4 states. [2019-12-18 12:38:49,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:38:49,999 INFO L93 Difference]: Finished difference Result 30054 states and 102106 transitions. [2019-12-18 12:38:50,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:38:50,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-18 12:38:50,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:38:50,038 INFO L225 Difference]: With dead ends: 30054 [2019-12-18 12:38:50,039 INFO L226 Difference]: Without dead ends: 21038 [2019-12-18 12:38:50,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:38:50,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21038 states. [2019-12-18 12:38:50,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21038 to 20942. [2019-12-18 12:38:50,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20942 states. [2019-12-18 12:38:50,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20942 states to 20942 states and 73630 transitions. [2019-12-18 12:38:50,377 INFO L78 Accepts]: Start accepts. Automaton has 20942 states and 73630 transitions. Word has length 42 [2019-12-18 12:38:50,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:38:50,377 INFO L462 AbstractCegarLoop]: Abstraction has 20942 states and 73630 transitions. [2019-12-18 12:38:50,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:38:50,378 INFO L276 IsEmpty]: Start isEmpty. Operand 20942 states and 73630 transitions. [2019-12-18 12:38:50,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 12:38:50,412 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:38:50,413 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] [2019-12-18 12:38:50,413 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:38:50,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:38:50,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1622826474, now seen corresponding path program 2 times [2019-12-18 12:38:50,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:38:50,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325516739] [2019-12-18 12:38:50,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:38:50,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:38:50,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:38:50,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325516739] [2019-12-18 12:38:50,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:38:50,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:38:50,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736817086] [2019-12-18 12:38:50,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:38:50,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:38:50,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:38:50,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:38:50,499 INFO L87 Difference]: Start difference. First operand 20942 states and 73630 transitions. Second operand 5 states. [2019-12-18 12:38:51,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:38:51,336 INFO L93 Difference]: Finished difference Result 31343 states and 109184 transitions. [2019-12-18 12:38:51,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:38:51,337 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-18 12:38:51,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:38:51,411 INFO L225 Difference]: With dead ends: 31343 [2019-12-18 12:38:51,412 INFO L226 Difference]: Without dead ends: 31343 [2019-12-18 12:38:51,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:38:51,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31343 states. [2019-12-18 12:38:51,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31343 to 28179. [2019-12-18 12:38:51,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28179 states. [2019-12-18 12:38:51,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28179 states to 28179 states and 98942 transitions. [2019-12-18 12:38:51,965 INFO L78 Accepts]: Start accepts. Automaton has 28179 states and 98942 transitions. Word has length 42 [2019-12-18 12:38:51,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:38:51,966 INFO L462 AbstractCegarLoop]: Abstraction has 28179 states and 98942 transitions. [2019-12-18 12:38:51,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:38:51,966 INFO L276 IsEmpty]: Start isEmpty. Operand 28179 states and 98942 transitions. [2019-12-18 12:38:52,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 12:38:52,004 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:38:52,004 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] [2019-12-18 12:38:52,004 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:38:52,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:38:52,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1262851908, now seen corresponding path program 3 times [2019-12-18 12:38:52,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:38:52,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261742977] [2019-12-18 12:38:52,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:38:52,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:38:52,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:38:52,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261742977] [2019-12-18 12:38:52,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:38:52,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:38:52,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358046236] [2019-12-18 12:38:52,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:38:52,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:38:52,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:38:52,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:38:52,093 INFO L87 Difference]: Start difference. First operand 28179 states and 98942 transitions. Second operand 6 states. [2019-12-18 12:38:52,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:38:52,311 INFO L93 Difference]: Finished difference Result 26793 states and 95440 transitions. [2019-12-18 12:38:52,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:38:52,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-18 12:38:52,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:38:52,376 INFO L225 Difference]: With dead ends: 26793 [2019-12-18 12:38:52,376 INFO L226 Difference]: Without dead ends: 24459 [2019-12-18 12:38:52,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:38:52,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24459 states. [2019-12-18 12:38:52,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24459 to 23427. [2019-12-18 12:38:52,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23427 states. [2019-12-18 12:38:52,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23427 states to 23427 states and 83180 transitions. [2019-12-18 12:38:52,882 INFO L78 Accepts]: Start accepts. Automaton has 23427 states and 83180 transitions. Word has length 42 [2019-12-18 12:38:52,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:38:52,882 INFO L462 AbstractCegarLoop]: Abstraction has 23427 states and 83180 transitions. [2019-12-18 12:38:52,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:38:52,882 INFO L276 IsEmpty]: Start isEmpty. Operand 23427 states and 83180 transitions. [2019-12-18 12:38:52,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 12:38:52,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:38:52,923 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:38:52,923 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:38:52,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:38:52,924 INFO L82 PathProgramCache]: Analyzing trace with hash 712944392, now seen corresponding path program 1 times [2019-12-18 12:38:52,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:38:52,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122512489] [2019-12-18 12:38:52,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:38:52,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:38:52,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:38:53,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122512489] [2019-12-18 12:38:53,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:38:53,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:38:53,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872734936] [2019-12-18 12:38:53,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:38:53,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:38:53,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:38:53,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:38:53,003 INFO L87 Difference]: Start difference. First operand 23427 states and 83180 transitions. Second operand 4 states. [2019-12-18 12:38:53,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:38:53,388 INFO L93 Difference]: Finished difference Result 33565 states and 114667 transitions. [2019-12-18 12:38:53,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:38:53,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-18 12:38:53,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:38:53,416 INFO L225 Difference]: With dead ends: 33565 [2019-12-18 12:38:53,417 INFO L226 Difference]: Without dead ends: 10964 [2019-12-18 12:38:53,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:38:53,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10964 states. [2019-12-18 12:38:53,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10964 to 10964. [2019-12-18 12:38:53,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10964 states. [2019-12-18 12:38:53,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10964 states to 10964 states and 33801 transitions. [2019-12-18 12:38:53,610 INFO L78 Accepts]: Start accepts. Automaton has 10964 states and 33801 transitions. Word has length 57 [2019-12-18 12:38:53,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:38:53,610 INFO L462 AbstractCegarLoop]: Abstraction has 10964 states and 33801 transitions. [2019-12-18 12:38:53,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:38:53,611 INFO L276 IsEmpty]: Start isEmpty. Operand 10964 states and 33801 transitions. [2019-12-18 12:38:53,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 12:38:53,625 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:38:53,625 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:38:53,625 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:38:53,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:38:53,626 INFO L82 PathProgramCache]: Analyzing trace with hash 719186054, now seen corresponding path program 2 times [2019-12-18 12:38:53,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:38:53,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287443539] [2019-12-18 12:38:53,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:38:53,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:38:53,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:38:53,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287443539] [2019-12-18 12:38:53,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:38:53,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:38:53,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741196155] [2019-12-18 12:38:53,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:38:53,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:38:53,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:38:53,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:38:53,756 INFO L87 Difference]: Start difference. First operand 10964 states and 33801 transitions. Second operand 9 states. [2019-12-18 12:38:55,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:38:55,758 INFO L93 Difference]: Finished difference Result 80963 states and 252225 transitions. [2019-12-18 12:38:55,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-18 12:38:55,759 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-18 12:38:55,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:38:55,862 INFO L225 Difference]: With dead ends: 80963 [2019-12-18 12:38:55,862 INFO L226 Difference]: Without dead ends: 56302 [2019-12-18 12:38:55,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=477, Invalid=1593, Unknown=0, NotChecked=0, Total=2070 [2019-12-18 12:38:56,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56302 states. [2019-12-18 12:38:56,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56302 to 13593. [2019-12-18 12:38:56,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13593 states. [2019-12-18 12:38:56,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13593 states to 13593 states and 42350 transitions. [2019-12-18 12:38:56,722 INFO L78 Accepts]: Start accepts. Automaton has 13593 states and 42350 transitions. Word has length 57 [2019-12-18 12:38:56,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:38:56,722 INFO L462 AbstractCegarLoop]: Abstraction has 13593 states and 42350 transitions. [2019-12-18 12:38:56,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:38:56,723 INFO L276 IsEmpty]: Start isEmpty. Operand 13593 states and 42350 transitions. [2019-12-18 12:38:56,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 12:38:56,737 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:38:56,737 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:38:56,738 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:38:56,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:38:56,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1032821336, now seen corresponding path program 3 times [2019-12-18 12:38:56,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:38:56,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662972985] [2019-12-18 12:38:56,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:38:56,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:38:56,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:38:56,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662972985] [2019-12-18 12:38:56,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:38:56,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:38:56,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120602512] [2019-12-18 12:38:56,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:38:56,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:38:56,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:38:56,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:38:56,847 INFO L87 Difference]: Start difference. First operand 13593 states and 42350 transitions. Second operand 7 states. [2019-12-18 12:38:57,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:38:57,255 INFO L93 Difference]: Finished difference Result 35767 states and 109392 transitions. [2019-12-18 12:38:57,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:38:57,255 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 12:38:57,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:38:57,297 INFO L225 Difference]: With dead ends: 35767 [2019-12-18 12:38:57,297 INFO L226 Difference]: Without dead ends: 25000 [2019-12-18 12:38:57,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:38:57,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25000 states. [2019-12-18 12:38:57,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25000 to 16351. [2019-12-18 12:38:57,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16351 states. [2019-12-18 12:38:57,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16351 states to 16351 states and 50702 transitions. [2019-12-18 12:38:57,647 INFO L78 Accepts]: Start accepts. Automaton has 16351 states and 50702 transitions. Word has length 57 [2019-12-18 12:38:57,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:38:57,647 INFO L462 AbstractCegarLoop]: Abstraction has 16351 states and 50702 transitions. [2019-12-18 12:38:57,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:38:57,647 INFO L276 IsEmpty]: Start isEmpty. Operand 16351 states and 50702 transitions. [2019-12-18 12:38:57,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 12:38:57,666 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:38:57,666 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:38:57,666 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:38:57,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:38:57,667 INFO L82 PathProgramCache]: Analyzing trace with hash 315127332, now seen corresponding path program 4 times [2019-12-18 12:38:57,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:38:57,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776196316] [2019-12-18 12:38:57,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:38:57,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:38:57,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:38:57,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776196316] [2019-12-18 12:38:57,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:38:57,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:38:57,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273389178] [2019-12-18 12:38:57,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:38:57,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:38:57,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:38:57,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:38:57,834 INFO L87 Difference]: Start difference. First operand 16351 states and 50702 transitions. Second operand 9 states. [2019-12-18 12:38:59,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:38:59,787 INFO L93 Difference]: Finished difference Result 95460 states and 296034 transitions. [2019-12-18 12:38:59,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-18 12:38:59,788 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-18 12:38:59,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:38:59,934 INFO L225 Difference]: With dead ends: 95460 [2019-12-18 12:38:59,935 INFO L226 Difference]: Without dead ends: 78835 [2019-12-18 12:38:59,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=454, Invalid=1616, Unknown=0, NotChecked=0, Total=2070 [2019-12-18 12:39:00,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78835 states. [2019-12-18 12:39:00,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78835 to 21627. [2019-12-18 12:39:00,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21627 states. [2019-12-18 12:39:01,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21627 states to 21627 states and 67322 transitions. [2019-12-18 12:39:01,020 INFO L78 Accepts]: Start accepts. Automaton has 21627 states and 67322 transitions. Word has length 57 [2019-12-18 12:39:01,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:39:01,020 INFO L462 AbstractCegarLoop]: Abstraction has 21627 states and 67322 transitions. [2019-12-18 12:39:01,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:39:01,020 INFO L276 IsEmpty]: Start isEmpty. Operand 21627 states and 67322 transitions. [2019-12-18 12:39:01,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 12:39:01,042 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:39:01,042 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:39:01,042 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:39:01,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:39:01,043 INFO L82 PathProgramCache]: Analyzing trace with hash 57637352, now seen corresponding path program 5 times [2019-12-18 12:39:01,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:39:01,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270958454] [2019-12-18 12:39:01,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:39:01,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:39:01,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:39:01,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270958454] [2019-12-18 12:39:01,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:39:01,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:39:01,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255239889] [2019-12-18 12:39:01,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:39:01,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:39:01,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:39:01,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:39:01,120 INFO L87 Difference]: Start difference. First operand 21627 states and 67322 transitions. Second operand 7 states. [2019-12-18 12:39:01,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:39:01,646 INFO L93 Difference]: Finished difference Result 40740 states and 124618 transitions. [2019-12-18 12:39:01,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:39:01,647 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 12:39:01,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:39:01,735 INFO L225 Difference]: With dead ends: 40740 [2019-12-18 12:39:01,736 INFO L226 Difference]: Without dead ends: 35500 [2019-12-18 12:39:01,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:39:01,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35500 states. [2019-12-18 12:39:02,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35500 to 21867. [2019-12-18 12:39:02,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21867 states. [2019-12-18 12:39:02,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21867 states to 21867 states and 68068 transitions. [2019-12-18 12:39:02,295 INFO L78 Accepts]: Start accepts. Automaton has 21867 states and 68068 transitions. Word has length 57 [2019-12-18 12:39:02,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:39:02,296 INFO L462 AbstractCegarLoop]: Abstraction has 21867 states and 68068 transitions. [2019-12-18 12:39:02,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:39:02,296 INFO L276 IsEmpty]: Start isEmpty. Operand 21867 states and 68068 transitions. [2019-12-18 12:39:02,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 12:39:02,318 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:39:02,319 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:39:02,319 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:39:02,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:39:02,319 INFO L82 PathProgramCache]: Analyzing trace with hash 841823262, now seen corresponding path program 6 times [2019-12-18 12:39:02,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:39:02,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727590369] [2019-12-18 12:39:02,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:39:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:39:02,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:39:02,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727590369] [2019-12-18 12:39:02,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:39:02,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:39:02,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626377418] [2019-12-18 12:39:02,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:39:02,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:39:02,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:39:02,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:39:02,384 INFO L87 Difference]: Start difference. First operand 21867 states and 68068 transitions. Second operand 3 states. [2019-12-18 12:39:02,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:39:02,478 INFO L93 Difference]: Finished difference Result 21865 states and 68063 transitions. [2019-12-18 12:39:02,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:39:02,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-18 12:39:02,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:39:02,520 INFO L225 Difference]: With dead ends: 21865 [2019-12-18 12:39:02,520 INFO L226 Difference]: Without dead ends: 21865 [2019-12-18 12:39:02,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:39:02,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21865 states. [2019-12-18 12:39:03,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21865 to 20847. [2019-12-18 12:39:03,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20847 states. [2019-12-18 12:39:03,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20847 states to 20847 states and 65397 transitions. [2019-12-18 12:39:03,096 INFO L78 Accepts]: Start accepts. Automaton has 20847 states and 65397 transitions. Word has length 57 [2019-12-18 12:39:03,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:39:03,096 INFO L462 AbstractCegarLoop]: Abstraction has 20847 states and 65397 transitions. [2019-12-18 12:39:03,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:39:03,096 INFO L276 IsEmpty]: Start isEmpty. Operand 20847 states and 65397 transitions. [2019-12-18 12:39:03,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 12:39:03,118 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:39:03,118 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-18 12:39:03,118 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:39:03,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:39:03,118 INFO L82 PathProgramCache]: Analyzing trace with hash 157460257, now seen corresponding path program 1 times [2019-12-18 12:39:03,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:39:03,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170923716] [2019-12-18 12:39:03,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:39:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:39:03,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:39:03,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170923716] [2019-12-18 12:39:03,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:39:03,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:39:03,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946958634] [2019-12-18 12:39:03,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:39:03,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:39:03,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:39:03,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:39:03,173 INFO L87 Difference]: Start difference. First operand 20847 states and 65397 transitions. Second operand 3 states. [2019-12-18 12:39:03,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:39:03,255 INFO L93 Difference]: Finished difference Result 18988 states and 58394 transitions. [2019-12-18 12:39:03,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:39:03,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 12:39:03,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:39:03,289 INFO L225 Difference]: With dead ends: 18988 [2019-12-18 12:39:03,290 INFO L226 Difference]: Without dead ends: 18988 [2019-12-18 12:39:03,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:39:03,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18988 states. [2019-12-18 12:39:03,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18988 to 18142. [2019-12-18 12:39:03,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18142 states. [2019-12-18 12:39:03,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18142 states to 18142 states and 55627 transitions. [2019-12-18 12:39:03,546 INFO L78 Accepts]: Start accepts. Automaton has 18142 states and 55627 transitions. Word has length 58 [2019-12-18 12:39:03,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:39:03,547 INFO L462 AbstractCegarLoop]: Abstraction has 18142 states and 55627 transitions. [2019-12-18 12:39:03,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:39:03,547 INFO L276 IsEmpty]: Start isEmpty. Operand 18142 states and 55627 transitions. [2019-12-18 12:39:03,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 12:39:03,564 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:39:03,564 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-18 12:39:03,564 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:39:03,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:39:03,565 INFO L82 PathProgramCache]: Analyzing trace with hash 530809076, now seen corresponding path program 1 times [2019-12-18 12:39:03,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:39:03,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462766440] [2019-12-18 12:39:03,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:39:03,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:39:03,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:39:03,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462766440] [2019-12-18 12:39:03,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:39:03,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:39:03,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267001319] [2019-12-18 12:39:03,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:39:03,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:39:03,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:39:03,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:39:03,687 INFO L87 Difference]: Start difference. First operand 18142 states and 55627 transitions. Second operand 9 states. [2019-12-18 12:39:04,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:39:04,886 INFO L93 Difference]: Finished difference Result 31695 states and 96758 transitions. [2019-12-18 12:39:04,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 12:39:04,887 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-12-18 12:39:04,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:39:04,924 INFO L225 Difference]: With dead ends: 31695 [2019-12-18 12:39:04,925 INFO L226 Difference]: Without dead ends: 25279 [2019-12-18 12:39:04,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-18 12:39:05,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25279 states. [2019-12-18 12:39:05,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25279 to 18493. [2019-12-18 12:39:05,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18493 states. [2019-12-18 12:39:05,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18493 states to 18493 states and 56427 transitions. [2019-12-18 12:39:05,255 INFO L78 Accepts]: Start accepts. Automaton has 18493 states and 56427 transitions. Word has length 59 [2019-12-18 12:39:05,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:39:05,255 INFO L462 AbstractCegarLoop]: Abstraction has 18493 states and 56427 transitions. [2019-12-18 12:39:05,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:39:05,256 INFO L276 IsEmpty]: Start isEmpty. Operand 18493 states and 56427 transitions. [2019-12-18 12:39:05,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 12:39:05,274 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:39:05,274 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-18 12:39:05,275 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:39:05,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:39:05,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1658578216, now seen corresponding path program 2 times [2019-12-18 12:39:05,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:39:05,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311498563] [2019-12-18 12:39:05,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:39:05,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:39:05,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:39:05,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311498563] [2019-12-18 12:39:05,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:39:05,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:39:05,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583010950] [2019-12-18 12:39:05,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:39:05,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:39:05,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:39:05,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:39:05,420 INFO L87 Difference]: Start difference. First operand 18493 states and 56427 transitions. Second operand 10 states. [2019-12-18 12:39:06,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:39:06,591 INFO L93 Difference]: Finished difference Result 33670 states and 102238 transitions. [2019-12-18 12:39:06,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 12:39:06,592 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-12-18 12:39:06,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:39:06,638 INFO L225 Difference]: With dead ends: 33670 [2019-12-18 12:39:06,638 INFO L226 Difference]: Without dead ends: 28230 [2019-12-18 12:39:06,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=650, Unknown=0, NotChecked=0, Total=812 [2019-12-18 12:39:06,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28230 states. [2019-12-18 12:39:06,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28230 to 18257. [2019-12-18 12:39:06,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18257 states. [2019-12-18 12:39:07,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18257 states to 18257 states and 55563 transitions. [2019-12-18 12:39:07,007 INFO L78 Accepts]: Start accepts. Automaton has 18257 states and 55563 transitions. Word has length 59 [2019-12-18 12:39:07,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:39:07,007 INFO L462 AbstractCegarLoop]: Abstraction has 18257 states and 55563 transitions. [2019-12-18 12:39:07,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:39:07,007 INFO L276 IsEmpty]: Start isEmpty. Operand 18257 states and 55563 transitions. [2019-12-18 12:39:07,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 12:39:07,030 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:39:07,030 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-18 12:39:07,031 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:39:07,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:39:07,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1816631088, now seen corresponding path program 3 times [2019-12-18 12:39:07,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:39:07,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701818946] [2019-12-18 12:39:07,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:39:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:39:07,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:39:07,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701818946] [2019-12-18 12:39:07,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:39:07,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:39:07,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816942115] [2019-12-18 12:39:07,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:39:07,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:39:07,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:39:07,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:39:07,203 INFO L87 Difference]: Start difference. First operand 18257 states and 55563 transitions. Second operand 11 states. [2019-12-18 12:39:08,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:39:08,384 INFO L93 Difference]: Finished difference Result 30310 states and 91877 transitions. [2019-12-18 12:39:08,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 12:39:08,384 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-18 12:39:08,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:39:08,453 INFO L225 Difference]: With dead ends: 30310 [2019-12-18 12:39:08,453 INFO L226 Difference]: Without dead ends: 27646 [2019-12-18 12:39:08,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2019-12-18 12:39:08,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27646 states. [2019-12-18 12:39:08,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27646 to 18119. [2019-12-18 12:39:08,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18119 states. [2019-12-18 12:39:08,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18119 states to 18119 states and 55156 transitions. [2019-12-18 12:39:08,955 INFO L78 Accepts]: Start accepts. Automaton has 18119 states and 55156 transitions. Word has length 59 [2019-12-18 12:39:08,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:39:08,955 INFO L462 AbstractCegarLoop]: Abstraction has 18119 states and 55156 transitions. [2019-12-18 12:39:08,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:39:08,955 INFO L276 IsEmpty]: Start isEmpty. Operand 18119 states and 55156 transitions. [2019-12-18 12:39:08,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 12:39:08,975 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:39:08,975 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:39:08,975 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:39:08,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:39:08,975 INFO L82 PathProgramCache]: Analyzing trace with hash -152494338, now seen corresponding path program 4 times [2019-12-18 12:39:08,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:39:08,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962961154] [2019-12-18 12:39:08,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:39:08,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:39:09,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:39:09,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962961154] [2019-12-18 12:39:09,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:39:09,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:39:09,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248125198] [2019-12-18 12:39:09,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 12:39:09,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:39:09,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 12:39:09,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:39:09,193 INFO L87 Difference]: Start difference. First operand 18119 states and 55156 transitions. Second operand 12 states. [2019-12-18 12:39:10,082 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-12-18 12:39:10,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:39:10,302 INFO L93 Difference]: Finished difference Result 27796 states and 84306 transitions. [2019-12-18 12:39:10,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:39:10,302 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-12-18 12:39:10,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:39:10,342 INFO L225 Difference]: With dead ends: 27796 [2019-12-18 12:39:10,342 INFO L226 Difference]: Without dead ends: 27614 [2019-12-18 12:39:10,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 12:39:10,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27614 states. [2019-12-18 12:39:10,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27614 to 17979. [2019-12-18 12:39:10,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17979 states. [2019-12-18 12:39:10,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17979 states to 17979 states and 54783 transitions. [2019-12-18 12:39:10,677 INFO L78 Accepts]: Start accepts. Automaton has 17979 states and 54783 transitions. Word has length 59 [2019-12-18 12:39:10,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:39:10,677 INFO L462 AbstractCegarLoop]: Abstraction has 17979 states and 54783 transitions. [2019-12-18 12:39:10,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 12:39:10,677 INFO L276 IsEmpty]: Start isEmpty. Operand 17979 states and 54783 transitions. [2019-12-18 12:39:10,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 12:39:10,696 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:39:10,696 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-18 12:39:10,696 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:39:10,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:39:10,696 INFO L82 PathProgramCache]: Analyzing trace with hash -300648998, now seen corresponding path program 5 times [2019-12-18 12:39:10,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:39:10,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024893347] [2019-12-18 12:39:10,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:39:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:39:10,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:39:10,821 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:39:10,822 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:39:10,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] ULTIMATE.startENTRY-->L845: Formula: (let ((.cse0 (store |v_#valid_101| 0 0))) (and (= 0 v_~y$r_buff0_thd3~0_200) (= v_~weak$$choice2~0_146 0) (= v_~z~0_79 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t453~0.base_42| 4)) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff0_used~0_906 0) (= v_~__unbuffered_cnt~0_174 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t453~0.base_42| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t453~0.base_42|) |v_ULTIMATE.start_main_~#t453~0.offset_27| 0))) (= v_~main$tmp_guard1~0_51 0) (= 0 v_~__unbuffered_p3_EAX~0_50) (= 0 |v_ULTIMATE.start_main_~#t453~0.offset_27|) (= 0 v_~__unbuffered_p2_EAX~0_106) (= 0 v_~y$r_buff0_thd2~0_339) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t453~0.base_42|) (= v_~y$mem_tmp~0_18 0) (= 0 v_~__unbuffered_p1_EAX~0_54) (= 0 v_~y$r_buff1_thd4~0_165) (= 0 v_~y$w_buff0~0_533) (= 0 v_~y$r_buff1_thd2~0_235) (= 0 v_~__unbuffered_p3_EBX~0_50) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff1~0_348 0) (= 0 v_~y$r_buff0_thd4~0_151) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_p0_EAX~0_64) (< 0 |v_#StackHeapBarrier_20|) (= 0 v_~weak$$choice0~0_16) (= v_~a~0_35 0) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~y$flush_delayed~0_42) (= (select .cse0 |v_ULTIMATE.start_main_~#t453~0.base_42|) 0) (= v_~x~0_39 0) (= v_~y$r_buff0_thd1~0_73 0) (= 0 v_~y$r_buff1_thd1~0_74) (= v_~y~0_158 0) (= v_~y$r_buff1_thd0~0_169 0) (= v_~y$r_buff0_thd0~0_171 0) (= |v_#valid_99| (store .cse0 |v_ULTIMATE.start_main_~#t453~0.base_42| 1)) (= v_~y$w_buff1_used~0_540 0) (= 0 v_~y$r_buff1_thd3~0_136))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_101|, #memory_int=|v_#memory_int_22|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_110|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_39|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_43|, ULTIMATE.start_main_~#t455~0.offset=|v_ULTIMATE.start_main_~#t455~0.offset_18|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_35, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_64, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_136, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_73, ~y$flush_delayed~0=v_~y$flush_delayed~0_42, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_50, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_106, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_21|, ULTIMATE.start_main_~#t456~0.base=|v_ULTIMATE.start_main_~#t456~0.base_25|, ~weak$$choice0~0=v_~weak$$choice0~0_16, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_165, ~y$w_buff1~0=v_~y$w_buff1~0_348, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_339, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_174, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_169, ~x~0=v_~x~0_39, ULTIMATE.start_main_~#t456~0.offset=|v_ULTIMATE.start_main_~#t456~0.offset_19|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_906, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_51, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_41|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_239|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_74, ~y$w_buff0~0=v_~y$w_buff0~0_533, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_200, ULTIMATE.start_main_~#t455~0.base=|v_ULTIMATE.start_main_~#t455~0.base_24|, ~y~0=v_~y~0_158, ULTIMATE.start_main_~#t454~0.offset=|v_ULTIMATE.start_main_~#t454~0.offset_19|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_10|, ULTIMATE.start_main_~#t453~0.base=|v_ULTIMATE.start_main_~#t453~0.base_42|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_50, ULTIMATE.start_main_~#t453~0.offset=|v_ULTIMATE.start_main_~#t453~0.offset_27|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_235, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_151, ULTIMATE.start_main_~#t454~0.base=|v_ULTIMATE.start_main_~#t454~0.base_34|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_33|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_171, #valid=|v_#valid_99|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_79, ~weak$$choice2~0=v_~weak$$choice2~0_146, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_540} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t455~0.offset, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t456~0.base, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t456~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t455~0.base, ~y~0, ULTIMATE.start_main_~#t454~0.offset, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t453~0.base, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t453~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_~#t454~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 12:39:10,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] L845-1-->L847: Formula: (and (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t454~0.base_11| 4) |v_#length_23|) (= |v_ULTIMATE.start_main_~#t454~0.offset_10| 0) (= 0 (select |v_#valid_44| |v_ULTIMATE.start_main_~#t454~0.base_11|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t454~0.base_11|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t454~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t454~0.base_11|) |v_ULTIMATE.start_main_~#t454~0.offset_10| 1)) |v_#memory_int_17|) (not (= 0 |v_ULTIMATE.start_main_~#t454~0.base_11|)) (= |v_#valid_43| (store |v_#valid_44| |v_ULTIMATE.start_main_~#t454~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t454~0.base=|v_ULTIMATE.start_main_~#t454~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_23|, ULTIMATE.start_main_~#t454~0.offset=|v_ULTIMATE.start_main_~#t454~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t454~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t454~0.offset] because there is no mapped edge [2019-12-18 12:39:10,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L847-1-->L849: Formula: (and (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t455~0.base_10| 4)) (= 0 |v_ULTIMATE.start_main_~#t455~0.offset_9|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t455~0.base_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t455~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t455~0.base_10|) |v_ULTIMATE.start_main_~#t455~0.offset_9| 2)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t455~0.base_10| 0)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t455~0.base_10|)) (= (store |v_#valid_40| |v_ULTIMATE.start_main_~#t455~0.base_10| 1) |v_#valid_39|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t455~0.base=|v_ULTIMATE.start_main_~#t455~0.base_10|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t455~0.offset=|v_ULTIMATE.start_main_~#t455~0.offset_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t455~0.base, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t455~0.offset] because there is no mapped edge [2019-12-18 12:39:10,830 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] P2ENTRY-->L4-3: Formula: (and (= ~y$w_buff0~0_In-267354685 ~y$w_buff1~0_Out-267354685) (= P2Thread1of1ForFork3___VERIFIER_assert_~expression_Out-267354685 |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression_Out-267354685|) (= P2Thread1of1ForFork3_~arg.offset_Out-267354685 |P2Thread1of1ForFork3_#in~arg.offset_In-267354685|) (= 0 (mod ~y$w_buff1_used~0_Out-267354685 256)) (= ~y$w_buff1_used~0_Out-267354685 ~y$w_buff0_used~0_In-267354685) (= |P2Thread1of1ForFork3_#in~arg.base_In-267354685| P2Thread1of1ForFork3_~arg.base_Out-267354685) (= 1 |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression_Out-267354685|) (= ~y$w_buff0_used~0_Out-267354685 1) (= 1 ~y$w_buff0~0_Out-267354685)) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-267354685, ~y$w_buff0~0=~y$w_buff0~0_In-267354685, P2Thread1of1ForFork3_#in~arg.base=|P2Thread1of1ForFork3_#in~arg.base_In-267354685|, P2Thread1of1ForFork3_#in~arg.offset=|P2Thread1of1ForFork3_#in~arg.offset_In-267354685|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-267354685, ~y$w_buff1~0=~y$w_buff1~0_Out-267354685, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression=|P2Thread1of1ForFork3___VERIFIER_assert_#in~expression_Out-267354685|, ~y$w_buff0~0=~y$w_buff0~0_Out-267354685, P2Thread1of1ForFork3_~arg.base=P2Thread1of1ForFork3_~arg.base_Out-267354685, P2Thread1of1ForFork3___VERIFIER_assert_~expression=P2Thread1of1ForFork3___VERIFIER_assert_~expression_Out-267354685, P2Thread1of1ForFork3_#in~arg.base=|P2Thread1of1ForFork3_#in~arg.base_In-267354685|, P2Thread1of1ForFork3_~arg.offset=P2Thread1of1ForFork3_~arg.offset_Out-267354685, P2Thread1of1ForFork3_#in~arg.offset=|P2Thread1of1ForFork3_#in~arg.offset_In-267354685|, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-267354685} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression, ~y$w_buff0~0, P2Thread1of1ForFork3_~arg.base, P2Thread1of1ForFork3___VERIFIER_assert_~expression, P2Thread1of1ForFork3_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 12:39:10,833 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [809] [809] L849-1-->L851: Formula: (and (= |v_ULTIMATE.start_main_~#t456~0.offset_11| 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t456~0.base_13| 4) |v_#length_21|) (= (store |v_#valid_42| |v_ULTIMATE.start_main_~#t456~0.base_13| 1) |v_#valid_41|) (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t456~0.base_13|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t456~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t456~0.base_13|) |v_ULTIMATE.start_main_~#t456~0.offset_11| 3)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t456~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t456~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_6|, ULTIMATE.start_main_~#t456~0.base=|v_ULTIMATE.start_main_~#t456~0.base_13|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, #length=|v_#length_21|, ULTIMATE.start_main_~#t456~0.offset=|v_ULTIMATE.start_main_~#t456~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t456~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t456~0.offset] because there is no mapped edge [2019-12-18 12:39:10,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_23 v_~__unbuffered_p0_EAX~0_23) (= v_P0Thread1of1ForFork1_~arg.offset_15 |v_P0Thread1of1ForFork1_#in~arg.offset_15|) (= |v_P0Thread1of1ForFork1_#in~arg.base_15| v_P0Thread1of1ForFork1_~arg.base_15) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_~__unbuffered_cnt~0_106 (+ v_~__unbuffered_cnt~0_107 1)) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|) (= v_~a~0_19 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~x~0=v_~x~0_23} OutVars{~a~0=v_~a~0_19, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_23, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~x~0=v_~x~0_23, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_15} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 12:39:10,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L822-2-->L822-5: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-733221519 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd4~0_In-733221519 256) 0)) (.cse1 (= |P3Thread1of1ForFork0_#t~ite33_Out-733221519| |P3Thread1of1ForFork0_#t~ite32_Out-733221519|))) (or (and (not .cse0) (= ~y$w_buff1~0_In-733221519 |P3Thread1of1ForFork0_#t~ite32_Out-733221519|) .cse1 (not .cse2)) (and (= ~y~0_In-733221519 |P3Thread1of1ForFork0_#t~ite32_Out-733221519|) (or .cse2 .cse0) .cse1))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-733221519, ~y$w_buff1~0=~y$w_buff1~0_In-733221519, ~y~0=~y~0_In-733221519, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-733221519} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-733221519, ~y$w_buff1~0=~y$w_buff1~0_In-733221519, ~y~0=~y~0_In-733221519, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out-733221519|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out-733221519|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-733221519} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-18 12:39:10,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1854435438 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1854435438 256) 0))) (or (and (= ~y$w_buff0_used~0_In1854435438 |P2Thread1of1ForFork3_#t~ite28_Out1854435438|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork3_#t~ite28_Out1854435438| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1854435438, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1854435438} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1854435438, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1854435438, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out1854435438|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-18 12:39:10,843 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L823-->L823-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In490583400 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In490583400 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork0_#t~ite34_Out490583400|)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In490583400 |P3Thread1of1ForFork0_#t~ite34_Out490583400|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In490583400, ~y$w_buff0_used~0=~y$w_buff0_used~0_In490583400} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In490583400, ~y$w_buff0_used~0=~y$w_buff0_used~0_In490583400, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out490583400|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-18 12:39:10,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In1570075152 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1570075152 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In1570075152 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd3~0_In1570075152 256) 0))) (or (and (= |P2Thread1of1ForFork3_#t~ite29_Out1570075152| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork3_#t~ite29_Out1570075152| ~y$w_buff1_used~0_In1570075152) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1570075152, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1570075152, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1570075152, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1570075152} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1570075152, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1570075152, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1570075152, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out1570075152|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1570075152} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-18 12:39:10,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1575635864 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite8_In-1575635864| |P1Thread1of1ForFork2_#t~ite8_Out-1575635864|) (not .cse0) (= ~y$w_buff0~0_In-1575635864 |P1Thread1of1ForFork2_#t~ite9_Out-1575635864|)) (and (= ~y$w_buff0~0_In-1575635864 |P1Thread1of1ForFork2_#t~ite8_Out-1575635864|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1575635864 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-1575635864 256)) (and (= (mod ~y$w_buff1_used~0_In-1575635864 256) 0) .cse1) (and (= (mod ~y$r_buff1_thd2~0_In-1575635864 256) 0) .cse1))) (= |P1Thread1of1ForFork2_#t~ite9_Out-1575635864| |P1Thread1of1ForFork2_#t~ite8_Out-1575635864|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1575635864, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1575635864, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_In-1575635864|, ~y$w_buff0~0=~y$w_buff0~0_In-1575635864, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1575635864, ~weak$$choice2~0=~weak$$choice2~0_In-1575635864, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1575635864} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1575635864, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1575635864|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1575635864, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-1575635864|, ~y$w_buff0~0=~y$w_buff0~0_In-1575635864, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1575635864, ~weak$$choice2~0=~weak$$choice2~0_In-1575635864, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1575635864} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 12:39:10,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L802-->L803: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1136653629 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1136653629 256)))) (or (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd3~0_Out-1136653629 0)) (and (= ~y$r_buff0_thd3~0_In-1136653629 ~y$r_buff0_thd3~0_Out-1136653629) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1136653629, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1136653629} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out-1136653629|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1136653629, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1136653629} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 12:39:10,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L803-->L803-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In227333529 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In227333529 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In227333529 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In227333529 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork3_#t~ite31_Out227333529|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In227333529 |P2Thread1of1ForFork3_#t~ite31_Out227333529|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In227333529, ~y$w_buff0_used~0=~y$w_buff0_used~0_In227333529, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In227333529, ~y$w_buff1_used~0=~y$w_buff1_used~0_In227333529} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In227333529, ~y$w_buff0_used~0=~y$w_buff0_used~0_In227333529, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In227333529, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out227333529|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In227333529} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-18 12:39:10,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#res.offset_5| 0) (= 0 |v_P2Thread1of1ForFork3_#res.base_5|) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= |v_P2Thread1of1ForFork3_#t~ite31_40| v_~y$r_buff1_thd3~0_57)) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_57, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_39|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_5|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 12:39:10,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L824-->L824-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In1397763898 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd4~0_In1397763898 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1397763898 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd4~0_In1397763898 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork0_#t~ite35_Out1397763898|)) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1397763898 |P3Thread1of1ForFork0_#t~ite35_Out1397763898|) (or .cse0 .cse1)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1397763898, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1397763898, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1397763898, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1397763898} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1397763898, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1397763898, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1397763898, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out1397763898|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1397763898} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-18 12:39:10,852 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L825-->L825-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd4~0_In968806814 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In968806814 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd4~0_In968806814 |P3Thread1of1ForFork0_#t~ite36_Out968806814|)) (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork0_#t~ite36_Out968806814|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In968806814, ~y$w_buff0_used~0=~y$w_buff0_used~0_In968806814} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In968806814, ~y$w_buff0_used~0=~y$w_buff0_used~0_In968806814, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out968806814|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-18 12:39:10,853 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L826-->L826-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-537178692 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In-537178692 256))) (.cse2 (= (mod ~y$r_buff1_thd4~0_In-537178692 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-537178692 256)))) (or (and (= |P3Thread1of1ForFork0_#t~ite37_Out-537178692| ~y$r_buff1_thd4~0_In-537178692) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P3Thread1of1ForFork0_#t~ite37_Out-537178692| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-537178692, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-537178692, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-537178692, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-537178692} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-537178692, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-537178692, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-537178692, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out-537178692|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-537178692} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-18 12:39:10,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L826-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#res.base_5| 0) (= |v_P3Thread1of1ForFork0_#t~ite37_36| v_~y$r_buff1_thd4~0_55) (= 0 |v_P3Thread1of1ForFork0_#res.offset_5|) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_55, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_5|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_35|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 12:39:10,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L764-->L764-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1493060747 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_In1493060747| |P1Thread1of1ForFork2_#t~ite11_Out1493060747|) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite12_Out1493060747| ~y$w_buff1~0_In1493060747)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1493060747 256) 0))) (or (and (= (mod ~y$w_buff1_used~0_In1493060747 256) 0) .cse1) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In1493060747 256) 0)) (= (mod ~y$w_buff0_used~0_In1493060747 256) 0))) .cse0 (= |P1Thread1of1ForFork2_#t~ite11_Out1493060747| ~y$w_buff1~0_In1493060747) (= |P1Thread1of1ForFork2_#t~ite11_Out1493060747| |P1Thread1of1ForFork2_#t~ite12_Out1493060747|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1493060747, ~y$w_buff1~0=~y$w_buff1~0_In1493060747, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1493060747, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1493060747, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In1493060747|, ~weak$$choice2~0=~weak$$choice2~0_In1493060747, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1493060747} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1493060747, ~y$w_buff1~0=~y$w_buff1~0_In1493060747, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1493060747, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1493060747, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1493060747|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1493060747|, ~weak$$choice2~0=~weak$$choice2~0_In1493060747, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1493060747} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 12:39:10,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2037736700 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite14_In-2037736700| |P1Thread1of1ForFork2_#t~ite14_Out-2037736700|) (= ~y$w_buff0_used~0_In-2037736700 |P1Thread1of1ForFork2_#t~ite15_Out-2037736700|)) (and (= |P1Thread1of1ForFork2_#t~ite15_Out-2037736700| |P1Thread1of1ForFork2_#t~ite14_Out-2037736700|) .cse0 (= ~y$w_buff0_used~0_In-2037736700 |P1Thread1of1ForFork2_#t~ite14_Out-2037736700|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-2037736700 256) 0))) (or (= (mod ~y$w_buff0_used~0_In-2037736700 256) 0) (and (= 0 (mod ~y$w_buff1_used~0_In-2037736700 256)) .cse1) (and (= (mod ~y$r_buff1_thd2~0_In-2037736700 256) 0) .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2037736700, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2037736700, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2037736700, ~weak$$choice2~0=~weak$$choice2~0_In-2037736700, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In-2037736700|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2037736700} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2037736700, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2037736700, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2037736700, ~weak$$choice2~0=~weak$$choice2~0_In-2037736700, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-2037736700|, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out-2037736700|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2037736700} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 12:39:10,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L767-->L768: Formula: (and (= v_~y$r_buff0_thd2~0_109 v_~y$r_buff0_thd2~0_108) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_109, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_8|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_108, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_9|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_8|, ~weak$$choice2~0=v_~weak$$choice2~0_39} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 12:39:10,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In289964276 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite23_In289964276| |P1Thread1of1ForFork2_#t~ite23_Out289964276|) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite24_Out289964276| ~y$r_buff1_thd2~0_In289964276)) (and .cse0 (= |P1Thread1of1ForFork2_#t~ite24_Out289964276| |P1Thread1of1ForFork2_#t~ite23_Out289964276|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In289964276 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In289964276 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In289964276 256)) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In289964276 256))))) (= |P1Thread1of1ForFork2_#t~ite23_Out289964276| ~y$r_buff1_thd2~0_In289964276)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In289964276, ~y$w_buff0_used~0=~y$w_buff0_used~0_In289964276, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In289964276, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In289964276|, ~weak$$choice2~0=~weak$$choice2~0_In289964276, ~y$w_buff1_used~0=~y$w_buff1_used~0_In289964276} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In289964276, ~y$w_buff0_used~0=~y$w_buff0_used~0_In289964276, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In289964276, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out289964276|, ~weak$$choice2~0=~weak$$choice2~0_In289964276, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out289964276|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In289964276} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-18 12:39:10,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L770-->L778: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~y~0_29 v_~y$mem_tmp~0_6) (= 0 v_~y$flush_delayed~0_8) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_6, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_6, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~y~0=v_~y~0_29, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 12:39:10,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L851-1-->L857: Formula: (and (= 4 v_~__unbuffered_cnt~0_20) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 12:39:10,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L857-2-->L857-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In1802257968 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1802257968 256)))) (or (and (= ~y~0_In1802257968 |ULTIMATE.start_main_#t~ite42_Out1802257968|) (or .cse0 .cse1)) (and (not .cse0) (= ~y$w_buff1~0_In1802257968 |ULTIMATE.start_main_#t~ite42_Out1802257968|) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1802257968, ~y~0=~y~0_In1802257968, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1802257968, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1802257968} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1802257968, ~y~0=~y~0_In1802257968, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1802257968|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1802257968, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1802257968} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 12:39:10,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L857-4-->L858: Formula: (= v_~y~0_46 |v_ULTIMATE.start_main_#t~ite42_14|) InVars {ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_14|} OutVars{ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_13|, ~y~0=v_~y~0_46, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 12:39:10,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L858-->L858-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-630647716 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-630647716 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out-630647716| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-630647716| ~y$w_buff0_used~0_In-630647716)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-630647716, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-630647716} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-630647716, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-630647716, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-630647716|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 12:39:10,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L859-->L859-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1745783145 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1745783145 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1745783145 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1745783145 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-1745783145 |ULTIMATE.start_main_#t~ite45_Out-1745783145|) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite45_Out-1745783145| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1745783145, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1745783145, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1745783145, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1745783145} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1745783145, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1745783145, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1745783145, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1745783145|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1745783145} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 12:39:10,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L860-->L860-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1851048468 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1851048468 256)))) (or (and (= ~y$r_buff0_thd0~0_In-1851048468 |ULTIMATE.start_main_#t~ite46_Out-1851048468|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite46_Out-1851048468| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1851048468, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1851048468} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1851048468, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1851048468, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1851048468|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 12:39:10,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L861-->L861-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In-650145266 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-650145266 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-650145266 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-650145266 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out-650145266| ~y$r_buff1_thd0~0_In-650145266) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite47_Out-650145266| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-650145266, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-650145266, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-650145266, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-650145266} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-650145266, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-650145266, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-650145266|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-650145266, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-650145266} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 12:39:10,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L861-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y$r_buff1_thd0~0_133 |v_ULTIMATE.start_main_#t~ite47_73|) (= 0 v_~__unbuffered_p2_EAX~0_78) (= 0 v_~__unbuffered_p1_EAX~0_32) (= 0 v_~__unbuffered_p3_EBX~0_31) (= 0 v_~__unbuffered_p0_EAX~0_46) (= 1 v_~__unbuffered_p3_EAX~0_31) (= v_~main$tmp_guard1~0_29 0) (= (mod v_~main$tmp_guard1~0_29 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_31, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_73|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_78, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_31} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_31, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_72|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_78, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_31, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_133, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 12:39:10,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:39:10 BasicIcfg [2019-12-18 12:39:10,995 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:39:10,997 INFO L168 Benchmark]: Toolchain (without parser) took 140183.71 ms. Allocated memory was 138.4 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 100.3 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-18 12:39:11,000 INFO L168 Benchmark]: CDTParser took 1.46 ms. Allocated memory is still 138.4 MB. Free memory was 120.4 MB in the beginning and 120.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-18 12:39:11,000 INFO L168 Benchmark]: CACSL2BoogieTranslator took 743.56 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 100.1 MB in the beginning and 154.6 MB in the end (delta: -54.5 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. [2019-12-18 12:39:11,001 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.62 ms. Allocated memory is still 201.9 MB. Free memory was 154.6 MB in the beginning and 152.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 12:39:11,001 INFO L168 Benchmark]: Boogie Preprocessor took 45.60 ms. Allocated memory is still 201.9 MB. Free memory was 152.0 MB in the beginning and 150.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 12:39:11,002 INFO L168 Benchmark]: RCFGBuilder took 833.54 ms. Allocated memory is still 201.9 MB. Free memory was 149.3 MB in the beginning and 100.3 MB in the end (delta: 49.0 MB). Peak memory consumption was 49.0 MB. Max. memory is 7.1 GB. [2019-12-18 12:39:11,002 INFO L168 Benchmark]: TraceAbstraction took 138476.98 ms. Allocated memory was 201.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 99.6 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 12:39:11,009 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.46 ms. Allocated memory is still 138.4 MB. Free memory was 120.4 MB in the beginning and 120.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 743.56 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 100.1 MB in the beginning and 154.6 MB in the end (delta: -54.5 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.62 ms. Allocated memory is still 201.9 MB. Free memory was 154.6 MB in the beginning and 152.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.60 ms. Allocated memory is still 201.9 MB. Free memory was 152.0 MB in the beginning and 150.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 833.54 ms. Allocated memory is still 201.9 MB. Free memory was 149.3 MB in the beginning and 100.3 MB in the end (delta: 49.0 MB). Peak memory consumption was 49.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 138476.98 ms. Allocated memory was 201.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 99.6 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.4s, 182 ProgramPointsBefore, 88 ProgramPointsAfterwards, 210 TransitionsBefore, 92 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 29 ChoiceCompositions, 7271 VarBasedMoverChecksPositive, 240 VarBasedMoverChecksNegative, 64 SemBasedMoverChecksPositive, 256 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 72619 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L845] FCALL, FORK 0 pthread_create(&t453, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L847] FCALL, FORK 0 pthread_create(&t454, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L849] FCALL, FORK 0 pthread_create(&t455, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L789] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L790] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L791] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L792] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L793] 3 y$r_buff0_thd3 = (_Bool)1 [L796] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L799] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L851] FCALL, FORK 0 pthread_create(&t456, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 4 z = 1 [L816] 4 __unbuffered_p3_EAX = z [L819] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L755] 2 x = 1 [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L762] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L763] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L823] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L824] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L825] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L764] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L765] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L857] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 138.0s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 31.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4500 SDtfs, 6943 SDslu, 16694 SDs, 0 SdLazy, 6069 SolverSat, 288 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 278 GetRequests, 28 SyntacticMatches, 6 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1777 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=218838occurred 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: 65.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 197610 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 942 NumberOfCodeBlocks, 942 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 862 ConstructedInterpolants, 0 QuantifiedInterpolants, 148246 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...