/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix038_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:20:13,080 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:20:13,083 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:20:13,102 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:20:13,102 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:20:13,104 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:20:13,106 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:20:13,112 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:20:13,114 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:20:13,115 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:20:13,117 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:20:13,119 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:20:13,119 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:20:13,120 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:20:13,121 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:20:13,122 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:20:13,123 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:20:13,124 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:20:13,125 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:20:13,127 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:20:13,129 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:20:13,130 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:20:13,131 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:20:13,132 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:20:13,134 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:20:13,134 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:20:13,134 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:20:13,135 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:20:13,136 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:20:13,137 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:20:13,137 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:20:13,137 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:20:13,138 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:20:13,139 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:20:13,140 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:20:13,140 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:20:13,141 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:20:13,141 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:20:13,141 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:20:13,142 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:20:13,143 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:20:13,144 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 17:20:13,158 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:20:13,158 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:20:13,159 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:20:13,159 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:20:13,159 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:20:13,160 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:20:13,160 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:20:13,160 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:20:13,160 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:20:13,160 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:20:13,161 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:20:13,161 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:20:13,161 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:20:13,161 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:20:13,161 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:20:13,162 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:20:13,162 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:20:13,162 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:20:13,162 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:20:13,162 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:20:13,163 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:20:13,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:20:13,163 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:20:13,163 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:20:13,163 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:20:13,164 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:20:13,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:20:13,164 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:20:13,164 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:20:13,439 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:20:13,452 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:20:13,455 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:20:13,457 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:20:13,457 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:20:13,458 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_rmo.opt.i [2019-12-18 17:20:13,542 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54b1f1464/43fa3e4b2ce94c54b19320efd8ba31b1/FLAG01c14037b [2019-12-18 17:20:14,082 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:20:14,083 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_rmo.opt.i [2019-12-18 17:20:14,108 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54b1f1464/43fa3e4b2ce94c54b19320efd8ba31b1/FLAG01c14037b [2019-12-18 17:20:14,367 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54b1f1464/43fa3e4b2ce94c54b19320efd8ba31b1 [2019-12-18 17:20:14,375 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:20:14,377 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:20:14,378 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:20:14,378 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:20:14,382 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:20:14,383 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:20:14" (1/1) ... [2019-12-18 17:20:14,386 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20f0f0d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:20:14, skipping insertion in model container [2019-12-18 17:20:14,386 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:20:14" (1/1) ... [2019-12-18 17:20:14,394 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:20:14,458 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:20:14,980 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:20:14,993 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:20:15,066 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:20:15,158 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:20:15,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:20:15 WrapperNode [2019-12-18 17:20:15,159 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:20:15,160 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:20:15,160 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:20:15,160 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:20:15,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:20:15" (1/1) ... [2019-12-18 17:20:15,198 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:20:15" (1/1) ... [2019-12-18 17:20:15,234 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:20:15,235 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:20:15,235 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:20:15,235 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:20:15,244 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:20:15" (1/1) ... [2019-12-18 17:20:15,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:20:15" (1/1) ... [2019-12-18 17:20:15,249 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:20:15" (1/1) ... [2019-12-18 17:20:15,250 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:20:15" (1/1) ... [2019-12-18 17:20:15,265 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:20:15" (1/1) ... [2019-12-18 17:20:15,269 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:20:15" (1/1) ... [2019-12-18 17:20:15,273 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:20:15" (1/1) ... [2019-12-18 17:20:15,277 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:20:15,278 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:20:15,278 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:20:15,278 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:20:15,279 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:20:15" (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 17:20:15,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:20:15,339 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:20:15,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:20:15,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:20:15,339 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:20:15,340 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:20:15,340 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:20:15,340 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:20:15,340 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 17:20:15,340 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 17:20:15,341 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:20:15,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:20:15,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:20:15,343 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 17:20:16,067 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:20:16,068 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:20:16,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:20:16 BoogieIcfgContainer [2019-12-18 17:20:16,070 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:20:16,071 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:20:16,071 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:20:16,075 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:20:16,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:20:14" (1/3) ... [2019-12-18 17:20:16,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62b7441c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:20:16, skipping insertion in model container [2019-12-18 17:20:16,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:20:15" (2/3) ... [2019-12-18 17:20:16,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62b7441c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:20:16, skipping insertion in model container [2019-12-18 17:20:16,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:20:16" (3/3) ... [2019-12-18 17:20:16,079 INFO L109 eAbstractionObserver]: Analyzing ICFG mix038_rmo.opt.i [2019-12-18 17:20:16,090 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:20:16,091 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:20:16,099 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:20:16,100 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:20:16,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,142 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,143 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,146 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,146 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,185 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,188 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,189 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,190 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,193 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,204 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,205 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,210 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,213 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,216 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,217 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,231 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:20:16,248 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 17:20:16,268 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:20:16,269 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:20:16,269 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:20:16,269 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:20:16,269 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:20:16,269 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:20:16,270 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:20:16,270 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:20:16,287 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 178 transitions [2019-12-18 17:20:16,289 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 153 places, 178 transitions [2019-12-18 17:20:16,369 INFO L126 PetriNetUnfolder]: 35/175 cut-off events. [2019-12-18 17:20:16,369 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:20:16,385 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 175 events. 35/175 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 344 event pairs. 9/147 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-18 17:20:16,412 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 153 places, 178 transitions [2019-12-18 17:20:16,455 INFO L126 PetriNetUnfolder]: 35/175 cut-off events. [2019-12-18 17:20:16,455 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:20:16,466 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 175 events. 35/175 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 344 event pairs. 9/147 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-18 17:20:16,493 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-12-18 17:20:16,494 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:20:21,272 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-18 17:20:21,394 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 17:20:21,428 INFO L206 etLargeBlockEncoding]: Checked pairs total: 41572 [2019-12-18 17:20:21,428 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-18 17:20:21,431 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 73 places, 80 transitions [2019-12-18 17:20:22,288 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 13626 states. [2019-12-18 17:20:22,290 INFO L276 IsEmpty]: Start isEmpty. Operand 13626 states. [2019-12-18 17:20:22,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 17:20:22,296 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:20:22,297 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:20:22,297 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:20:22,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:20:22,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1504632550, now seen corresponding path program 1 times [2019-12-18 17:20:22,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:20:22,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144751051] [2019-12-18 17:20:22,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:20:22,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:20:22,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:20:22,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144751051] [2019-12-18 17:20:22,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:20:22,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:20:22,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317660886] [2019-12-18 17:20:22,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:20:22,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:20:22,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:20:22,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:20:22,576 INFO L87 Difference]: Start difference. First operand 13626 states. Second operand 3 states. [2019-12-18 17:20:23,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:20:23,067 INFO L93 Difference]: Finished difference Result 13322 states and 50870 transitions. [2019-12-18 17:20:23,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:20:23,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 17:20:23,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:20:23,260 INFO L225 Difference]: With dead ends: 13322 [2019-12-18 17:20:23,260 INFO L226 Difference]: Without dead ends: 12542 [2019-12-18 17:20:23,261 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 17:20:23,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12542 states. [2019-12-18 17:20:23,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12542 to 12542. [2019-12-18 17:20:23,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12542 states. [2019-12-18 17:20:24,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12542 states to 12542 states and 47820 transitions. [2019-12-18 17:20:24,691 INFO L78 Accepts]: Start accepts. Automaton has 12542 states and 47820 transitions. Word has length 7 [2019-12-18 17:20:24,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:20:24,693 INFO L462 AbstractCegarLoop]: Abstraction has 12542 states and 47820 transitions. [2019-12-18 17:20:24,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:20:24,693 INFO L276 IsEmpty]: Start isEmpty. Operand 12542 states and 47820 transitions. [2019-12-18 17:20:24,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 17:20:24,705 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:20:24,705 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:20:24,706 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:20:24,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:20:24,706 INFO L82 PathProgramCache]: Analyzing trace with hash 696666680, now seen corresponding path program 1 times [2019-12-18 17:20:24,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:20:24,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378916369] [2019-12-18 17:20:24,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:20:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:20:24,840 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 17:20:24,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378916369] [2019-12-18 17:20:24,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:20:24,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:20:24,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404674060] [2019-12-18 17:20:24,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:20:24,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:20:24,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:20:24,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:20:24,847 INFO L87 Difference]: Start difference. First operand 12542 states and 47820 transitions. Second operand 3 states. [2019-12-18 17:20:24,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:20:24,987 INFO L93 Difference]: Finished difference Result 7513 states and 25047 transitions. [2019-12-18 17:20:24,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:20:24,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 17:20:24,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:20:25,034 INFO L225 Difference]: With dead ends: 7513 [2019-12-18 17:20:25,035 INFO L226 Difference]: Without dead ends: 7513 [2019-12-18 17:20:25,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:20:25,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7513 states. [2019-12-18 17:20:25,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7513 to 7513. [2019-12-18 17:20:25,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7513 states. [2019-12-18 17:20:25,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7513 states to 7513 states and 25047 transitions. [2019-12-18 17:20:25,327 INFO L78 Accepts]: Start accepts. Automaton has 7513 states and 25047 transitions. Word has length 13 [2019-12-18 17:20:25,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:20:25,328 INFO L462 AbstractCegarLoop]: Abstraction has 7513 states and 25047 transitions. [2019-12-18 17:20:25,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:20:25,328 INFO L276 IsEmpty]: Start isEmpty. Operand 7513 states and 25047 transitions. [2019-12-18 17:20:25,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 17:20:25,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:20:25,330 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:20:25,330 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:20:25,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:20:25,331 INFO L82 PathProgramCache]: Analyzing trace with hash 361138653, now seen corresponding path program 1 times [2019-12-18 17:20:25,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:20:25,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683754629] [2019-12-18 17:20:25,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:20:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:20:25,424 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 17:20:25,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683754629] [2019-12-18 17:20:25,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:20:25,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:20:25,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493846155] [2019-12-18 17:20:25,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:20:25,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:20:25,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:20:25,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:20:25,427 INFO L87 Difference]: Start difference. First operand 7513 states and 25047 transitions. Second operand 4 states. [2019-12-18 17:20:25,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:20:25,512 INFO L93 Difference]: Finished difference Result 1752 states and 4700 transitions. [2019-12-18 17:20:25,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:20:25,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 17:20:25,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:20:25,518 INFO L225 Difference]: With dead ends: 1752 [2019-12-18 17:20:25,518 INFO L226 Difference]: Without dead ends: 1752 [2019-12-18 17:20:25,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:20:25,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2019-12-18 17:20:25,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1752. [2019-12-18 17:20:25,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1752 states. [2019-12-18 17:20:25,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 4700 transitions. [2019-12-18 17:20:25,579 INFO L78 Accepts]: Start accepts. Automaton has 1752 states and 4700 transitions. Word has length 14 [2019-12-18 17:20:25,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:20:25,580 INFO L462 AbstractCegarLoop]: Abstraction has 1752 states and 4700 transitions. [2019-12-18 17:20:25,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:20:25,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 4700 transitions. [2019-12-18 17:20:25,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 17:20:25,581 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:20:25,581 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:20:25,581 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:20:25,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:20:25,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1273661692, now seen corresponding path program 1 times [2019-12-18 17:20:25,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:20:25,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356325508] [2019-12-18 17:20:25,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:20:25,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:20:25,697 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 17:20:25,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356325508] [2019-12-18 17:20:25,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:20:25,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:20:25,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011263753] [2019-12-18 17:20:25,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:20:25,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:20:25,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:20:25,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:20:25,702 INFO L87 Difference]: Start difference. First operand 1752 states and 4700 transitions. Second operand 4 states. [2019-12-18 17:20:25,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:20:25,889 INFO L93 Difference]: Finished difference Result 2319 states and 6117 transitions. [2019-12-18 17:20:25,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:20:25,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 17:20:25,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:20:25,896 INFO L225 Difference]: With dead ends: 2319 [2019-12-18 17:20:25,897 INFO L226 Difference]: Without dead ends: 2319 [2019-12-18 17:20:25,897 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 17:20:25,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2319 states. [2019-12-18 17:20:25,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2319 to 2159. [2019-12-18 17:20:25,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2159 states. [2019-12-18 17:20:25,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2159 states to 2159 states and 5759 transitions. [2019-12-18 17:20:25,961 INFO L78 Accepts]: Start accepts. Automaton has 2159 states and 5759 transitions. Word has length 16 [2019-12-18 17:20:25,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:20:25,961 INFO L462 AbstractCegarLoop]: Abstraction has 2159 states and 5759 transitions. [2019-12-18 17:20:25,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:20:25,961 INFO L276 IsEmpty]: Start isEmpty. Operand 2159 states and 5759 transitions. [2019-12-18 17:20:25,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 17:20:25,966 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:20:25,966 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:20:25,966 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:20:25,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:20:25,967 INFO L82 PathProgramCache]: Analyzing trace with hash -164246467, now seen corresponding path program 1 times [2019-12-18 17:20:25,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:20:25,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701335915] [2019-12-18 17:20:25,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:20:26,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:20:26,136 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 17:20:26,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701335915] [2019-12-18 17:20:26,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:20:26,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:20:26,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168235574] [2019-12-18 17:20:26,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:20:26,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:20:26,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:20:26,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:20:26,138 INFO L87 Difference]: Start difference. First operand 2159 states and 5759 transitions. Second operand 5 states. [2019-12-18 17:20:26,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:20:26,175 INFO L93 Difference]: Finished difference Result 1278 states and 3496 transitions. [2019-12-18 17:20:26,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:20:26,176 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-18 17:20:26,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:20:26,179 INFO L225 Difference]: With dead ends: 1278 [2019-12-18 17:20:26,179 INFO L226 Difference]: Without dead ends: 1278 [2019-12-18 17:20:26,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:20:26,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2019-12-18 17:20:26,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 1218. [2019-12-18 17:20:26,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2019-12-18 17:20:26,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 3346 transitions. [2019-12-18 17:20:26,210 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 3346 transitions. Word has length 29 [2019-12-18 17:20:26,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:20:26,210 INFO L462 AbstractCegarLoop]: Abstraction has 1218 states and 3346 transitions. [2019-12-18 17:20:26,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:20:26,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 3346 transitions. [2019-12-18 17:20:26,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 17:20:26,214 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:20:26,214 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] [2019-12-18 17:20:26,214 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:20:26,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:20:26,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1707006173, now seen corresponding path program 1 times [2019-12-18 17:20:26,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:20:26,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572159333] [2019-12-18 17:20:26,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:20:26,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:20:26,330 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 17:20:26,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572159333] [2019-12-18 17:20:26,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:20:26,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:20:26,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804982515] [2019-12-18 17:20:26,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:20:26,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:20:26,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:20:26,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:20:26,333 INFO L87 Difference]: Start difference. First operand 1218 states and 3346 transitions. Second operand 3 states. [2019-12-18 17:20:26,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:20:26,347 INFO L93 Difference]: Finished difference Result 1820 states and 4707 transitions. [2019-12-18 17:20:26,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:20:26,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-18 17:20:26,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:20:26,350 INFO L225 Difference]: With dead ends: 1820 [2019-12-18 17:20:26,350 INFO L226 Difference]: Without dead ends: 642 [2019-12-18 17:20:26,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:20:26,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-12-18 17:20:26,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2019-12-18 17:20:26,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-12-18 17:20:26,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1436 transitions. [2019-12-18 17:20:26,365 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 1436 transitions. Word has length 44 [2019-12-18 17:20:26,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:20:26,365 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 1436 transitions. [2019-12-18 17:20:26,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:20:26,365 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1436 transitions. [2019-12-18 17:20:26,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 17:20:26,367 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:20:26,368 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] [2019-12-18 17:20:26,368 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:20:26,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:20:26,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1883792513, now seen corresponding path program 2 times [2019-12-18 17:20:26,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:20:26,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153696607] [2019-12-18 17:20:26,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:20:26,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:20:26,465 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 17:20:26,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153696607] [2019-12-18 17:20:26,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:20:26,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:20:26,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164469352] [2019-12-18 17:20:26,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:20:26,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:20:26,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:20:26,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:20:26,467 INFO L87 Difference]: Start difference. First operand 642 states and 1436 transitions. Second operand 6 states. [2019-12-18 17:20:26,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:20:26,688 INFO L93 Difference]: Finished difference Result 1644 states and 3615 transitions. [2019-12-18 17:20:26,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 17:20:26,688 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2019-12-18 17:20:26,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:20:26,691 INFO L225 Difference]: With dead ends: 1644 [2019-12-18 17:20:26,691 INFO L226 Difference]: Without dead ends: 1110 [2019-12-18 17:20:26,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:20:26,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2019-12-18 17:20:26,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 699. [2019-12-18 17:20:26,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2019-12-18 17:20:26,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1564 transitions. [2019-12-18 17:20:26,709 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 1564 transitions. Word has length 44 [2019-12-18 17:20:26,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:20:26,710 INFO L462 AbstractCegarLoop]: Abstraction has 699 states and 1564 transitions. [2019-12-18 17:20:26,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:20:26,710 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1564 transitions. [2019-12-18 17:20:26,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 17:20:26,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:20:26,712 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] [2019-12-18 17:20:26,712 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:20:26,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:20:26,712 INFO L82 PathProgramCache]: Analyzing trace with hash 170447017, now seen corresponding path program 3 times [2019-12-18 17:20:26,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:20:26,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948928174] [2019-12-18 17:20:26,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:20:26,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:20:26,940 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 17:20:26,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948928174] [2019-12-18 17:20:26,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:20:26,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 17:20:26,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952412536] [2019-12-18 17:20:26,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:20:26,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:20:26,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:20:26,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:20:26,943 INFO L87 Difference]: Start difference. First operand 699 states and 1564 transitions. Second operand 9 states. [2019-12-18 17:20:28,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:20:28,299 INFO L93 Difference]: Finished difference Result 1586 states and 3398 transitions. [2019-12-18 17:20:28,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 17:20:28,299 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2019-12-18 17:20:28,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:20:28,305 INFO L225 Difference]: With dead ends: 1586 [2019-12-18 17:20:28,306 INFO L226 Difference]: Without dead ends: 1586 [2019-12-18 17:20:28,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2019-12-18 17:20:28,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2019-12-18 17:20:28,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 889. [2019-12-18 17:20:28,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2019-12-18 17:20:28,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1963 transitions. [2019-12-18 17:20:28,335 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1963 transitions. Word has length 44 [2019-12-18 17:20:28,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:20:28,336 INFO L462 AbstractCegarLoop]: Abstraction has 889 states and 1963 transitions. [2019-12-18 17:20:28,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:20:28,336 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1963 transitions. [2019-12-18 17:20:28,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 17:20:28,338 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:20:28,338 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] [2019-12-18 17:20:28,339 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:20:28,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:20:28,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1420662497, now seen corresponding path program 4 times [2019-12-18 17:20:28,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:20:28,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465830075] [2019-12-18 17:20:28,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:20:28,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:20:28,454 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 17:20:28,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465830075] [2019-12-18 17:20:28,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:20:28,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 17:20:28,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960110526] [2019-12-18 17:20:28,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:20:28,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:20:28,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:20:28,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:20:28,456 INFO L87 Difference]: Start difference. First operand 889 states and 1963 transitions. Second operand 7 states. [2019-12-18 17:20:29,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:20:29,416 INFO L93 Difference]: Finished difference Result 2234 states and 4915 transitions. [2019-12-18 17:20:29,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 17:20:29,416 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2019-12-18 17:20:29,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:20:29,423 INFO L225 Difference]: With dead ends: 2234 [2019-12-18 17:20:29,423 INFO L226 Difference]: Without dead ends: 2203 [2019-12-18 17:20:29,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-12-18 17:20:29,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2203 states. [2019-12-18 17:20:29,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2203 to 1119. [2019-12-18 17:20:29,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2019-12-18 17:20:29,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 2576 transitions. [2019-12-18 17:20:29,458 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 2576 transitions. Word has length 44 [2019-12-18 17:20:29,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:20:29,459 INFO L462 AbstractCegarLoop]: Abstraction has 1119 states and 2576 transitions. [2019-12-18 17:20:29,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:20:29,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 2576 transitions. [2019-12-18 17:20:29,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 17:20:29,462 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:20:29,462 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] [2019-12-18 17:20:29,463 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:20:29,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:20:29,463 INFO L82 PathProgramCache]: Analyzing trace with hash -115488353, now seen corresponding path program 5 times [2019-12-18 17:20:29,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:20:29,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452853416] [2019-12-18 17:20:29,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:20:29,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:20:29,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:20:29,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452853416] [2019-12-18 17:20:29,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:20:29,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:20:29,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035070885] [2019-12-18 17:20:29,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:20:29,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:20:29,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:20:29,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:20:29,550 INFO L87 Difference]: Start difference. First operand 1119 states and 2576 transitions. Second operand 3 states. [2019-12-18 17:20:29,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:20:29,581 INFO L93 Difference]: Finished difference Result 1117 states and 2571 transitions. [2019-12-18 17:20:29,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:20:29,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-18 17:20:29,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:20:29,585 INFO L225 Difference]: With dead ends: 1117 [2019-12-18 17:20:29,588 INFO L226 Difference]: Without dead ends: 1117 [2019-12-18 17:20:29,588 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 17:20:29,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2019-12-18 17:20:29,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 985. [2019-12-18 17:20:29,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 985 states. [2019-12-18 17:20:29,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 2302 transitions. [2019-12-18 17:20:29,617 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 2302 transitions. Word has length 44 [2019-12-18 17:20:29,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:20:29,618 INFO L462 AbstractCegarLoop]: Abstraction has 985 states and 2302 transitions. [2019-12-18 17:20:29,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:20:29,618 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 2302 transitions. [2019-12-18 17:20:29,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-18 17:20:29,621 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:20:29,621 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] [2019-12-18 17:20:29,621 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:20:29,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:20:29,622 INFO L82 PathProgramCache]: Analyzing trace with hash 359561549, now seen corresponding path program 1 times [2019-12-18 17:20:29,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:20:29,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078752456] [2019-12-18 17:20:29,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:20:29,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:20:29,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:20:29,806 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:20:29,806 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:20:29,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_70| 0 0))) (and (= v_~x~0_55 0) (= 0 v_~weak$$choice0~0_10) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t1016~0.base_32|) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~a~0_52 0) (= 0 v_~y$r_buff1_thd3~0_90) (= |v_#NULL.offset_7| 0) (= |v_#valid_68| (store .cse0 |v_ULTIMATE.start_main_~#t1016~0.base_32| 1)) (= 0 v_~__unbuffered_p2_EAX~0_69) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff1_thd0~0_102 0) (= 0 v_~y$w_buff0~0_155) (< 0 |v_#StackHeapBarrier_16|) (= v_~__unbuffered_cnt~0_107 0) (= 0 v_~y$r_buff1_thd2~0_171) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1016~0.base_32|)) (= v_~y$r_buff0_thd1~0_39 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1016~0.base_32| 4)) (= |v_ULTIMATE.start_main_~#t1016~0.offset_22| 0) (= v_~main$tmp_guard0~0_20 0) (= 0 v_~y$r_buff0_thd2~0_208) (= 0 v_~y$flush_delayed~0_44) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$mem_tmp~0_17 0) (= 0 v_~y$r_buff1_thd1~0_40) (= 0 |v_#NULL.base_7|) (= v_~__unbuffered_p2_EBX~0_69 0) (= v_~y$w_buff1~0_114 0) (= v_~y$w_buff1_used~0_265 0) (= v_~y$r_buff0_thd0~0_92 0) (= v_~y~0_129 0) (= v_~y$w_buff0_used~0_415 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1016~0.base_32| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1016~0.base_32|) |v_ULTIMATE.start_main_~#t1016~0.offset_22| 0)) |v_#memory_int_17|) (= 0 v_~y$r_buff0_thd3~0_133) (= 0 v_~__unbuffered_p1_EAX~0_73) (= 0 v_~weak$$choice2~0_85) (= v_~z~0_39 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_17|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t1018~0.offset=|v_ULTIMATE.start_main_~#t1018~0.offset_15|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_52, ~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_90, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_73, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_39, ~y$flush_delayed~0=v_~y$flush_delayed~0_44, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_69, ULTIMATE.start_main_~#t1017~0.base=|v_ULTIMATE.start_main_~#t1017~0.base_33|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_69, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_33|, ULTIMATE.start_main_~#t1016~0.base=|v_ULTIMATE.start_main_~#t1016~0.base_32|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_~#t1016~0.offset=|v_ULTIMATE.start_main_~#t1016~0.offset_22|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_55|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_76|, ~y$w_buff1~0=v_~y$w_buff1~0_114, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_208, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_102, ~x~0=v_~x~0_55, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_415, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_8|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_40, ~y$w_buff0~0=v_~y$w_buff0~0_155, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_133, ~y~0=v_~y~0_129, ULTIMATE.start_main_~#t1017~0.offset=|v_ULTIMATE.start_main_~#t1017~0.offset_22|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_27|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_121|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_171, ULTIMATE.start_main_~#t1018~0.base=|v_ULTIMATE.start_main_~#t1018~0.base_26|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_92, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_39, ~weak$$choice2~0=v_~weak$$choice2~0_85, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_265} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, #NULL.offset, ULTIMATE.start_main_~#t1018~0.offset, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1017~0.base, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1016~0.base, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t1016~0.offset, ULTIMATE.start_main_#t~ite37, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t1017~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t1018~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 17:20:29,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L820-1-->L822: Formula: (and (= |v_ULTIMATE.start_main_~#t1017~0.offset_9| 0) (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t1017~0.base_11| 1) |v_#valid_32|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1017~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1017~0.base_11|) |v_ULTIMATE.start_main_~#t1017~0.offset_9| 1))) (not (= |v_ULTIMATE.start_main_~#t1017~0.base_11| 0)) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t1017~0.base_11|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1017~0.base_11|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1017~0.base_11| 4) |v_#length_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1017~0.base=|v_ULTIMATE.start_main_~#t1017~0.base_11|, ULTIMATE.start_main_~#t1017~0.offset=|v_ULTIMATE.start_main_~#t1017~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1017~0.base, ULTIMATE.start_main_~#t1017~0.offset] because there is no mapped edge [2019-12-18 17:20:29,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L822-1-->L824: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1018~0.base_10| 0)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1018~0.base_10|) (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1018~0.base_10|) 0) (= |v_ULTIMATE.start_main_~#t1018~0.offset_8| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1018~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1018~0.base_10|) |v_ULTIMATE.start_main_~#t1018~0.offset_8| 2)) |v_#memory_int_11|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1018~0.base_10| 1)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1018~0.base_10| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1018~0.offset=|v_ULTIMATE.start_main_~#t1018~0.offset_8|, ULTIMATE.start_main_~#t1018~0.base=|v_ULTIMATE.start_main_~#t1018~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1018~0.offset, ULTIMATE.start_main_~#t1018~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 17:20:29,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L4-->L797: Formula: (and (= 1 ~z~0_Out68850999) (= ~__unbuffered_p2_EAX~0_Out68850999 ~z~0_Out68850999) (= ~y$r_buff1_thd2~0_Out68850999 ~y$r_buff0_thd2~0_In68850999) (= ~y$r_buff0_thd1~0_In68850999 ~y$r_buff1_thd1~0_Out68850999) (not (= P2Thread1of1ForFork2___VERIFIER_assert_~expression_In68850999 0)) (= ~y$r_buff0_thd3~0_In68850999 ~y$r_buff1_thd3~0_Out68850999) (= 1 ~y$r_buff0_thd3~0_Out68850999) (= ~y$r_buff0_thd0~0_In68850999 ~y$r_buff1_thd0~0_Out68850999) (= ~__unbuffered_p2_EBX~0_Out68850999 ~a~0_In68850999)) InVars {~a~0=~a~0_In68850999, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In68850999, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In68850999, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In68850999, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In68850999, P2Thread1of1ForFork2___VERIFIER_assert_~expression=P2Thread1of1ForFork2___VERIFIER_assert_~expression_In68850999} OutVars{~__unbuffered_p2_EBX~0=~__unbuffered_p2_EBX~0_Out68850999, P2Thread1of1ForFork2___VERIFIER_assert_~expression=P2Thread1of1ForFork2___VERIFIER_assert_~expression_In68850999, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out68850999, ~a~0=~a~0_In68850999, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out68850999, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_Out68850999, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out68850999, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In68850999, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In68850999, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In68850999, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_Out68850999, ~z~0=~z~0_Out68850999, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out68850999} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p2_EBX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 17:20:29,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] P0ENTRY-->P0EXIT: Formula: (and (= v_~a~0_24 1) (= (+ v_~__unbuffered_cnt~0_81 1) v_~__unbuffered_cnt~0_80) (= v_P0Thread1of1ForFork0_~arg.base_15 |v_P0Thread1of1ForFork0_#in~arg.base_15|) (= |v_P0Thread1of1ForFork0_#res.base_11| 0) (= v_P0Thread1of1ForFork0_~arg.offset_15 |v_P0Thread1of1ForFork0_#in~arg.offset_15|) (= 0 |v_P0Thread1of1ForFork0_#res.offset_11|) (= v_~x~0_27 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81} OutVars{~a~0=v_~a~0_24, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_11|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_15, ~x~0=v_~x~0_27, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_15} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 17:20:29,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L756-->L756-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1300619801 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite8_Out1300619801| |P1Thread1of1ForFork1_#t~ite9_Out1300619801|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1300619801 256) 0))) (or (and (= 0 (mod ~y$r_buff1_thd2~0_In1300619801 256)) .cse0) (and (= (mod ~y$w_buff1_used~0_In1300619801 256) 0) .cse0) (= 0 (mod ~y$w_buff0_used~0_In1300619801 256)))) (= ~y$w_buff0~0_In1300619801 |P1Thread1of1ForFork1_#t~ite8_Out1300619801|) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite8_In1300619801| |P1Thread1of1ForFork1_#t~ite8_Out1300619801|) (not .cse1) (= ~y$w_buff0~0_In1300619801 |P1Thread1of1ForFork1_#t~ite9_Out1300619801|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1300619801, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1300619801, ~y$w_buff0~0=~y$w_buff0~0_In1300619801, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1300619801, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In1300619801|, ~weak$$choice2~0=~weak$$choice2~0_In1300619801, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1300619801} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1300619801, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1300619801, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1300619801|, ~y$w_buff0~0=~y$w_buff0~0_In1300619801, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1300619801, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out1300619801|, ~weak$$choice2~0=~weak$$choice2~0_In1300619801, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1300619801} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 17:20:29,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L757-->L757-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In2000982036 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_In2000982036| |P1Thread1of1ForFork1_#t~ite11_Out2000982036|) (not .cse0) (= ~y$w_buff1~0_In2000982036 |P1Thread1of1ForFork1_#t~ite12_Out2000982036|)) (and (= ~y$w_buff1~0_In2000982036 |P1Thread1of1ForFork1_#t~ite11_Out2000982036|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In2000982036 256) 0))) (or (and (= (mod ~y$r_buff1_thd2~0_In2000982036 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In2000982036 256)) (and (= 0 (mod ~y$w_buff1_used~0_In2000982036 256)) .cse1))) .cse0 (= |P1Thread1of1ForFork1_#t~ite11_Out2000982036| |P1Thread1of1ForFork1_#t~ite12_Out2000982036|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2000982036, ~y$w_buff1~0=~y$w_buff1~0_In2000982036, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2000982036, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2000982036, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_In2000982036|, ~weak$$choice2~0=~weak$$choice2~0_In2000982036, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2000982036} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2000982036, ~y$w_buff1~0=~y$w_buff1~0_In2000982036, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2000982036, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2000982036, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out2000982036|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out2000982036|, ~weak$$choice2~0=~weak$$choice2~0_In2000982036, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2000982036} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 17:20:29,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L758-->L758-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-2139964999 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out-2139964999| ~y$w_buff0_used~0_In-2139964999) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-2139964999 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-2139964999 256)) .cse0) (= (mod ~y$w_buff0_used~0_In-2139964999 256) 0) (and (= 0 (mod ~y$r_buff1_thd2~0_In-2139964999 256)) .cse0))) (= |P1Thread1of1ForFork1_#t~ite15_Out-2139964999| |P1Thread1of1ForFork1_#t~ite14_Out-2139964999|) .cse1) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite15_Out-2139964999| ~y$w_buff0_used~0_In-2139964999) (= |P1Thread1of1ForFork1_#t~ite14_In-2139964999| |P1Thread1of1ForFork1_#t~ite14_Out-2139964999|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2139964999, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2139964999, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2139964999, ~weak$$choice2~0=~weak$$choice2~0_In-2139964999, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-2139964999|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2139964999} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2139964999, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2139964999, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2139964999, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-2139964999|, ~weak$$choice2~0=~weak$$choice2~0_In-2139964999, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-2139964999|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2139964999} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 17:20:29,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L760-->L761: Formula: (and (not (= (mod v_~weak$$choice2~0_35 256) 0)) (= v_~y$r_buff0_thd2~0_104 v_~y$r_buff0_thd2~0_103)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_104, ~weak$$choice2~0=v_~weak$$choice2~0_35} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_15|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_12|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_103, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_8|, ~weak$$choice2~0=v_~weak$$choice2~0_35} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 17:20:29,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L763-->L771: Formula: (and (= 0 v_~y$flush_delayed~0_14) (= v_~y~0_36 v_~y$mem_tmp~0_7) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (not (= 0 (mod v_~y$flush_delayed~0_15 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, ~y~0=v_~y~0_36, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_19|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-18 17:20:29,822 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-951463160 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-951463160 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite28_Out-951463160|) (not .cse1)) (and (= ~y$w_buff0_used~0_In-951463160 |P2Thread1of1ForFork2_#t~ite28_Out-951463160|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-951463160, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-951463160} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-951463160, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-951463160, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out-951463160|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-18 17:20:29,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L799-->L799-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd3~0_In-498282275 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-498282275 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-498282275 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-498282275 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite29_Out-498282275| ~y$w_buff1_used~0_In-498282275) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite29_Out-498282275| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-498282275, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-498282275, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-498282275, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-498282275} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-498282275, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-498282275, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-498282275, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-498282275|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-498282275} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-18 17:20:29,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L800-->L801: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1887974102 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1887974102 256)))) (or (and (not .cse0) (= 0 ~y$r_buff0_thd3~0_Out-1887974102) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In-1887974102 ~y$r_buff0_thd3~0_Out-1887974102)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1887974102, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1887974102} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1887974102, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-1887974102|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1887974102} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 17:20:29,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L801-->L801-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In1251891273 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd3~0_In1251891273 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd3~0_In1251891273 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In1251891273 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In1251891273 |P2Thread1of1ForFork2_#t~ite31_Out1251891273|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P2Thread1of1ForFork2_#t~ite31_Out1251891273|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1251891273, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1251891273, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1251891273, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1251891273} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1251891273, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1251891273, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out1251891273|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1251891273, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1251891273} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-18 17:20:29,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite31_32| v_~y$r_buff1_thd3~0_47)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_47, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_31|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 17:20:29,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L824-1-->L830: Formula: (and (= v_~main$tmp_guard0~0_9 1) (= 3 v_~__unbuffered_cnt~0_36)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 17:20:29,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L830-2-->L830-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In641527442 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In641527442 256) 0))) (or (and (or .cse0 .cse1) (= ~y~0_In641527442 |ULTIMATE.start_main_#t~ite35_Out641527442|)) (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In641527442 |ULTIMATE.start_main_#t~ite35_Out641527442|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In641527442, ~y~0=~y~0_In641527442, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In641527442, ~y$w_buff1_used~0=~y$w_buff1_used~0_In641527442} OutVars{~y$w_buff1~0=~y$w_buff1~0_In641527442, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out641527442|, ~y~0=~y~0_In641527442, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In641527442, ~y$w_buff1_used~0=~y$w_buff1_used~0_In641527442} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-18 17:20:29,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L830-4-->L831: Formula: (= v_~y~0_23 |v_ULTIMATE.start_main_#t~ite35_11|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_11|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_10|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_6|, ~y~0=v_~y~0_23} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-12-18 17:20:29,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L831-->L831-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-438748973 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-438748973 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite37_Out-438748973| 0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-438748973 |ULTIMATE.start_main_#t~ite37_Out-438748973|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-438748973, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-438748973} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-438748973, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-438748973, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-438748973|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 17:20:29,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L832-->L832-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1829988438 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1829988438 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1829988438 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In1829988438 256)))) (or (and (= ~y$w_buff1_used~0_In1829988438 |ULTIMATE.start_main_#t~ite38_Out1829988438|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite38_Out1829988438| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1829988438, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1829988438, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1829988438, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1829988438} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1829988438, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1829988438, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1829988438|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1829988438, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1829988438} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 17:20:29,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L833-->L833-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1497831547 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1497831547 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out-1497831547| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite39_Out-1497831547| ~y$r_buff0_thd0~0_In-1497831547)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1497831547, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1497831547} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1497831547, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1497831547|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1497831547} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 17:20:29,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L834-->L834-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-1780266392 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1780266392 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-1780266392 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1780266392 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In-1780266392 |ULTIMATE.start_main_#t~ite40_Out-1780266392|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite40_Out-1780266392|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1780266392, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1780266392, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1780266392, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1780266392} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1780266392|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1780266392, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1780266392, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1780266392, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1780266392} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 17:20:29,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_20 0) (= v_~__unbuffered_p2_EBX~0_41 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_20 256)) (= 0 v_~__unbuffered_p1_EAX~0_44) (= |v_ULTIMATE.start_main_#t~ite40_43| v_~y$r_buff1_thd0~0_72) (= 1 v_~__unbuffered_p2_EAX~0_41) (= v_~x~0_34 2)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_41, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_43|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~x~0=v_~x~0_34} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_41, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_42|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~x~0=v_~x~0_34, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_72, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 17:20:29,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:20:29 BasicIcfg [2019-12-18 17:20:29,926 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:20:29,928 INFO L168 Benchmark]: Toolchain (without parser) took 15551.14 ms. Allocated memory was 145.2 MB in the beginning and 586.7 MB in the end (delta: 441.5 MB). Free memory was 100.4 MB in the beginning and 171.0 MB in the end (delta: -70.6 MB). Peak memory consumption was 370.8 MB. Max. memory is 7.1 GB. [2019-12-18 17:20:29,929 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 17:20:29,929 INFO L168 Benchmark]: CACSL2BoogieTranslator took 781.64 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 99.9 MB in the beginning and 157.4 MB in the end (delta: -57.4 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. [2019-12-18 17:20:29,930 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.72 ms. Allocated memory is still 202.4 MB. Free memory was 157.4 MB in the beginning and 154.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 17:20:29,931 INFO L168 Benchmark]: Boogie Preprocessor took 42.69 ms. Allocated memory is still 202.4 MB. Free memory was 154.6 MB in the beginning and 152.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 17:20:29,932 INFO L168 Benchmark]: RCFGBuilder took 791.81 ms. Allocated memory is still 202.4 MB. Free memory was 152.6 MB in the beginning and 108.9 MB in the end (delta: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 7.1 GB. [2019-12-18 17:20:29,932 INFO L168 Benchmark]: TraceAbstraction took 13854.66 ms. Allocated memory was 202.4 MB in the beginning and 586.7 MB in the end (delta: 384.3 MB). Free memory was 108.9 MB in the beginning and 171.0 MB in the end (delta: -62.0 MB). Peak memory consumption was 322.3 MB. Max. memory is 7.1 GB. [2019-12-18 17:20:29,937 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.23 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 781.64 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 99.9 MB in the beginning and 157.4 MB in the end (delta: -57.4 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.72 ms. Allocated memory is still 202.4 MB. Free memory was 157.4 MB in the beginning and 154.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.69 ms. Allocated memory is still 202.4 MB. Free memory was 154.6 MB in the beginning and 152.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 791.81 ms. Allocated memory is still 202.4 MB. Free memory was 152.6 MB in the beginning and 108.9 MB in the end (delta: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13854.66 ms. Allocated memory was 202.4 MB in the beginning and 586.7 MB in the end (delta: 384.3 MB). Free memory was 108.9 MB in the beginning and 171.0 MB in the end (delta: -62.0 MB). Peak memory consumption was 322.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.1s, 153 ProgramPointsBefore, 73 ProgramPointsAfterwards, 178 TransitionsBefore, 80 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 22 ChoiceCompositions, 4873 VarBasedMoverChecksPositive, 141 VarBasedMoverChecksNegative, 15 SemBasedMoverChecksPositive, 158 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 0 MoverChecksTotal, 41572 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t1016, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L822] FCALL, FORK 0 pthread_create(&t1017, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L824] FCALL, FORK 0 pthread_create(&t1018, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 1 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L797] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 2 x = 2 [L751] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 2 y$flush_delayed = weak$$choice2 [L754] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 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) [L756] 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)) [L757] 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)) [L758] 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)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 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)) [L761] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, 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))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L761] 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)) [L762] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L798] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L799] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L830] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L832] 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 [L833] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 144 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.5s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1293 SDtfs, 1393 SDslu, 2793 SDs, 0 SdLazy, 1919 SolverSat, 132 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 15 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13626occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 10 MinimizatonAttempts, 2544 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 344 NumberOfCodeBlocks, 344 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 289 ConstructedInterpolants, 0 QuantifiedInterpolants, 40332 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...