/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-60729f1 [2020-11-11 18:15:27,242 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-11 18:15:27,247 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-11 18:15:27,304 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-11 18:15:27,305 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-11 18:15:27,309 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-11 18:15:27,312 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-11 18:15:27,319 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-11 18:15:27,322 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-11 18:15:27,327 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-11 18:15:27,329 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-11 18:15:27,330 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-11 18:15:27,330 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-11 18:15:27,333 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-11 18:15:27,335 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-11 18:15:27,337 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-11 18:15:27,338 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-11 18:15:27,342 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-11 18:15:27,350 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-11 18:15:27,356 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-11 18:15:27,358 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-11 18:15:27,360 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-11 18:15:27,361 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-11 18:15:27,362 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-11 18:15:27,365 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-11 18:15:27,365 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-11 18:15:27,365 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-11 18:15:27,366 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-11 18:15:27,367 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-11 18:15:27,368 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-11 18:15:27,368 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-11 18:15:27,369 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-11 18:15:27,370 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-11 18:15:27,371 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-11 18:15:27,372 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-11 18:15:27,372 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-11 18:15:27,373 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-11 18:15:27,373 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-11 18:15:27,374 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-11 18:15:27,375 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-11 18:15:27,376 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-11 18:15:27,377 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2020-11-11 18:15:27,405 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-11 18:15:27,405 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-11 18:15:27,406 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-11 18:15:27,407 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-11 18:15:27,407 INFO L138 SettingsManager]: * Use SBE=true [2020-11-11 18:15:27,407 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-11 18:15:27,407 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-11 18:15:27,408 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-11 18:15:27,408 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-11 18:15:27,408 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-11 18:15:27,408 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-11 18:15:27,408 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-11 18:15:27,409 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-11 18:15:27,409 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-11 18:15:27,409 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-11 18:15:27,409 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-11 18:15:27,409 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-11 18:15:27,410 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-11 18:15:27,410 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-11 18:15:27,410 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-11 18:15:27,410 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-11 18:15:27,411 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-11 18:15:27,411 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-11 18:15:27,411 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-11 18:15:27,411 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-11 18:15:27,411 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-11 18:15:27,412 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-11 18:15:27,412 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-11-11 18:15:27,412 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-11 18:15:27,412 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-11 18:15:27,782 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-11 18:15:27,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-11 18:15:27,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-11 18:15:27,810 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-11 18:15:27,810 INFO L275 PluginConnector]: CDTParser initialized [2020-11-11 18:15:27,811 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_pso.oepc.i [2020-11-11 18:15:27,906 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65f7c8815/0a4ad102a8d14278b2aeb8929ebb75d5/FLAGacdf04ff4 [2020-11-11 18:15:28,653 INFO L306 CDTParser]: Found 1 translation units. [2020-11-11 18:15:28,654 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_pso.oepc.i [2020-11-11 18:15:28,675 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65f7c8815/0a4ad102a8d14278b2aeb8929ebb75d5/FLAGacdf04ff4 [2020-11-11 18:15:28,690 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65f7c8815/0a4ad102a8d14278b2aeb8929ebb75d5 [2020-11-11 18:15:28,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-11 18:15:28,700 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-11 18:15:28,701 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-11 18:15:28,701 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-11 18:15:28,713 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-11 18:15:28,714 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 06:15:28" (1/1) ... [2020-11-11 18:15:28,718 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50082dd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:15:28, skipping insertion in model container [2020-11-11 18:15:28,718 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 06:15:28" (1/1) ... [2020-11-11 18:15:28,728 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-11 18:15:28,794 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-11 18:15:29,214 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-11 18:15:29,230 INFO L203 MainTranslator]: Completed pre-run [2020-11-11 18:15:29,336 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-11 18:15:29,443 INFO L208 MainTranslator]: Completed translation [2020-11-11 18:15:29,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:15:29 WrapperNode [2020-11-11 18:15:29,444 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-11 18:15:29,446 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-11 18:15:29,449 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-11 18:15:29,450 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-11 18:15:29,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:15:29" (1/1) ... [2020-11-11 18:15:29,504 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:15:29" (1/1) ... [2020-11-11 18:15:29,548 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-11 18:15:29,549 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-11 18:15:29,549 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-11 18:15:29,550 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-11 18:15:29,560 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:15:29" (1/1) ... [2020-11-11 18:15:29,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:15:29" (1/1) ... [2020-11-11 18:15:29,565 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:15:29" (1/1) ... [2020-11-11 18:15:29,565 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:15:29" (1/1) ... [2020-11-11 18:15:29,577 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:15:29" (1/1) ... [2020-11-11 18:15:29,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:15:29" (1/1) ... [2020-11-11 18:15:29,595 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:15:29" (1/1) ... [2020-11-11 18:15:29,600 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-11 18:15:29,604 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-11 18:15:29,604 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-11 18:15:29,604 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-11 18:15:29,605 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:15:29" (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 [2020-11-11 18:15:29,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-11 18:15:29,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-11 18:15:29,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-11 18:15:29,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-11 18:15:29,690 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-11 18:15:29,690 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-11 18:15:29,690 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-11 18:15:29,690 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-11 18:15:29,690 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-11 18:15:29,691 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-11 18:15:29,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-11 18:15:29,691 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-11 18:15:29,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-11 18:15:29,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-11 18:15:29,693 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-11 18:15:32,003 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-11 18:15:32,004 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-11 18:15:32,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 06:15:32 BoogieIcfgContainer [2020-11-11 18:15:32,006 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-11 18:15:32,007 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-11 18:15:32,007 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-11 18:15:32,011 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-11 18:15:32,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 06:15:28" (1/3) ... [2020-11-11 18:15:32,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ee4ed86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 06:15:32, skipping insertion in model container [2020-11-11 18:15:32,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:15:29" (2/3) ... [2020-11-11 18:15:32,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ee4ed86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 06:15:32, skipping insertion in model container [2020-11-11 18:15:32,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 06:15:32" (3/3) ... [2020-11-11 18:15:32,014 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_pso.oepc.i [2020-11-11 18:15:32,030 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-11 18:15:32,030 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-11 18:15:32,034 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-11 18:15:32,035 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-11 18:15:32,069 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,070 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,070 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,070 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,070 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,070 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,071 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,071 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,071 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,071 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,071 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,072 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,072 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,072 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,072 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,072 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,073 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,073 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,073 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,073 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,073 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,073 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,074 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,074 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,074 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,074 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,074 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,074 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,075 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,075 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,075 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,075 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,076 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,076 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,076 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,076 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,077 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,077 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,077 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,077 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,077 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,077 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,078 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,078 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,078 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,079 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,079 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,079 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,079 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,079 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,080 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,080 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,080 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,080 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,080 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,080 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,081 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,081 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,081 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,081 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,081 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,082 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,082 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,082 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,082 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,082 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,083 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,083 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,083 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,083 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,084 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,084 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,084 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,084 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,084 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,085 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,085 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,085 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,085 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,085 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,085 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,088 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,088 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,088 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,088 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,092 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,092 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,092 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,092 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,092 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,093 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,093 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,093 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,093 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,093 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,094 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,094 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,098 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,098 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,102 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,103 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 18:15:32,107 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-11 18:15:32,120 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-11-11 18:15:32,142 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-11 18:15:32,143 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-11 18:15:32,143 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-11 18:15:32,143 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-11 18:15:32,143 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-11 18:15:32,143 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-11 18:15:32,143 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-11 18:15:32,143 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-11 18:15:32,155 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 107 places, 100 transitions, 215 flow [2020-11-11 18:15:33,579 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 17064 states, 17060 states have (on average 3.683235638921454) internal successors, (62836), 17063 states have internal predecessors, (62836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 18:15:33,626 INFO L276 IsEmpty]: Start isEmpty. Operand has 17064 states, 17060 states have (on average 3.683235638921454) internal successors, (62836), 17063 states have internal predecessors, (62836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 18:15:33,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-11-11 18:15:33,634 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 18:15:33,634 INFO L494 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] [2020-11-11 18:15:33,635 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 18:15:33,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 18:15:33,642 INFO L82 PathProgramCache]: Analyzing trace with hash 2087197560, now seen corresponding path program 1 times [2020-11-11 18:15:33,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 18:15:33,653 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877989746] [2020-11-11 18:15:33,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 18:15:33,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 18:15:34,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 18:15:34,031 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877989746] [2020-11-11 18:15:34,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 18:15:34,032 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-11 18:15:34,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718453248] [2020-11-11 18:15:34,038 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-11 18:15:34,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 18:15:34,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-11 18:15:34,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-11 18:15:34,085 INFO L87 Difference]: Start difference. First operand has 17064 states, 17060 states have (on average 3.683235638921454) internal successors, (62836), 17063 states have internal predecessors, (62836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 18:15:34,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 18:15:34,430 INFO L93 Difference]: Finished difference Result 14148 states and 50400 transitions. [2020-11-11 18:15:34,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-11 18:15:34,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2020-11-11 18:15:34,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 18:15:34,557 INFO L225 Difference]: With dead ends: 14148 [2020-11-11 18:15:34,557 INFO L226 Difference]: Without dead ends: 8516 [2020-11-11 18:15:34,559 INFO L749 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 [2020-11-11 18:15:34,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8516 states. [2020-11-11 18:15:35,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8516 to 8516. [2020-11-11 18:15:35,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8516 states, 8515 states have (on average 3.5213153258954786) internal successors, (29984), 8515 states have internal predecessors, (29984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 18:15:35,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8516 states to 8516 states and 29984 transitions. [2020-11-11 18:15:35,390 INFO L78 Accepts]: Start accepts. Automaton has 8516 states and 29984 transitions. Word has length 38 [2020-11-11 18:15:35,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 18:15:35,391 INFO L481 AbstractCegarLoop]: Abstraction has 8516 states and 29984 transitions. [2020-11-11 18:15:35,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 18:15:35,392 INFO L276 IsEmpty]: Start isEmpty. Operand 8516 states and 29984 transitions. [2020-11-11 18:15:35,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-11-11 18:15:35,419 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 18:15:35,420 INFO L494 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] [2020-11-11 18:15:35,420 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-11 18:15:35,420 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 18:15:35,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 18:15:35,422 INFO L82 PathProgramCache]: Analyzing trace with hash 586409991, now seen corresponding path program 1 times [2020-11-11 18:15:35,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 18:15:35,422 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025699327] [2020-11-11 18:15:35,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 18:15:35,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 18:15:35,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 18:15:35,744 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025699327] [2020-11-11 18:15:35,744 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 18:15:35,745 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-11 18:15:35,745 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931912268] [2020-11-11 18:15:35,747 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-11 18:15:35,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 18:15:35,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-11 18:15:35,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-11 18:15:35,749 INFO L87 Difference]: Start difference. First operand 8516 states and 29984 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 18:15:35,990 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2020-11-11 18:15:36,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 18:15:36,114 INFO L93 Difference]: Finished difference Result 10180 states and 35456 transitions. [2020-11-11 18:15:36,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-11 18:15:36,114 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2020-11-11 18:15:36,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 18:15:36,200 INFO L225 Difference]: With dead ends: 10180 [2020-11-11 18:15:36,200 INFO L226 Difference]: Without dead ends: 8132 [2020-11-11 18:15:36,203 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-11-11 18:15:36,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8132 states. [2020-11-11 18:15:36,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8132 to 8132. [2020-11-11 18:15:36,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8132 states, 8131 states have (on average 3.5046119788463903) internal successors, (28496), 8131 states have internal predecessors, (28496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 18:15:36,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8132 states to 8132 states and 28496 transitions. [2020-11-11 18:15:36,647 INFO L78 Accepts]: Start accepts. Automaton has 8132 states and 28496 transitions. Word has length 59 [2020-11-11 18:15:36,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 18:15:36,649 INFO L481 AbstractCegarLoop]: Abstraction has 8132 states and 28496 transitions. [2020-11-11 18:15:36,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 18:15:36,649 INFO L276 IsEmpty]: Start isEmpty. Operand 8132 states and 28496 transitions. [2020-11-11 18:15:36,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-11 18:15:36,670 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 18:15:36,671 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 18:15:36,671 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-11 18:15:36,671 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 18:15:36,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 18:15:36,674 INFO L82 PathProgramCache]: Analyzing trace with hash -646929240, now seen corresponding path program 1 times [2020-11-11 18:15:36,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 18:15:36,678 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471379166] [2020-11-11 18:15:36,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 18:15:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 18:15:36,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 18:15:37,000 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471379166] [2020-11-11 18:15:37,000 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 18:15:37,000 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-11 18:15:37,000 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914677231] [2020-11-11 18:15:37,003 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-11 18:15:37,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 18:15:37,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-11 18:15:37,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-11 18:15:37,004 INFO L87 Difference]: Start difference. First operand 8132 states and 28496 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 18:15:37,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 18:15:37,263 INFO L93 Difference]: Finished difference Result 9380 states and 32548 transitions. [2020-11-11 18:15:37,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-11 18:15:37,263 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2020-11-11 18:15:37,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 18:15:37,301 INFO L225 Difference]: With dead ends: 9380 [2020-11-11 18:15:37,301 INFO L226 Difference]: Without dead ends: 7844 [2020-11-11 18:15:37,303 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-11-11 18:15:37,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7844 states. [2020-11-11 18:15:37,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7844 to 7844. [2020-11-11 18:15:37,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7844 states, 7843 states have (on average 3.492541119469591) internal successors, (27392), 7843 states have internal predecessors, (27392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 18:15:37,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7844 states to 7844 states and 27392 transitions. [2020-11-11 18:15:37,740 INFO L78 Accepts]: Start accepts. Automaton has 7844 states and 27392 transitions. Word has length 61 [2020-11-11 18:15:37,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 18:15:37,742 INFO L481 AbstractCegarLoop]: Abstraction has 7844 states and 27392 transitions. [2020-11-11 18:15:37,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 18:15:37,743 INFO L276 IsEmpty]: Start isEmpty. Operand 7844 states and 27392 transitions. [2020-11-11 18:15:37,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-11-11 18:15:37,760 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 18:15:37,761 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 18:15:37,761 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-11 18:15:37,761 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 18:15:37,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 18:15:37,762 INFO L82 PathProgramCache]: Analyzing trace with hash -268692198, now seen corresponding path program 1 times [2020-11-11 18:15:37,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 18:15:37,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228083263] [2020-11-11 18:15:37,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 18:15:37,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 18:15:38,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 18:15:38,286 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228083263] [2020-11-11 18:15:38,286 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 18:15:38,286 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-11 18:15:38,287 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586981096] [2020-11-11 18:15:38,287 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-11 18:15:38,287 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 18:15:38,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-11 18:15:38,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-11-11 18:15:38,290 INFO L87 Difference]: Start difference. First operand 7844 states and 27392 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 18:15:38,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 18:15:38,843 INFO L93 Difference]: Finished difference Result 9540 states and 32982 transitions. [2020-11-11 18:15:38,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-11 18:15:38,844 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2020-11-11 18:15:38,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 18:15:38,878 INFO L225 Difference]: With dead ends: 9540 [2020-11-11 18:15:38,878 INFO L226 Difference]: Without dead ends: 7732 [2020-11-11 18:15:38,879 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2020-11-11 18:15:38,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7732 states. [2020-11-11 18:15:39,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7732 to 7732. [2020-11-11 18:15:39,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7732 states, 7731 states have (on average 3.4769111369809855) internal successors, (26880), 7731 states have internal predecessors, (26880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 18:15:39,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7732 states to 7732 states and 26880 transitions. [2020-11-11 18:15:39,238 INFO L78 Accepts]: Start accepts. Automaton has 7732 states and 26880 transitions. Word has length 62 [2020-11-11 18:15:39,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 18:15:39,240 INFO L481 AbstractCegarLoop]: Abstraction has 7732 states and 26880 transitions. [2020-11-11 18:15:39,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 18:15:39,240 INFO L276 IsEmpty]: Start isEmpty. Operand 7732 states and 26880 transitions. [2020-11-11 18:15:39,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-11-11 18:15:39,259 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 18:15:39,260 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 18:15:39,260 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-11 18:15:39,260 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 18:15:39,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 18:15:39,261 INFO L82 PathProgramCache]: Analyzing trace with hash -59276550, now seen corresponding path program 1 times [2020-11-11 18:15:39,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 18:15:39,261 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934858496] [2020-11-11 18:15:39,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 18:15:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 18:15:39,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 18:15:39,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934858496] [2020-11-11 18:15:39,625 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 18:15:39,625 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-11 18:15:39,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606178727] [2020-11-11 18:15:39,627 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-11 18:15:39,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 18:15:39,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-11 18:15:39,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-11-11 18:15:39,628 INFO L87 Difference]: Start difference. First operand 7732 states and 26880 transitions. Second operand has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 18:15:40,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 18:15:40,317 INFO L93 Difference]: Finished difference Result 8756 states and 30236 transitions. [2020-11-11 18:15:40,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-11 18:15:40,318 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2020-11-11 18:15:40,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 18:15:40,356 INFO L225 Difference]: With dead ends: 8756 [2020-11-11 18:15:40,356 INFO L226 Difference]: Without dead ends: 7764 [2020-11-11 18:15:40,357 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2020-11-11 18:15:40,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7764 states. [2020-11-11 18:15:40,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7764 to 7764. [2020-11-11 18:15:40,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7764 states, 7763 states have (on average 3.4759757825582893) internal successors, (26984), 7763 states have internal predecessors, (26984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 18:15:40,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7764 states to 7764 states and 26984 transitions. [2020-11-11 18:15:40,612 INFO L78 Accepts]: Start accepts. Automaton has 7764 states and 26984 transitions. Word has length 64 [2020-11-11 18:15:40,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 18:15:40,614 INFO L481 AbstractCegarLoop]: Abstraction has 7764 states and 26984 transitions. [2020-11-11 18:15:40,614 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 18:15:40,614 INFO L276 IsEmpty]: Start isEmpty. Operand 7764 states and 26984 transitions. [2020-11-11 18:15:40,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-11 18:15:40,632 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 18:15:40,633 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 18:15:40,633 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-11 18:15:40,633 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 18:15:40,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 18:15:40,634 INFO L82 PathProgramCache]: Analyzing trace with hash 415601096, now seen corresponding path program 1 times [2020-11-11 18:15:40,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 18:15:40,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599660729] [2020-11-11 18:15:40,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 18:15:40,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 18:15:40,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 18:15:40,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599660729] [2020-11-11 18:15:40,904 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 18:15:40,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-11 18:15:40,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731889034] [2020-11-11 18:15:40,904 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-11 18:15:40,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 18:15:40,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-11 18:15:40,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-11 18:15:40,907 INFO L87 Difference]: Start difference. First operand 7764 states and 26984 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 18:15:41,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 18:15:41,165 INFO L93 Difference]: Finished difference Result 12852 states and 43952 transitions. [2020-11-11 18:15:41,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-11 18:15:41,166 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2020-11-11 18:15:41,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 18:15:41,205 INFO L225 Difference]: With dead ends: 12852 [2020-11-11 18:15:41,206 INFO L226 Difference]: Without dead ends: 8868 [2020-11-11 18:15:41,207 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-11-11 18:15:41,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8868 states. [2020-11-11 18:15:41,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8868 to 7188. [2020-11-11 18:15:41,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7188 states, 7187 states have (on average 3.3939056630026436) internal successors, (24392), 7187 states have internal predecessors, (24392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 18:15:41,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7188 states to 7188 states and 24392 transitions. [2020-11-11 18:15:41,510 INFO L78 Accepts]: Start accepts. Automaton has 7188 states and 24392 transitions. Word has length 65 [2020-11-11 18:15:41,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 18:15:41,511 INFO L481 AbstractCegarLoop]: Abstraction has 7188 states and 24392 transitions. [2020-11-11 18:15:41,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 18:15:41,511 INFO L276 IsEmpty]: Start isEmpty. Operand 7188 states and 24392 transitions. [2020-11-11 18:15:41,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-11 18:15:41,527 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 18:15:41,527 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 18:15:41,528 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-11 18:15:41,528 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 18:15:41,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 18:15:41,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1010648391, now seen corresponding path program 1 times [2020-11-11 18:15:41,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 18:15:41,529 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154144830] [2020-11-11 18:15:41,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 18:15:41,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 18:15:41,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 18:15:41,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154144830] [2020-11-11 18:15:41,710 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 18:15:41,710 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-11 18:15:41,710 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125825772] [2020-11-11 18:15:41,711 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-11 18:15:41,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 18:15:41,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-11 18:15:41,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-11 18:15:41,713 INFO L87 Difference]: Start difference. First operand 7188 states and 24392 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 18:15:41,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 18:15:41,923 INFO L93 Difference]: Finished difference Result 12236 states and 41066 transitions. [2020-11-11 18:15:41,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-11 18:15:41,924 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2020-11-11 18:15:41,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 18:15:42,045 INFO L225 Difference]: With dead ends: 12236 [2020-11-11 18:15:42,046 INFO L226 Difference]: Without dead ends: 8420 [2020-11-11 18:15:42,046 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-11-11 18:15:42,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8420 states. [2020-11-11 18:15:42,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8420 to 6740. [2020-11-11 18:15:42,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6740 states, 6739 states have (on average 3.322748182222882) internal successors, (22392), 6739 states have internal predecessors, (22392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 18:15:42,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6740 states to 6740 states and 22392 transitions. [2020-11-11 18:15:42,268 INFO L78 Accepts]: Start accepts. Automaton has 6740 states and 22392 transitions. Word has length 65 [2020-11-11 18:15:42,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 18:15:42,268 INFO L481 AbstractCegarLoop]: Abstraction has 6740 states and 22392 transitions. [2020-11-11 18:15:42,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 18:15:42,268 INFO L276 IsEmpty]: Start isEmpty. Operand 6740 states and 22392 transitions. [2020-11-11 18:15:42,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-11 18:15:42,282 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 18:15:42,282 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 18:15:42,282 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-11 18:15:42,284 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 18:15:42,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 18:15:42,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1515910346, now seen corresponding path program 1 times [2020-11-11 18:15:42,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 18:15:42,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164803318] [2020-11-11 18:15:42,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 18:15:42,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 18:15:42,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 18:15:42,601 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164803318] [2020-11-11 18:15:42,601 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 18:15:42,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-11 18:15:42,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527318370] [2020-11-11 18:15:42,602 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-11 18:15:42,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 18:15:42,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-11 18:15:42,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-11-11 18:15:42,603 INFO L87 Difference]: Start difference. First operand 6740 states and 22392 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 18:15:43,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 18:15:43,109 INFO L93 Difference]: Finished difference Result 7188 states and 23728 transitions. [2020-11-11 18:15:43,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-11 18:15:43,110 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2020-11-11 18:15:43,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 18:15:43,131 INFO L225 Difference]: With dead ends: 7188 [2020-11-11 18:15:43,131 INFO L226 Difference]: Without dead ends: 6292 [2020-11-11 18:15:43,132 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2020-11-11 18:15:43,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6292 states. [2020-11-11 18:15:43,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6292 to 6228. [2020-11-11 18:15:43,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6228 states, 6227 states have (on average 3.2991809860285852) internal successors, (20544), 6227 states have internal predecessors, (20544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 18:15:43,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6228 states to 6228 states and 20544 transitions. [2020-11-11 18:15:43,420 INFO L78 Accepts]: Start accepts. Automaton has 6228 states and 20544 transitions. Word has length 65 [2020-11-11 18:15:43,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 18:15:43,421 INFO L481 AbstractCegarLoop]: Abstraction has 6228 states and 20544 transitions. [2020-11-11 18:15:43,421 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 18:15:43,421 INFO L276 IsEmpty]: Start isEmpty. Operand 6228 states and 20544 transitions. [2020-11-11 18:15:43,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-11-11 18:15:43,438 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 18:15:43,438 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 18:15:43,438 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-11 18:15:43,438 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 18:15:43,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 18:15:43,439 INFO L82 PathProgramCache]: Analyzing trace with hash -940646020, now seen corresponding path program 1 times [2020-11-11 18:15:43,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 18:15:43,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017886347] [2020-11-11 18:15:43,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 18:15:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 18:15:43,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 18:15:43,785 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017886347] [2020-11-11 18:15:43,785 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 18:15:43,785 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-11 18:15:43,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574524595] [2020-11-11 18:15:43,786 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-11 18:15:43,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 18:15:43,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-11 18:15:43,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-11-11 18:15:43,787 INFO L87 Difference]: Start difference. First operand 6228 states and 20544 transitions. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 18:15:44,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 18:15:44,314 INFO L93 Difference]: Finished difference Result 8164 states and 26816 transitions. [2020-11-11 18:15:44,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-11 18:15:44,314 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2020-11-11 18:15:44,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 18:15:44,333 INFO L225 Difference]: With dead ends: 8164 [2020-11-11 18:15:44,333 INFO L226 Difference]: Without dead ends: 6644 [2020-11-11 18:15:44,334 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2020-11-11 18:15:44,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6644 states. [2020-11-11 18:15:44,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6644 to 6388. [2020-11-11 18:15:44,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6388 states, 6387 states have (on average 3.2628777203695005) internal successors, (20840), 6387 states have internal predecessors, (20840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 18:15:44,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6388 states to 6388 states and 20840 transitions. [2020-11-11 18:15:44,520 INFO L78 Accepts]: Start accepts. Automaton has 6388 states and 20840 transitions. Word has length 66 [2020-11-11 18:15:44,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 18:15:44,521 INFO L481 AbstractCegarLoop]: Abstraction has 6388 states and 20840 transitions. [2020-11-11 18:15:44,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 18:15:44,521 INFO L276 IsEmpty]: Start isEmpty. Operand 6388 states and 20840 transitions. [2020-11-11 18:15:44,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-11-11 18:15:44,535 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 18:15:44,535 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 18:15:44,535 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-11 18:15:44,535 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 18:15:44,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 18:15:44,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1484916326, now seen corresponding path program 1 times [2020-11-11 18:15:44,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 18:15:44,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912841334] [2020-11-11 18:15:44,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 18:15:44,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 18:15:44,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 18:15:44,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912841334] [2020-11-11 18:15:44,731 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 18:15:44,731 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-11 18:15:44,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406353769] [2020-11-11 18:15:44,732 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-11 18:15:44,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 18:15:44,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-11 18:15:44,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-11 18:15:44,733 INFO L87 Difference]: Start difference. First operand 6388 states and 20840 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 18:15:44,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 18:15:44,917 INFO L93 Difference]: Finished difference Result 7606 states and 24193 transitions. [2020-11-11 18:15:44,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-11 18:15:44,918 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2020-11-11 18:15:44,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 18:15:44,931 INFO L225 Difference]: With dead ends: 7606 [2020-11-11 18:15:44,931 INFO L226 Difference]: Without dead ends: 5414 [2020-11-11 18:15:44,932 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-11-11 18:15:44,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5414 states. [2020-11-11 18:15:45,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5414 to 5414. [2020-11-11 18:15:45,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5414 states, 5413 states have (on average 3.1790134860520967) internal successors, (17208), 5413 states have internal predecessors, (17208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 18:15:45,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5414 states to 5414 states and 17208 transitions. [2020-11-11 18:15:45,089 INFO L78 Accepts]: Start accepts. Automaton has 5414 states and 17208 transitions. Word has length 67 [2020-11-11 18:15:45,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 18:15:45,089 INFO L481 AbstractCegarLoop]: Abstraction has 5414 states and 17208 transitions. [2020-11-11 18:15:45,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 18:15:45,090 INFO L276 IsEmpty]: Start isEmpty. Operand 5414 states and 17208 transitions. [2020-11-11 18:15:45,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-11-11 18:15:45,101 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 18:15:45,101 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 18:15:45,101 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-11 18:15:45,102 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 18:15:45,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 18:15:45,102 INFO L82 PathProgramCache]: Analyzing trace with hash 2147413213, now seen corresponding path program 1 times [2020-11-11 18:15:45,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 18:15:45,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045379072] [2020-11-11 18:15:45,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 18:15:45,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 18:15:45,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 18:15:45,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045379072] [2020-11-11 18:15:45,254 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 18:15:45,254 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-11 18:15:45,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38189925] [2020-11-11 18:15:45,255 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-11 18:15:45,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 18:15:45,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-11 18:15:45,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-11 18:15:45,257 INFO L87 Difference]: Start difference. First operand 5414 states and 17208 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 18:15:45,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 18:15:45,454 INFO L93 Difference]: Finished difference Result 4862 states and 14887 transitions. [2020-11-11 18:15:45,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-11 18:15:45,455 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2020-11-11 18:15:45,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 18:15:45,462 INFO L225 Difference]: With dead ends: 4862 [2020-11-11 18:15:45,462 INFO L226 Difference]: Without dead ends: 3198 [2020-11-11 18:15:45,463 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2020-11-11 18:15:45,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3198 states. [2020-11-11 18:15:45,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3198 to 3062. [2020-11-11 18:15:45,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3062 states, 3061 states have (on average 3.021234890558641) internal successors, (9248), 3061 states have internal predecessors, (9248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 18:15:45,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3062 states to 3062 states and 9248 transitions. [2020-11-11 18:15:45,539 INFO L78 Accepts]: Start accepts. Automaton has 3062 states and 9248 transitions. Word has length 68 [2020-11-11 18:15:45,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 18:15:45,540 INFO L481 AbstractCegarLoop]: Abstraction has 3062 states and 9248 transitions. [2020-11-11 18:15:45,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 18:15:45,540 INFO L276 IsEmpty]: Start isEmpty. Operand 3062 states and 9248 transitions. [2020-11-11 18:15:45,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-11-11 18:15:45,547 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 18:15:45,547 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 18:15:45,547 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-11 18:15:45,547 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 18:15:45,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 18:15:45,548 INFO L82 PathProgramCache]: Analyzing trace with hash 641840074, now seen corresponding path program 1 times [2020-11-11 18:15:45,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 18:15:45,548 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021351169] [2020-11-11 18:15:45,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 18:15:45,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 18:15:45,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 18:15:45,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021351169] [2020-11-11 18:15:45,704 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 18:15:45,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-11 18:15:45,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061779014] [2020-11-11 18:15:45,704 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-11 18:15:45,705 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 18:15:45,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-11 18:15:45,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-11 18:15:45,705 INFO L87 Difference]: Start difference. First operand 3062 states and 9248 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 18:15:45,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 18:15:45,911 INFO L93 Difference]: Finished difference Result 2270 states and 6581 transitions. [2020-11-11 18:15:45,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-11 18:15:45,912 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2020-11-11 18:15:45,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 18:15:45,915 INFO L225 Difference]: With dead ends: 2270 [2020-11-11 18:15:45,915 INFO L226 Difference]: Without dead ends: 1146 [2020-11-11 18:15:45,915 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2020-11-11 18:15:45,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2020-11-11 18:15:45,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1114. [2020-11-11 18:15:45,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1114 states, 1113 states have (on average 2.8176100628930816) internal successors, (3136), 1113 states have internal predecessors, (3136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 18:15:45,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 3136 transitions. [2020-11-11 18:15:45,939 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 3136 transitions. Word has length 71 [2020-11-11 18:15:45,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 18:15:45,939 INFO L481 AbstractCegarLoop]: Abstraction has 1114 states and 3136 transitions. [2020-11-11 18:15:45,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 18:15:45,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 3136 transitions. [2020-11-11 18:15:45,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-11-11 18:15:45,942 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 18:15:45,942 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 18:15:45,942 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-11 18:15:45,942 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 18:15:45,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 18:15:45,943 INFO L82 PathProgramCache]: Analyzing trace with hash 594878684, now seen corresponding path program 1 times [2020-11-11 18:15:45,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 18:15:45,943 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171852713] [2020-11-11 18:15:45,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 18:15:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-11 18:15:45,996 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-11 18:15:46,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-11 18:15:46,054 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-11 18:15:46,103 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-11 18:15:46,104 INFO L595 BasicCegarLoop]: Counterexample might be feasible [2020-11-11 18:15:46,104 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-11 18:15:46,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 06:15:46 BasicIcfg [2020-11-11 18:15:46,312 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-11 18:15:46,313 INFO L168 Benchmark]: Toolchain (without parser) took 17618.66 ms. Allocated memory was 302.0 MB in the beginning and 5.4 GB in the end (delta: 5.1 GB). Free memory was 276.4 MB in the beginning and 4.7 GB in the end (delta: -4.4 GB). Peak memory consumption was 675.2 MB. Max. memory is 16.0 GB. [2020-11-11 18:15:46,314 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 302.0 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 16.0 GB. [2020-11-11 18:15:46,315 INFO L168 Benchmark]: CACSL2BoogieTranslator took 743.15 ms. Allocated memory is still 302.0 MB. Free memory was 275.8 MB in the beginning and 272.2 MB in the end (delta: 3.6 MB). Peak memory consumption was 30.8 MB. Max. memory is 16.0 GB. [2020-11-11 18:15:46,316 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.51 ms. Allocated memory is still 302.0 MB. Free memory was 272.2 MB in the beginning and 270.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2020-11-11 18:15:46,317 INFO L168 Benchmark]: Boogie Preprocessor took 53.70 ms. Allocated memory is still 302.0 MB. Free memory was 270.1 MB in the beginning and 266.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2020-11-11 18:15:46,318 INFO L168 Benchmark]: RCFGBuilder took 2402.20 ms. Allocated memory is still 302.0 MB. Free memory was 266.9 MB in the beginning and 206.6 MB in the end (delta: 60.3 MB). Peak memory consumption was 161.5 MB. Max. memory is 16.0 GB. [2020-11-11 18:15:46,322 INFO L168 Benchmark]: TraceAbstraction took 14304.31 ms. Allocated memory was 302.0 MB in the beginning and 5.4 GB in the end (delta: 5.1 GB). Free memory was 206.6 MB in the beginning and 4.7 GB in the end (delta: -4.5 GB). Peak memory consumption was 603.0 MB. Max. memory is 16.0 GB. [2020-11-11 18:15:46,327 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 302.0 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 743.15 ms. Allocated memory is still 302.0 MB. Free memory was 275.8 MB in the beginning and 272.2 MB in the end (delta: 3.6 MB). Peak memory consumption was 30.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 102.51 ms. Allocated memory is still 302.0 MB. Free memory was 272.2 MB in the beginning and 270.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 53.70 ms. Allocated memory is still 302.0 MB. Free memory was 270.1 MB in the beginning and 266.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2402.20 ms. Allocated memory is still 302.0 MB. Free memory was 266.9 MB in the beginning and 206.6 MB in the end (delta: 60.3 MB). Peak memory consumption was 161.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 14304.31 ms. Allocated memory was 302.0 MB in the beginning and 5.4 GB in the end (delta: 5.1 GB). Free memory was 206.6 MB in the beginning and 4.7 GB in the end (delta: -4.5 GB). Peak memory consumption was 603.0 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L711] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L713] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L715] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L717] 0 int z = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L718] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L719] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L720] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L721] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L722] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L723] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L724] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L725] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L726] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L727] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L728] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L729] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L730] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L731] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L732] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L733] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L816] 0 pthread_t t2495; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] FCALL, FORK 0 pthread_create(&t2495, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L739] 1 z$w_buff1 = z$w_buff0 [L740] 1 z$w_buff0 = 2 [L741] 1 z$w_buff1_used = z$w_buff0_used [L742] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 pthread_t t2496; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] FCALL, FORK 0 pthread_create(&t2496, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L774] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L775] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L775] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L776] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L777] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L778] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2497; VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] FCALL, FORK 0 pthread_create(&t2497, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] 3 y = 2 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z = 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L794] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L794] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L795] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L795] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L796] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L797] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L798] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L827] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L827] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L827] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L828] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L828] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L829] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L830] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L831] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 z$flush_delayed = weak$$choice2 [L837] 0 z$mem_tmp = z [L838] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L838] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L839] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L839] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L839] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L839] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L840] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L840] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L840] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L840] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L841] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L841] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L841] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L841] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L842] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L842] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L843] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L843] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L843] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L844] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L844] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L846] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L846] 0 z = z$flush_delayed ? z$mem_tmp : z [L847] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L17] 0 __assert_fail ("0", "safe030_pso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 98 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.9s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.4s, HoareTripleCheckerStatistics: 1534 SDtfs, 2152 SDslu, 5364 SDs, 0 SdLazy, 818 SolverSat, 180 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 164 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17064occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 3848 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 825 NumberOfCodeBlocks, 825 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 739 ConstructedInterpolants, 0 QuantifiedInterpolants, 210146 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...