/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi007_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 22:08:37,022 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 22:08:37,025 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 22:08:37,037 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 22:08:37,037 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 22:08:37,038 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 22:08:37,040 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 22:08:37,042 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 22:08:37,044 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 22:08:37,044 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 22:08:37,045 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 22:08:37,046 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 22:08:37,047 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 22:08:37,048 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 22:08:37,049 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 22:08:37,050 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 22:08:37,051 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 22:08:37,051 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 22:08:37,053 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 22:08:37,056 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 22:08:37,059 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 22:08:37,061 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 22:08:37,063 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 22:08:37,065 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 22:08:37,070 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 22:08:37,070 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 22:08:37,070 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 22:08:37,071 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 22:08:37,071 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 22:08:37,073 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 22:08:37,074 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 22:08:37,074 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 22:08:37,077 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 22:08:37,078 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 22:08:37,081 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 22:08:37,081 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 22:08:37,082 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 22:08:37,082 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 22:08:37,083 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 22:08:37,086 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 22:08:37,087 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 22:08:37,088 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 22:08:37,112 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 22:08:37,112 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 22:08:37,116 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 22:08:37,117 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 22:08:37,117 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 22:08:37,117 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 22:08:37,118 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 22:08:37,118 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 22:08:37,118 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 22:08:37,118 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 22:08:37,119 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 22:08:37,119 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 22:08:37,120 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 22:08:37,120 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 22:08:37,120 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 22:08:37,121 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 22:08:37,121 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 22:08:37,121 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 22:08:37,121 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 22:08:37,123 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 22:08:37,124 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 22:08:37,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:08:37,126 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 22:08:37,126 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 22:08:37,126 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 22:08:37,127 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 22:08:37,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 22:08:37,128 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 22:08:37,128 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 22:08:37,128 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 22:08:37,436 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 22:08:37,449 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 22:08:37,454 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 22:08:37,455 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 22:08:37,456 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 22:08:37,457 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi007_tso.opt.i [2019-12-18 22:08:37,524 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c23b5a18e/c8ca754188404ad89f6757d4aca25cf5/FLAG51844234a [2019-12-18 22:08:38,090 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 22:08:38,091 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi007_tso.opt.i [2019-12-18 22:08:38,112 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c23b5a18e/c8ca754188404ad89f6757d4aca25cf5/FLAG51844234a [2019-12-18 22:08:38,386 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c23b5a18e/c8ca754188404ad89f6757d4aca25cf5 [2019-12-18 22:08:38,395 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 22:08:38,397 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 22:08:38,398 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 22:08:38,398 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 22:08:38,404 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 22:08:38,405 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:08:38" (1/1) ... [2019-12-18 22:08:38,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b4cd91b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:38, skipping insertion in model container [2019-12-18 22:08:38,408 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:08:38" (1/1) ... [2019-12-18 22:08:38,417 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 22:08:38,466 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 22:08:39,047 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:08:39,064 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 22:08:39,144 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:08:39,221 INFO L208 MainTranslator]: Completed translation [2019-12-18 22:08:39,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:39 WrapperNode [2019-12-18 22:08:39,221 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 22:08:39,222 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 22:08:39,222 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 22:08:39,223 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 22:08:39,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:39" (1/1) ... [2019-12-18 22:08:39,254 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:39" (1/1) ... [2019-12-18 22:08:39,298 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 22:08:39,299 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 22:08:39,299 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 22:08:39,299 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 22:08:39,308 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:39" (1/1) ... [2019-12-18 22:08:39,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:39" (1/1) ... [2019-12-18 22:08:39,313 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:39" (1/1) ... [2019-12-18 22:08:39,314 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:39" (1/1) ... [2019-12-18 22:08:39,325 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:39" (1/1) ... [2019-12-18 22:08:39,330 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:39" (1/1) ... [2019-12-18 22:08:39,334 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:39" (1/1) ... [2019-12-18 22:08:39,340 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 22:08:39,341 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 22:08:39,341 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 22:08:39,341 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 22:08:39,342 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:08:39,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 22:08:39,454 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 22:08:39,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 22:08:39,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 22:08:39,455 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 22:08:39,455 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 22:08:39,456 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 22:08:39,457 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 22:08:39,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 22:08:39,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 22:08:39,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 22:08:39,462 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 22:08:40,473 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 22:08:40,474 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 22:08:40,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:08:40 BoogieIcfgContainer [2019-12-18 22:08:40,475 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 22:08:40,476 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 22:08:40,477 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 22:08:40,480 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 22:08:40,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:08:38" (1/3) ... [2019-12-18 22:08:40,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ee19c4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:08:40, skipping insertion in model container [2019-12-18 22:08:40,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:08:39" (2/3) ... [2019-12-18 22:08:40,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ee19c4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:08:40, skipping insertion in model container [2019-12-18 22:08:40,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:08:40" (3/3) ... [2019-12-18 22:08:40,484 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi007_tso.opt.i [2019-12-18 22:08:40,511 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 22:08:40,511 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 22:08:40,519 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 22:08:40,520 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 22:08:40,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,557 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,557 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,566 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,566 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,566 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,567 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,567 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,596 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,596 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,602 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,603 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,606 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:08:40,624 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 22:08:40,645 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 22:08:40,646 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 22:08:40,646 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 22:08:40,646 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 22:08:40,646 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 22:08:40,646 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 22:08:40,647 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 22:08:40,647 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 22:08:40,670 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 189 places, 244 transitions [2019-12-18 22:08:40,672 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 189 places, 244 transitions [2019-12-18 22:08:40,773 INFO L126 PetriNetUnfolder]: 62/242 cut-off events. [2019-12-18 22:08:40,774 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:08:40,797 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 242 events. 62/242 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 512 event pairs. 6/184 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-18 22:08:40,831 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 189 places, 244 transitions [2019-12-18 22:08:40,888 INFO L126 PetriNetUnfolder]: 62/242 cut-off events. [2019-12-18 22:08:40,888 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:08:40,898 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 242 events. 62/242 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 512 event pairs. 6/184 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-18 22:08:40,926 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 25246 [2019-12-18 22:08:40,927 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 22:08:44,367 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-18 22:08:44,483 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 22:08:44,537 INFO L206 etLargeBlockEncoding]: Checked pairs total: 146475 [2019-12-18 22:08:44,537 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-18 22:08:44,541 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 114 places, 139 transitions [2019-12-18 22:08:46,111 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 28693 states. [2019-12-18 22:08:46,113 INFO L276 IsEmpty]: Start isEmpty. Operand 28693 states. [2019-12-18 22:08:46,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 22:08:46,119 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:08:46,120 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 22:08:46,120 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:08:46,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:08:46,126 INFO L82 PathProgramCache]: Analyzing trace with hash 975635512, now seen corresponding path program 1 times [2019-12-18 22:08:46,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:08:46,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960102506] [2019-12-18 22:08:46,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:08:46,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:08:46,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:08:46,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960102506] [2019-12-18 22:08:46,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:08:46,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:08:46,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847685814] [2019-12-18 22:08:46,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:08:46,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:08:46,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:08:46,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:08:46,371 INFO L87 Difference]: Start difference. First operand 28693 states. Second operand 3 states. [2019-12-18 22:08:47,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:08:47,092 INFO L93 Difference]: Finished difference Result 28603 states and 100987 transitions. [2019-12-18 22:08:47,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:08:47,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 22:08:47,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:08:47,318 INFO L225 Difference]: With dead ends: 28603 [2019-12-18 22:08:47,319 INFO L226 Difference]: Without dead ends: 28044 [2019-12-18 22:08:47,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:08:48,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28044 states. [2019-12-18 22:08:49,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28044 to 28044. [2019-12-18 22:08:49,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28044 states. [2019-12-18 22:08:49,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28044 states to 28044 states and 99141 transitions. [2019-12-18 22:08:49,732 INFO L78 Accepts]: Start accepts. Automaton has 28044 states and 99141 transitions. Word has length 5 [2019-12-18 22:08:49,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:08:49,732 INFO L462 AbstractCegarLoop]: Abstraction has 28044 states and 99141 transitions. [2019-12-18 22:08:49,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:08:49,733 INFO L276 IsEmpty]: Start isEmpty. Operand 28044 states and 99141 transitions. [2019-12-18 22:08:49,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 22:08:49,735 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:08:49,735 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:08:49,736 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:08:49,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:08:49,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1770062859, now seen corresponding path program 1 times [2019-12-18 22:08:49,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:08:49,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685817471] [2019-12-18 22:08:49,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:08:49,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:08:49,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:08:49,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685817471] [2019-12-18 22:08:49,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:08:49,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:08:49,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121474755] [2019-12-18 22:08:49,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:08:49,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:08:49,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:08:49,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:08:49,823 INFO L87 Difference]: Start difference. First operand 28044 states and 99141 transitions. Second operand 4 states. [2019-12-18 22:08:50,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:08:50,431 INFO L93 Difference]: Finished difference Result 45067 states and 151887 transitions. [2019-12-18 22:08:50,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:08:50,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 22:08:50,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:08:50,614 INFO L225 Difference]: With dead ends: 45067 [2019-12-18 22:08:50,614 INFO L226 Difference]: Without dead ends: 45060 [2019-12-18 22:08:50,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:08:52,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45060 states. [2019-12-18 22:08:53,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45060 to 43678. [2019-12-18 22:08:53,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43678 states. [2019-12-18 22:08:53,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43678 states to 43678 states and 148274 transitions. [2019-12-18 22:08:53,347 INFO L78 Accepts]: Start accepts. Automaton has 43678 states and 148274 transitions. Word has length 11 [2019-12-18 22:08:53,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:08:53,347 INFO L462 AbstractCegarLoop]: Abstraction has 43678 states and 148274 transitions. [2019-12-18 22:08:53,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:08:53,347 INFO L276 IsEmpty]: Start isEmpty. Operand 43678 states and 148274 transitions. [2019-12-18 22:08:53,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 22:08:53,350 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:08:53,350 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:08:53,350 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:08:53,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:08:53,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1314739975, now seen corresponding path program 1 times [2019-12-18 22:08:53,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:08:53,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802722880] [2019-12-18 22:08:53,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:08:53,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:08:53,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:08:53,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802722880] [2019-12-18 22:08:53,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:08:53,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:08:53,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90797574] [2019-12-18 22:08:53,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:08:53,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:08:53,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:08:53,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:08:53,457 INFO L87 Difference]: Start difference. First operand 43678 states and 148274 transitions. Second operand 4 states. [2019-12-18 22:08:54,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:08:54,262 INFO L93 Difference]: Finished difference Result 54479 states and 183229 transitions. [2019-12-18 22:08:54,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:08:54,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 22:08:54,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:08:54,438 INFO L225 Difference]: With dead ends: 54479 [2019-12-18 22:08:54,439 INFO L226 Difference]: Without dead ends: 54479 [2019-12-18 22:08:54,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:08:55,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54479 states. [2019-12-18 22:08:56,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54479 to 49001. [2019-12-18 22:08:56,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49001 states. [2019-12-18 22:08:56,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49001 states to 49001 states and 166041 transitions. [2019-12-18 22:08:56,522 INFO L78 Accepts]: Start accepts. Automaton has 49001 states and 166041 transitions. Word has length 11 [2019-12-18 22:08:56,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:08:56,522 INFO L462 AbstractCegarLoop]: Abstraction has 49001 states and 166041 transitions. [2019-12-18 22:08:56,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:08:56,522 INFO L276 IsEmpty]: Start isEmpty. Operand 49001 states and 166041 transitions. [2019-12-18 22:08:56,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 22:08:56,529 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:08:56,529 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:08:56,529 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:08:56,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:08:56,530 INFO L82 PathProgramCache]: Analyzing trace with hash -23474940, now seen corresponding path program 1 times [2019-12-18 22:08:56,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:08:56,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66431593] [2019-12-18 22:08:56,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:08:56,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:08:56,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:08:56,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66431593] [2019-12-18 22:08:56,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:08:56,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:08:56,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724374906] [2019-12-18 22:08:56,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:08:56,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:08:56,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:08:56,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:08:56,687 INFO L87 Difference]: Start difference. First operand 49001 states and 166041 transitions. Second operand 5 states. [2019-12-18 22:08:58,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:08:58,920 INFO L93 Difference]: Finished difference Result 64731 states and 215221 transitions. [2019-12-18 22:08:58,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:08:58,920 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 22:08:58,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:08:59,071 INFO L225 Difference]: With dead ends: 64731 [2019-12-18 22:08:59,072 INFO L226 Difference]: Without dead ends: 64724 [2019-12-18 22:08:59,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:08:59,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64724 states. [2019-12-18 22:09:00,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64724 to 48844. [2019-12-18 22:09:00,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48844 states. [2019-12-18 22:09:00,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48844 states to 48844 states and 165414 transitions. [2019-12-18 22:09:00,663 INFO L78 Accepts]: Start accepts. Automaton has 48844 states and 165414 transitions. Word has length 17 [2019-12-18 22:09:00,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:09:00,663 INFO L462 AbstractCegarLoop]: Abstraction has 48844 states and 165414 transitions. [2019-12-18 22:09:00,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:09:00,664 INFO L276 IsEmpty]: Start isEmpty. Operand 48844 states and 165414 transitions. [2019-12-18 22:09:00,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 22:09:00,688 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:09:00,688 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:09:00,688 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:09:00,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:09:00,689 INFO L82 PathProgramCache]: Analyzing trace with hash 952945058, now seen corresponding path program 1 times [2019-12-18 22:09:00,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:09:00,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933636574] [2019-12-18 22:09:00,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:09:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:09:00,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:09:00,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933636574] [2019-12-18 22:09:00,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:09:00,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:09:00,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357465808] [2019-12-18 22:09:01,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:09:01,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:09:01,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:09:01,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:09:01,124 INFO L87 Difference]: Start difference. First operand 48844 states and 165414 transitions. Second operand 4 states. [2019-12-18 22:09:01,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:09:01,193 INFO L93 Difference]: Finished difference Result 5701 states and 14235 transitions. [2019-12-18 22:09:01,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:09:01,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 22:09:01,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:09:01,199 INFO L225 Difference]: With dead ends: 5701 [2019-12-18 22:09:01,199 INFO L226 Difference]: Without dead ends: 4806 [2019-12-18 22:09:01,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:09:01,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4806 states. [2019-12-18 22:09:01,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4806 to 4806. [2019-12-18 22:09:01,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4806 states. [2019-12-18 22:09:01,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4806 states to 4806 states and 11494 transitions. [2019-12-18 22:09:01,249 INFO L78 Accepts]: Start accepts. Automaton has 4806 states and 11494 transitions. Word has length 25 [2019-12-18 22:09:01,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:09:01,249 INFO L462 AbstractCegarLoop]: Abstraction has 4806 states and 11494 transitions. [2019-12-18 22:09:01,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:09:01,250 INFO L276 IsEmpty]: Start isEmpty. Operand 4806 states and 11494 transitions. [2019-12-18 22:09:01,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 22:09:01,254 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:09:01,254 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:09:01,254 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:09:01,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:09:01,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1877799940, now seen corresponding path program 1 times [2019-12-18 22:09:01,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:09:01,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170058312] [2019-12-18 22:09:01,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:09:01,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:09:01,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:09:01,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170058312] [2019-12-18 22:09:01,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:09:01,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:09:01,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637159668] [2019-12-18 22:09:01,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:09:01,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:09:01,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:09:01,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:09:01,369 INFO L87 Difference]: Start difference. First operand 4806 states and 11494 transitions. Second operand 5 states. [2019-12-18 22:09:01,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:09:01,411 INFO L93 Difference]: Finished difference Result 1096 states and 2313 transitions. [2019-12-18 22:09:01,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:09:01,412 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 22:09:01,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:09:01,413 INFO L225 Difference]: With dead ends: 1096 [2019-12-18 22:09:01,414 INFO L226 Difference]: Without dead ends: 992 [2019-12-18 22:09:01,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:09:01,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2019-12-18 22:09:01,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 950. [2019-12-18 22:09:01,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2019-12-18 22:09:01,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 2011 transitions. [2019-12-18 22:09:01,425 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 2011 transitions. Word has length 37 [2019-12-18 22:09:01,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:09:01,425 INFO L462 AbstractCegarLoop]: Abstraction has 950 states and 2011 transitions. [2019-12-18 22:09:01,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:09:01,425 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 2011 transitions. [2019-12-18 22:09:01,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 22:09:01,428 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:09:01,428 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:09:01,428 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:09:01,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:09:01,428 INFO L82 PathProgramCache]: Analyzing trace with hash -273642496, now seen corresponding path program 1 times [2019-12-18 22:09:01,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:09:01,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10090350] [2019-12-18 22:09:01,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:09:01,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:09:01,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:09:01,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10090350] [2019-12-18 22:09:01,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:09:01,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:09:01,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41023225] [2019-12-18 22:09:01,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:09:01,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:09:01,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:09:01,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:09:01,566 INFO L87 Difference]: Start difference. First operand 950 states and 2011 transitions. Second operand 3 states. [2019-12-18 22:09:01,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:09:01,581 INFO L93 Difference]: Finished difference Result 950 states and 1969 transitions. [2019-12-18 22:09:01,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:09:01,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-12-18 22:09:01,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:09:01,583 INFO L225 Difference]: With dead ends: 950 [2019-12-18 22:09:01,583 INFO L226 Difference]: Without dead ends: 950 [2019-12-18 22:09:01,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:09:01,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2019-12-18 22:09:01,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2019-12-18 22:09:01,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2019-12-18 22:09:01,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1969 transitions. [2019-12-18 22:09:01,596 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1969 transitions. Word has length 68 [2019-12-18 22:09:01,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:09:01,596 INFO L462 AbstractCegarLoop]: Abstraction has 950 states and 1969 transitions. [2019-12-18 22:09:01,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:09:01,597 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1969 transitions. [2019-12-18 22:09:01,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-18 22:09:01,599 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:09:01,599 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:09:01,599 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:09:01,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:09:01,599 INFO L82 PathProgramCache]: Analyzing trace with hash 392588486, now seen corresponding path program 1 times [2019-12-18 22:09:01,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:09:01,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646475996] [2019-12-18 22:09:01,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:09:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:09:01,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:09:01,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646475996] [2019-12-18 22:09:01,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:09:01,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:09:01,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646044525] [2019-12-18 22:09:01,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:09:01,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:09:01,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:09:01,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:09:01,716 INFO L87 Difference]: Start difference. First operand 950 states and 1969 transitions. Second operand 5 states. [2019-12-18 22:09:01,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:09:01,956 INFO L93 Difference]: Finished difference Result 1088 states and 2217 transitions. [2019-12-18 22:09:01,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 22:09:01,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-18 22:09:01,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:09:01,959 INFO L225 Difference]: With dead ends: 1088 [2019-12-18 22:09:01,959 INFO L226 Difference]: Without dead ends: 1088 [2019-12-18 22:09:01,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:09:01,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-12-18 22:09:01,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 1035. [2019-12-18 22:09:01,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1035 states. [2019-12-18 22:09:01,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 2123 transitions. [2019-12-18 22:09:01,972 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 2123 transitions. Word has length 69 [2019-12-18 22:09:01,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:09:01,973 INFO L462 AbstractCegarLoop]: Abstraction has 1035 states and 2123 transitions. [2019-12-18 22:09:01,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:09:01,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 2123 transitions. [2019-12-18 22:09:01,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-18 22:09:01,975 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:09:01,975 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:09:01,975 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:09:01,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:09:01,976 INFO L82 PathProgramCache]: Analyzing trace with hash -256828858, now seen corresponding path program 2 times [2019-12-18 22:09:01,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:09:01,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784336395] [2019-12-18 22:09:01,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:09:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:09:02,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:09:02,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784336395] [2019-12-18 22:09:02,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:09:02,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:09:02,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68729913] [2019-12-18 22:09:02,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:09:02,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:09:02,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:09:02,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:09:02,164 INFO L87 Difference]: Start difference. First operand 1035 states and 2123 transitions. Second operand 7 states. [2019-12-18 22:09:02,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:09:02,491 INFO L93 Difference]: Finished difference Result 1138 states and 2304 transitions. [2019-12-18 22:09:02,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 22:09:02,491 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-12-18 22:09:02,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:09:02,493 INFO L225 Difference]: With dead ends: 1138 [2019-12-18 22:09:02,493 INFO L226 Difference]: Without dead ends: 1138 [2019-12-18 22:09:02,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:09:02,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2019-12-18 22:09:02,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1042. [2019-12-18 22:09:02,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1042 states. [2019-12-18 22:09:02,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 2136 transitions. [2019-12-18 22:09:02,503 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 2136 transitions. Word has length 69 [2019-12-18 22:09:02,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:09:02,504 INFO L462 AbstractCegarLoop]: Abstraction has 1042 states and 2136 transitions. [2019-12-18 22:09:02,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:09:02,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 2136 transitions. [2019-12-18 22:09:02,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-18 22:09:02,506 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:09:02,506 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:09:02,506 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:09:02,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:09:02,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1924607802, now seen corresponding path program 3 times [2019-12-18 22:09:02,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:09:02,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486360952] [2019-12-18 22:09:02,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:09:02,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:09:02,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:09:02,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486360952] [2019-12-18 22:09:02,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:09:02,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 22:09:02,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352394992] [2019-12-18 22:09:02,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 22:09:02,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:09:02,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 22:09:02,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:09:02,689 INFO L87 Difference]: Start difference. First operand 1042 states and 2136 transitions. Second operand 8 states. [2019-12-18 22:09:03,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:09:03,480 INFO L93 Difference]: Finished difference Result 2193 states and 4462 transitions. [2019-12-18 22:09:03,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 22:09:03,480 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2019-12-18 22:09:03,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:09:03,483 INFO L225 Difference]: With dead ends: 2193 [2019-12-18 22:09:03,484 INFO L226 Difference]: Without dead ends: 2193 [2019-12-18 22:09:03,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-12-18 22:09:03,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2193 states. [2019-12-18 22:09:03,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2193 to 1410. [2019-12-18 22:09:03,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1410 states. [2019-12-18 22:09:03,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 2915 transitions. [2019-12-18 22:09:03,500 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 2915 transitions. Word has length 69 [2019-12-18 22:09:03,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:09:03,500 INFO L462 AbstractCegarLoop]: Abstraction has 1410 states and 2915 transitions. [2019-12-18 22:09:03,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 22:09:03,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 2915 transitions. [2019-12-18 22:09:03,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-18 22:09:03,502 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:09:03,505 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:09:03,505 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:09:03,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:09:03,505 INFO L82 PathProgramCache]: Analyzing trace with hash -630243776, now seen corresponding path program 1 times [2019-12-18 22:09:03,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:09:03,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959470397] [2019-12-18 22:09:03,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:09:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:09:03,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:09:03,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959470397] [2019-12-18 22:09:03,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:09:03,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 22:09:03,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126138660] [2019-12-18 22:09:03,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 22:09:03,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:09:03,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 22:09:03,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:09:03,809 INFO L87 Difference]: Start difference. First operand 1410 states and 2915 transitions. Second operand 9 states. [2019-12-18 22:09:04,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:09:04,134 INFO L93 Difference]: Finished difference Result 1789 states and 3635 transitions. [2019-12-18 22:09:04,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 22:09:04,135 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2019-12-18 22:09:04,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:09:04,136 INFO L225 Difference]: With dead ends: 1789 [2019-12-18 22:09:04,136 INFO L226 Difference]: Without dead ends: 338 [2019-12-18 22:09:04,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-12-18 22:09:04,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-12-18 22:09:04,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 308. [2019-12-18 22:09:04,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-12-18 22:09:04,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 528 transitions. [2019-12-18 22:09:04,141 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 528 transitions. Word has length 70 [2019-12-18 22:09:04,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:09:04,142 INFO L462 AbstractCegarLoop]: Abstraction has 308 states and 528 transitions. [2019-12-18 22:09:04,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 22:09:04,142 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 528 transitions. [2019-12-18 22:09:04,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-18 22:09:04,143 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:09:04,144 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:09:04,144 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:09:04,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:09:04,144 INFO L82 PathProgramCache]: Analyzing trace with hash 797842854, now seen corresponding path program 1 times [2019-12-18 22:09:04,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:09:04,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186207926] [2019-12-18 22:09:04,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:09:04,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:09:04,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:09:04,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186207926] [2019-12-18 22:09:04,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:09:04,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 22:09:04,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508561542] [2019-12-18 22:09:04,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 22:09:04,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:09:04,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 22:09:04,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:09:04,384 INFO L87 Difference]: Start difference. First operand 308 states and 528 transitions. Second operand 11 states. [2019-12-18 22:09:04,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:09:04,931 INFO L93 Difference]: Finished difference Result 647 states and 1121 transitions. [2019-12-18 22:09:04,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 22:09:04,931 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2019-12-18 22:09:04,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:09:04,932 INFO L225 Difference]: With dead ends: 647 [2019-12-18 22:09:04,933 INFO L226 Difference]: Without dead ends: 647 [2019-12-18 22:09:04,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2019-12-18 22:09:04,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-12-18 22:09:04,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 357. [2019-12-18 22:09:04,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-12-18 22:09:04,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 615 transitions. [2019-12-18 22:09:04,938 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 615 transitions. Word has length 70 [2019-12-18 22:09:04,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:09:04,938 INFO L462 AbstractCegarLoop]: Abstraction has 357 states and 615 transitions. [2019-12-18 22:09:04,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 22:09:04,938 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 615 transitions. [2019-12-18 22:09:04,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-18 22:09:04,939 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:09:04,940 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:09:04,940 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:09:04,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:09:04,940 INFO L82 PathProgramCache]: Analyzing trace with hash 2099586582, now seen corresponding path program 2 times [2019-12-18 22:09:04,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:09:04,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136456583] [2019-12-18 22:09:04,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:09:04,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:09:05,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:09:05,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136456583] [2019-12-18 22:09:05,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:09:05,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:09:05,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831652171] [2019-12-18 22:09:05,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:09:05,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:09:05,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:09:05,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:09:05,017 INFO L87 Difference]: Start difference. First operand 357 states and 615 transitions. Second operand 3 states. [2019-12-18 22:09:05,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:09:05,050 INFO L93 Difference]: Finished difference Result 356 states and 613 transitions. [2019-12-18 22:09:05,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:09:05,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-12-18 22:09:05,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:09:05,052 INFO L225 Difference]: With dead ends: 356 [2019-12-18 22:09:05,052 INFO L226 Difference]: Without dead ends: 356 [2019-12-18 22:09:05,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:09:05,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-12-18 22:09:05,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 251. [2019-12-18 22:09:05,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-12-18 22:09:05,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 419 transitions. [2019-12-18 22:09:05,056 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 419 transitions. Word has length 70 [2019-12-18 22:09:05,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:09:05,057 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 419 transitions. [2019-12-18 22:09:05,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:09:05,057 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 419 transitions. [2019-12-18 22:09:05,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-18 22:09:05,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:09:05,058 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:09:05,058 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:09:05,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:09:05,059 INFO L82 PathProgramCache]: Analyzing trace with hash 265573410, now seen corresponding path program 1 times [2019-12-18 22:09:05,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:09:05,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963471537] [2019-12-18 22:09:05,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:09:05,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:09:05,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:09:05,253 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 22:09:05,254 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 22:09:05,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$r_buff1_thd0~0_35) (= 0 v_~weak$$choice0~0_10) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1719~0.base_26|) (= (store .cse0 |v_ULTIMATE.start_main_~#t1719~0.base_26| 1) |v_#valid_45|) (= v_~y$w_buff0_used~0_146 0) (= 0 v_~y$flush_delayed~0_22) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff1_thd2~0_40) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1719~0.base_26| 4) |v_#length_19|) (= v_~y~0_38 0) (= 0 v_~x~0_9) (= 0 v_~weak$$choice2~0_34) (= 0 v_~__unbuffered_cnt~0_14) (= v_~y$r_buff0_thd0~0_69 0) (= |v_ULTIMATE.start_main_~#t1719~0.offset_20| 0) (< 0 |v_#StackHeapBarrier_14|) (= 0 |v_#NULL.base_4|) (= 0 v_~y$r_buff1_thd1~0_18) (= v_~y$r_buff0_thd2~0_75 0) (= 0 v_~y$w_buff1~0_35) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1719~0.base_26| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1719~0.base_26|) |v_ULTIMATE.start_main_~#t1719~0.offset_20| 0))) (= 0 v_~y$w_buff0~0_38) (= v_~y$w_buff1_used~0_78 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1719~0.base_26|)) (= v_~y$mem_tmp~0_12 0) (= |v_#NULL.offset_4| 0) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~main$tmp_guard0~0_11 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~__unbuffered_p1_EAX~0_8) (= v_~y$r_buff0_thd1~0_20 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_13|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_23|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_11|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_15|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_13|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_14|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_13|, ~y$mem_tmp~0=v_~y$mem_tmp~0_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_20, ~y$flush_delayed~0=v_~y$flush_delayed~0_22, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet47=|v_ULTIMATE.start_main_#t~nondet47_9|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_14|, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_15|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_14|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_15|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_13|, ~y$w_buff1~0=v_~y$w_buff1~0_35, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_75, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_35, ~x~0=v_~x~0_9, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_146, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_13|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_14|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_18, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_15|, ULTIMATE.start_main_~#t1720~0.offset=|v_ULTIMATE.start_main_~#t1720~0.offset_20|, ~y$w_buff0~0=v_~y$w_buff0~0_38, ~y~0=v_~y~0_38, ULTIMATE.start_main_~#t1720~0.base=|v_ULTIMATE.start_main_~#t1720~0.base_26|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ULTIMATE.start_main_~#t1719~0.base=|v_ULTIMATE.start_main_~#t1719~0.base_26|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_9|, ULTIMATE.start_main_~#t1719~0.offset=|v_ULTIMATE.start_main_~#t1719~0.offset_20|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_16|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_14|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_13|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_14|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_40, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_15|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_69, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_78} AuxVars[] AssignedVars[#NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~nondet47, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite56, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite65, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t1720~0.offset, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_~#t1720~0.base, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t1719~0.base, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_~#t1719~0.offset, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite53, #NULL.base, ULTIMATE.start_main_#t~ite55, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 22:09:05,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [974] [974] L797-1-->L799: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1720~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1720~0.base_13|) |v_ULTIMATE.start_main_~#t1720~0.offset_11| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t1720~0.base_13|)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1720~0.base_13| 4)) (= (select |v_#valid_27| |v_ULTIMATE.start_main_~#t1720~0.base_13|) 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1720~0.base_13|) (= (store |v_#valid_27| |v_ULTIMATE.start_main_~#t1720~0.base_13| 1) |v_#valid_26|) (= 0 |v_ULTIMATE.start_main_~#t1720~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1720~0.offset=|v_ULTIMATE.start_main_~#t1720~0.offset_11|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1720~0.base=|v_ULTIMATE.start_main_~#t1720~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1720~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1720~0.base] because there is no mapped edge [2019-12-18 22:09:05,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= v_~y$w_buff1_used~0_59 v_~y$w_buff0_used~0_108) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| 1) (= v_~y$w_buff0~0_26 v_~y$w_buff1~0_19) (= 2 v_~y$w_buff0~0_25) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= 0 (mod v_~y$w_buff1_used~0_59 256)) (= v_~y$w_buff0_used~0_107 1)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_108, ~y$w_buff0~0=v_~y$w_buff0~0_26, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_107, ~y$w_buff1~0=v_~y$w_buff1~0_19, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~y$w_buff0~0=v_~y$w_buff0~0_25, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_59} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 22:09:05,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L759-2-->L759-5: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1897270287 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-1897270287 256) 0)) (.cse1 (= |P1Thread1of1ForFork1_#t~ite12_Out-1897270287| |P1Thread1of1ForFork1_#t~ite11_Out-1897270287|))) (or (and (not .cse0) (= ~y$w_buff0~0_In-1897270287 |P1Thread1of1ForFork1_#t~ite11_Out-1897270287|) .cse1 (not .cse2)) (and (or .cse0 .cse2) (= ~y$w_buff1~0_In-1897270287 |P1Thread1of1ForFork1_#t~ite11_Out-1897270287|) .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1897270287, ~y$w_buff1~0=~y$w_buff1~0_In-1897270287, ~y$w_buff0~0=~y$w_buff0~0_In-1897270287, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1897270287} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1897270287, ~y$w_buff1~0=~y$w_buff1~0_In-1897270287, ~y$w_buff0~0=~y$w_buff0~0_In-1897270287, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1897270287, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1897270287|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1897270287|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 22:09:05,275 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] L764-->L765: Formula: (and (not (= (mod v_~weak$$choice2~0_28 256) 0)) (= v_~y$r_buff0_thd2~0_58 v_~y$r_buff0_thd2~0_57)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_57, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_9|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-18 22:09:05,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-2103583360 256) 0))) (or (and .cse0 (= ~y~0_In-2103583360 |P1Thread1of1ForFork1_#t~ite31_Out-2103583360|)) (and (not .cse0) (= ~y$mem_tmp~0_In-2103583360 |P1Thread1of1ForFork1_#t~ite31_Out-2103583360|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-2103583360, ~y$flush_delayed~0=~y$flush_delayed~0_In-2103583360, ~y~0=~y~0_In-2103583360} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-2103583360, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-2103583360|, ~y$flush_delayed~0=~y$flush_delayed~0_In-2103583360, ~y~0=~y~0_In-2103583360} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-18 22:09:05,280 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L730-2-->L730-5: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-1387544032 256))) (.cse0 (= |P0Thread1of1ForFork0_#t~ite4_Out-1387544032| |P0Thread1of1ForFork0_#t~ite3_Out-1387544032|)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1387544032 256)))) (or (and (= ~y~0_In-1387544032 |P0Thread1of1ForFork0_#t~ite3_Out-1387544032|) .cse0 (or .cse1 .cse2)) (and (not .cse1) .cse0 (= ~y$w_buff1~0_In-1387544032 |P0Thread1of1ForFork0_#t~ite3_Out-1387544032|) (not .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1387544032, ~y$w_buff1~0=~y$w_buff1~0_In-1387544032, ~y~0=~y~0_In-1387544032, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1387544032} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1387544032, P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-1387544032|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-1387544032|, ~y$w_buff1~0=~y$w_buff1~0_In-1387544032, ~y~0=~y~0_In-1387544032, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1387544032} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 22:09:05,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [924] [924] L731-->L731-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-407636675 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-407636675 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-407636675| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-407636675| ~y$w_buff0_used~0_In-407636675)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-407636675, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-407636675} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-407636675|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-407636675, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-407636675} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 22:09:05,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [944] [944] L732-->L732-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1646777183 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In1646777183 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In1646777183 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In1646777183 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1646777183 |P0Thread1of1ForFork0_#t~ite6_Out1646777183|)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out1646777183| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1646777183, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1646777183, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1646777183, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1646777183} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1646777183|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1646777183, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1646777183, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1646777183, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1646777183} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 22:09:05,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L733-->L733-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-498849321 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-498849321 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite7_Out-498849321| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite7_Out-498849321| ~y$r_buff0_thd1~0_In-498849321) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-498849321, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-498849321} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-498849321, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-498849321|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-498849321} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 22:09:05,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L734-->L734-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1955487678 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-1955487678 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1955487678 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-1955487678 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-1955487678| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out-1955487678| ~y$r_buff1_thd1~0_In-1955487678)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1955487678, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1955487678, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1955487678, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1955487678} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1955487678, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1955487678, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1955487678|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1955487678, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1955487678} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 22:09:05,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L734-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_15) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_15, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 22:09:05,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1326246664 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1326246664 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out1326246664| ~y$w_buff0_used~0_In1326246664) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out1326246664| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1326246664, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1326246664} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1326246664, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1326246664, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1326246664|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 22:09:05,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [939] [939] L776-->L776-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In1725437748 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In1725437748 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In1725437748 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1725437748 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1725437748 |P1Thread1of1ForFork1_#t~ite35_Out1725437748|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1725437748|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1725437748, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1725437748, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1725437748, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1725437748} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1725437748, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1725437748, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1725437748, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1725437748|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1725437748} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 22:09:05,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L777-->L778: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In583230996 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In583230996 256)))) (or (and (not .cse0) (= 0 ~y$r_buff0_thd2~0_Out583230996) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd2~0_In583230996 ~y$r_buff0_thd2~0_Out583230996)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In583230996, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In583230996} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In583230996, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out583230996, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out583230996|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 22:09:05,287 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L778-->L778-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In315080863 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In315080863 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In315080863 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In315080863 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out315080863|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~y$r_buff1_thd2~0_In315080863 |P1Thread1of1ForFork1_#t~ite37_Out315080863|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In315080863, ~y$w_buff0_used~0=~y$w_buff0_used~0_In315080863, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In315080863, ~y$w_buff1_used~0=~y$w_buff1_used~0_In315080863} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In315080863, ~y$w_buff0_used~0=~y$w_buff0_used~0_In315080863, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In315080863, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out315080863|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In315080863} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 22:09:05,287 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_34 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_34, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 22:09:05,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L803-->L805-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_47 256)) (= (mod v_~y$w_buff0_used~0_102 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_102, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_47, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_102, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_47, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 22:09:05,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [931] [931] L805-2-->L805-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-719935563 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-719935563 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-719935563| ~y$w_buff1~0_In-719935563) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out-719935563| ~y~0_In-719935563) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-719935563, ~y~0=~y~0_In-719935563, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-719935563, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-719935563} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-719935563|, ~y$w_buff1~0=~y$w_buff1~0_In-719935563, ~y~0=~y~0_In-719935563, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-719935563, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-719935563} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 22:09:05,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] L805-4-->L806: Formula: (= v_~y~0_25 |v_ULTIMATE.start_main_#t~ite40_7|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-18 22:09:05,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-225210996 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-225210996 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out-225210996| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite42_Out-225210996| ~y$w_buff0_used~0_In-225210996)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-225210996, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-225210996} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-225210996, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-225210996, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-225210996|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 22:09:05,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L807-->L807-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd0~0_In2146270848 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In2146270848 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In2146270848 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In2146270848 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out2146270848|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$w_buff1_used~0_In2146270848 |ULTIMATE.start_main_#t~ite43_Out2146270848|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2146270848, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2146270848, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2146270848, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2146270848} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2146270848, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2146270848, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out2146270848|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2146270848, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2146270848} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 22:09:05,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [940] [940] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-392242888 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-392242888 256)))) (or (and (= ~y$r_buff0_thd0~0_In-392242888 |ULTIMATE.start_main_#t~ite44_Out-392242888|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out-392242888|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-392242888, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-392242888} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-392242888, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-392242888, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-392242888|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 22:09:05,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L809-->L809-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-1649349049 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1649349049 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1649349049 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1649349049 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out-1649349049| ~y$r_buff1_thd0~0_In-1649349049)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-1649349049|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1649349049, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1649349049, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1649349049, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1649349049} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1649349049, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1649349049, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1649349049, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1649349049|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1649349049} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 22:09:05,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [941] [941] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1968954478 256) 0))) (or (and (not .cse0) (= ~y$mem_tmp~0_In-1968954478 |ULTIMATE.start_main_#t~ite68_Out-1968954478|)) (and .cse0 (= ~y~0_In-1968954478 |ULTIMATE.start_main_#t~ite68_Out-1968954478|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1968954478, ~y$flush_delayed~0=~y$flush_delayed~0_In-1968954478, ~y~0=~y~0_In-1968954478} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1968954478, ~y$flush_delayed~0=~y$flush_delayed~0_In-1968954478, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out-1968954478|, ~y~0=~y~0_In-1968954478} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-18 22:09:05,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L824-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9| (mod v_~main$tmp_guard1~0_10 256)) (= 0 v_~y$flush_delayed~0_15) (= v_~y~0_31 |v_ULTIMATE.start_main_#t~ite68_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_12|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~y$flush_delayed~0=v_~y$flush_delayed~0_15, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_11|, ~y~0=v_~y~0_31, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite68, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 22:09:05,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:09:05 BasicIcfg [2019-12-18 22:09:05,458 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 22:09:05,461 INFO L168 Benchmark]: Toolchain (without parser) took 27064.03 ms. Allocated memory was 143.1 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 102.6 MB in the beginning and 951.5 MB in the end (delta: -848.9 MB). Peak memory consumption was 436.1 MB. Max. memory is 7.1 GB. [2019-12-18 22:09:05,461 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 143.1 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-18 22:09:05,463 INFO L168 Benchmark]: CACSL2BoogieTranslator took 823.60 ms. Allocated memory was 143.1 MB in the beginning and 203.9 MB in the end (delta: 60.8 MB). Free memory was 102.4 MB in the beginning and 157.1 MB in the end (delta: -54.6 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. [2019-12-18 22:09:05,464 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.13 ms. Allocated memory is still 203.9 MB. Free memory was 157.1 MB in the beginning and 153.2 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. [2019-12-18 22:09:05,467 INFO L168 Benchmark]: Boogie Preprocessor took 41.75 ms. Allocated memory is still 203.9 MB. Free memory was 153.2 MB in the beginning and 150.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 22:09:05,468 INFO L168 Benchmark]: RCFGBuilder took 1134.62 ms. Allocated memory is still 203.9 MB. Free memory was 150.6 MB in the beginning and 94.8 MB in the end (delta: 55.8 MB). Peak memory consumption was 55.8 MB. Max. memory is 7.1 GB. [2019-12-18 22:09:05,468 INFO L168 Benchmark]: TraceAbstraction took 24981.92 ms. Allocated memory was 203.9 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 94.1 MB in the beginning and 951.5 MB in the end (delta: -857.4 MB). Peak memory consumption was 366.8 MB. Max. memory is 7.1 GB. [2019-12-18 22:09:05,477 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.47 ms. Allocated memory is still 143.1 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 823.60 ms. Allocated memory was 143.1 MB in the beginning and 203.9 MB in the end (delta: 60.8 MB). Free memory was 102.4 MB in the beginning and 157.1 MB in the end (delta: -54.6 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.13 ms. Allocated memory is still 203.9 MB. Free memory was 157.1 MB in the beginning and 153.2 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.75 ms. Allocated memory is still 203.9 MB. Free memory was 153.2 MB in the beginning and 150.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1134.62 ms. Allocated memory is still 203.9 MB. Free memory was 150.6 MB in the beginning and 94.8 MB in the end (delta: 55.8 MB). Peak memory consumption was 55.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 24981.92 ms. Allocated memory was 203.9 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 94.1 MB in the beginning and 951.5 MB in the end (delta: -857.4 MB). Peak memory consumption was 366.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 189 ProgramPointsBefore, 114 ProgramPointsAfterwards, 244 TransitionsBefore, 139 TransitionsAfterwards, 25246 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 53 ConcurrentYvCompositions, 33 ChoiceCompositions, 10096 VarBasedMoverChecksPositive, 239 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 146475 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t1719, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] FCALL, FORK 0 pthread_create(&t1720, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L749] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L750] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L751] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L752] 2 y$r_buff0_thd2 = (_Bool)1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L762] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L763] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y = y$flush_delayed ? y$mem_tmp : y [L768] 2 y$flush_delayed = (_Bool)0 [L771] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 x = 1 [L727] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L730] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L730] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L731] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L732] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L733] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L774] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L775] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L776] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L807] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L808] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L809] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L812] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 0 y$flush_delayed = weak$$choice2 [L815] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L816] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L816] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L817] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L818] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L818] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L819] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L819] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L820] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L820] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L821] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L822] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L823] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 183 locations, 2 error locations. Result: UNSAFE, OverallTime: 24.6s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2594 SDtfs, 2291 SDslu, 5140 SDs, 0 SdLazy, 2623 SolverSat, 154 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 20 SyntacticMatches, 12 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49001occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.9s AutomataMinimizationTime, 13 MinimizatonAttempts, 24139 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 662 NumberOfCodeBlocks, 662 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 578 ConstructedInterpolants, 0 QuantifiedInterpolants, 121398 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...