/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/mix035_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:14:55,254 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:14:55,257 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:14:55,276 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:14:55,276 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:14:55,278 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:14:55,280 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:14:55,282 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:14:55,284 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:14:55,285 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:14:55,286 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:14:55,287 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:14:55,287 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:14:55,288 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:14:55,289 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:14:55,290 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:14:55,291 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:14:55,292 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:14:55,293 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:14:55,295 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:14:55,297 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:14:55,298 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:14:55,299 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:14:55,300 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:14:55,302 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:14:55,302 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:14:55,302 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:14:55,303 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:14:55,303 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:14:55,304 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:14:55,304 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:14:55,305 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:14:55,306 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:14:55,307 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:14:55,308 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:14:55,308 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:14:55,308 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:14:55,309 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:14:55,309 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:14:55,310 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:14:55,310 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:14:55,311 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:14:55,325 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:14:55,325 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:14:55,327 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:14:55,327 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:14:55,327 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:14:55,327 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:14:55,327 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:14:55,328 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:14:55,328 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:14:55,328 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:14:55,328 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:14:55,328 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:14:55,329 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:14:55,329 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:14:55,329 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:14:55,329 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:14:55,329 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:14:55,330 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:14:55,330 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:14:55,330 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:14:55,330 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:14:55,330 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:14:55,331 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:14:55,331 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:14:55,331 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:14:55,331 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:14:55,331 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:14:55,332 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:14:55,332 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:14:55,604 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:14:55,621 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:14:55,625 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:14:55,626 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:14:55,627 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:14:55,628 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_tso.opt.i [2019-12-18 17:14:55,700 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6c94d791/2347cafccf0040f080a2e5726d86cce9/FLAGd04490a75 [2019-12-18 17:14:56,284 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:14:56,286 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_tso.opt.i [2019-12-18 17:14:56,306 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6c94d791/2347cafccf0040f080a2e5726d86cce9/FLAGd04490a75 [2019-12-18 17:14:56,544 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6c94d791/2347cafccf0040f080a2e5726d86cce9 [2019-12-18 17:14:56,551 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:14:56,553 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:14:56,554 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:14:56,555 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:14:56,558 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:14:56,559 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:14:56" (1/1) ... [2019-12-18 17:14:56,562 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73e76b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:14:56, skipping insertion in model container [2019-12-18 17:14:56,562 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:14:56" (1/1) ... [2019-12-18 17:14:56,570 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:14:56,635 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:14:57,157 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:14:57,169 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:14:57,226 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:14:57,306 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:14:57,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:14:57 WrapperNode [2019-12-18 17:14:57,307 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:14:57,308 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:14:57,308 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:14:57,308 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:14:57,317 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:14:57" (1/1) ... [2019-12-18 17:14:57,336 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:14:57" (1/1) ... [2019-12-18 17:14:57,374 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:14:57,375 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:14:57,375 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:14:57,375 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:14:57,384 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:14:57" (1/1) ... [2019-12-18 17:14:57,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:14:57" (1/1) ... [2019-12-18 17:14:57,389 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:14:57" (1/1) ... [2019-12-18 17:14:57,389 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:14:57" (1/1) ... [2019-12-18 17:14:57,399 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:14:57" (1/1) ... [2019-12-18 17:14:57,403 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:14:57" (1/1) ... [2019-12-18 17:14:57,406 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:14:57" (1/1) ... [2019-12-18 17:14:57,411 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:14:57,411 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:14:57,411 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:14:57,411 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:14:57,412 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:14:57" (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:14:57,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:14:57,494 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:14:57,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:14:57,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:14:57,495 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:14:57,495 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:14:57,496 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:14:57,496 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:14:57,496 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 17:14:57,496 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 17:14:57,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:14:57,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:14:57,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:14:57,499 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:14:58,179 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:14:58,179 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:14:58,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:14:58 BoogieIcfgContainer [2019-12-18 17:14:58,181 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:14:58,182 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:14:58,183 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:14:58,187 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:14:58,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:14:56" (1/3) ... [2019-12-18 17:14:58,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27a8f99b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:14:58, skipping insertion in model container [2019-12-18 17:14:58,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:14:57" (2/3) ... [2019-12-18 17:14:58,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27a8f99b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:14:58, skipping insertion in model container [2019-12-18 17:14:58,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:14:58" (3/3) ... [2019-12-18 17:14:58,193 INFO L109 eAbstractionObserver]: Analyzing ICFG mix035_tso.opt.i [2019-12-18 17:14:58,204 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:14:58,205 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:14:58,225 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:14:58,226 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:14:58,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,268 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,268 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,270 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,270 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,295 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,295 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,295 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,296 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,296 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,307 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,307 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,326 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,329 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,332 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,333 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,333 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:14:58,349 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 17:14:58,369 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:14:58,369 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:14:58,369 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:14:58,369 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:14:58,370 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:14:58,370 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:14:58,370 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:14:58,370 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:14:58,386 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 179 transitions [2019-12-18 17:14:58,388 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 154 places, 179 transitions [2019-12-18 17:14:58,463 INFO L126 PetriNetUnfolder]: 35/176 cut-off events. [2019-12-18 17:14:58,463 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:14:58,482 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 176 events. 35/176 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 358 event pairs. 9/148 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-18 17:14:58,501 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 154 places, 179 transitions [2019-12-18 17:14:58,575 INFO L126 PetriNetUnfolder]: 35/176 cut-off events. [2019-12-18 17:14:58,576 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:14:58,583 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 176 events. 35/176 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 358 event pairs. 9/148 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-18 17:14:58,600 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-12-18 17:14:58,601 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:15:03,844 WARN L192 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 17:15:03,963 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 17:15:03,996 INFO L206 etLargeBlockEncoding]: Checked pairs total: 44280 [2019-12-18 17:15:03,996 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-18 17:15:03,999 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 71 places, 79 transitions [2019-12-18 17:15:04,825 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 12302 states. [2019-12-18 17:15:04,827 INFO L276 IsEmpty]: Start isEmpty. Operand 12302 states. [2019-12-18 17:15:04,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 17:15:04,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:15:04,835 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:15:04,836 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:15:04,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:15:04,842 INFO L82 PathProgramCache]: Analyzing trace with hash -941376449, now seen corresponding path program 1 times [2019-12-18 17:15:04,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:15:04,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280449010] [2019-12-18 17:15:04,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:15:04,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:15:05,073 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:15:05,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280449010] [2019-12-18 17:15:05,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:15:05,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:15:05,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539728631] [2019-12-18 17:15:05,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:15:05,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:15:05,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:15:05,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:15:05,098 INFO L87 Difference]: Start difference. First operand 12302 states. Second operand 3 states. [2019-12-18 17:15:05,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:15:05,352 INFO L93 Difference]: Finished difference Result 11966 states and 45788 transitions. [2019-12-18 17:15:05,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:15:05,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 17:15:05,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:15:05,487 INFO L225 Difference]: With dead ends: 11966 [2019-12-18 17:15:05,487 INFO L226 Difference]: Without dead ends: 11270 [2019-12-18 17:15:05,489 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:15:05,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11270 states. [2019-12-18 17:15:06,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11270 to 11270. [2019-12-18 17:15:06,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11270 states. [2019-12-18 17:15:06,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11270 states to 11270 states and 43054 transitions. [2019-12-18 17:15:06,163 INFO L78 Accepts]: Start accepts. Automaton has 11270 states and 43054 transitions. Word has length 7 [2019-12-18 17:15:06,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:15:06,164 INFO L462 AbstractCegarLoop]: Abstraction has 11270 states and 43054 transitions. [2019-12-18 17:15:06,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:15:06,165 INFO L276 IsEmpty]: Start isEmpty. Operand 11270 states and 43054 transitions. [2019-12-18 17:15:06,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 17:15:06,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:15:06,170 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:15:06,171 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:15:06,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:15:06,171 INFO L82 PathProgramCache]: Analyzing trace with hash -941453907, now seen corresponding path program 1 times [2019-12-18 17:15:06,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:15:06,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770473657] [2019-12-18 17:15:06,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:15:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:15:06,267 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:15:06,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770473657] [2019-12-18 17:15:06,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:15:06,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:15:06,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507737778] [2019-12-18 17:15:06,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:15:06,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:15:06,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:15:06,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:15:06,270 INFO L87 Difference]: Start difference. First operand 11270 states and 43054 transitions. Second operand 3 states. [2019-12-18 17:15:06,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:15:06,378 INFO L93 Difference]: Finished difference Result 6790 states and 22693 transitions. [2019-12-18 17:15:06,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:15:06,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 17:15:06,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:15:06,419 INFO L225 Difference]: With dead ends: 6790 [2019-12-18 17:15:06,419 INFO L226 Difference]: Without dead ends: 6790 [2019-12-18 17:15:06,420 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:15:06,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6790 states. [2019-12-18 17:15:06,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6790 to 6790. [2019-12-18 17:15:06,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6790 states. [2019-12-18 17:15:06,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6790 states to 6790 states and 22693 transitions. [2019-12-18 17:15:06,733 INFO L78 Accepts]: Start accepts. Automaton has 6790 states and 22693 transitions. Word has length 13 [2019-12-18 17:15:06,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:15:06,734 INFO L462 AbstractCegarLoop]: Abstraction has 6790 states and 22693 transitions. [2019-12-18 17:15:06,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:15:06,734 INFO L276 IsEmpty]: Start isEmpty. Operand 6790 states and 22693 transitions. [2019-12-18 17:15:06,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 17:15:06,736 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:15:06,737 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:15:06,737 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:15:06,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:15:06,737 INFO L82 PathProgramCache]: Analyzing trace with hash 369435328, now seen corresponding path program 1 times [2019-12-18 17:15:06,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:15:06,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905699304] [2019-12-18 17:15:06,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:15:06,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:15:06,801 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:15:06,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905699304] [2019-12-18 17:15:06,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:15:06,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:15:06,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112171893] [2019-12-18 17:15:06,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:15:06,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:15:06,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:15:06,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:15:06,804 INFO L87 Difference]: Start difference. First operand 6790 states and 22693 transitions. Second operand 4 states. [2019-12-18 17:15:06,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:15:06,850 INFO L93 Difference]: Finished difference Result 1617 states and 4342 transitions. [2019-12-18 17:15:06,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:15:06,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 17:15:06,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:15:06,857 INFO L225 Difference]: With dead ends: 1617 [2019-12-18 17:15:06,857 INFO L226 Difference]: Without dead ends: 1617 [2019-12-18 17:15:06,857 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:15:06,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2019-12-18 17:15:06,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1617. [2019-12-18 17:15:06,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1617 states. [2019-12-18 17:15:06,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 4342 transitions. [2019-12-18 17:15:06,903 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 4342 transitions. Word has length 14 [2019-12-18 17:15:06,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:15:06,903 INFO L462 AbstractCegarLoop]: Abstraction has 1617 states and 4342 transitions. [2019-12-18 17:15:06,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:15:06,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 4342 transitions. [2019-12-18 17:15:06,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 17:15:06,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:15:06,905 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:15:06,905 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:15:06,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:15:06,906 INFO L82 PathProgramCache]: Analyzing trace with hash 166730424, now seen corresponding path program 1 times [2019-12-18 17:15:06,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:15:06,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478518924] [2019-12-18 17:15:06,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:15:06,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:15:06,952 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:15:06,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478518924] [2019-12-18 17:15:06,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:15:06,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:15:06,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66586456] [2019-12-18 17:15:06,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:15:06,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:15:06,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:15:06,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:15:06,957 INFO L87 Difference]: Start difference. First operand 1617 states and 4342 transitions. Second operand 3 states. [2019-12-18 17:15:07,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:15:07,080 INFO L93 Difference]: Finished difference Result 2388 states and 6272 transitions. [2019-12-18 17:15:07,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:15:07,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 17:15:07,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:15:07,087 INFO L225 Difference]: With dead ends: 2388 [2019-12-18 17:15:07,087 INFO L226 Difference]: Without dead ends: 2388 [2019-12-18 17:15:07,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:15:07,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2388 states. [2019-12-18 17:15:07,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2388 to 1795. [2019-12-18 17:15:07,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1795 states. [2019-12-18 17:15:07,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 4765 transitions. [2019-12-18 17:15:07,140 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 4765 transitions. Word has length 16 [2019-12-18 17:15:07,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:15:07,141 INFO L462 AbstractCegarLoop]: Abstraction has 1795 states and 4765 transitions. [2019-12-18 17:15:07,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:15:07,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 4765 transitions. [2019-12-18 17:15:07,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 17:15:07,143 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:15:07,143 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:15:07,143 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:15:07,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:15:07,144 INFO L82 PathProgramCache]: Analyzing trace with hash 166596039, now seen corresponding path program 1 times [2019-12-18 17:15:07,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:15:07,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346065294] [2019-12-18 17:15:07,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:15:07,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:15:07,204 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:15:07,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346065294] [2019-12-18 17:15:07,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:15:07,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:15:07,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614682347] [2019-12-18 17:15:07,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:15:07,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:15:07,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:15:07,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:15:07,207 INFO L87 Difference]: Start difference. First operand 1795 states and 4765 transitions. Second operand 4 states. [2019-12-18 17:15:07,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:15:07,389 INFO L93 Difference]: Finished difference Result 2341 states and 6074 transitions. [2019-12-18 17:15:07,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:15:07,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 17:15:07,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:15:07,396 INFO L225 Difference]: With dead ends: 2341 [2019-12-18 17:15:07,396 INFO L226 Difference]: Without dead ends: 2341 [2019-12-18 17:15:07,397 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:15:07,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2341 states. [2019-12-18 17:15:07,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2341 to 2141. [2019-12-18 17:15:07,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2141 states. [2019-12-18 17:15:07,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2141 states to 2141 states and 5644 transitions. [2019-12-18 17:15:07,455 INFO L78 Accepts]: Start accepts. Automaton has 2141 states and 5644 transitions. Word has length 16 [2019-12-18 17:15:07,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:15:07,456 INFO L462 AbstractCegarLoop]: Abstraction has 2141 states and 5644 transitions. [2019-12-18 17:15:07,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:15:07,456 INFO L276 IsEmpty]: Start isEmpty. Operand 2141 states and 5644 transitions. [2019-12-18 17:15:07,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 17:15:07,457 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:15:07,457 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:15:07,457 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:15:07,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:15:07,458 INFO L82 PathProgramCache]: Analyzing trace with hash 289916209, now seen corresponding path program 1 times [2019-12-18 17:15:07,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:15:07,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308734863] [2019-12-18 17:15:07,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:15:07,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:15:07,505 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:15:07,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308734863] [2019-12-18 17:15:07,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:15:07,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:15:07,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069660844] [2019-12-18 17:15:07,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:15:07,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:15:07,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:15:07,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:15:07,508 INFO L87 Difference]: Start difference. First operand 2141 states and 5644 transitions. Second operand 4 states. [2019-12-18 17:15:07,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:15:07,669 INFO L93 Difference]: Finished difference Result 2723 states and 7055 transitions. [2019-12-18 17:15:07,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:15:07,670 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 17:15:07,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:15:07,676 INFO L225 Difference]: With dead ends: 2723 [2019-12-18 17:15:07,677 INFO L226 Difference]: Without dead ends: 2723 [2019-12-18 17:15:07,677 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:15:07,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2723 states. [2019-12-18 17:15:07,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2723 to 2242. [2019-12-18 17:15:07,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2242 states. [2019-12-18 17:15:07,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 5899 transitions. [2019-12-18 17:15:07,751 INFO L78 Accepts]: Start accepts. Automaton has 2242 states and 5899 transitions. Word has length 16 [2019-12-18 17:15:07,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:15:07,752 INFO L462 AbstractCegarLoop]: Abstraction has 2242 states and 5899 transitions. [2019-12-18 17:15:07,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:15:07,752 INFO L276 IsEmpty]: Start isEmpty. Operand 2242 states and 5899 transitions. [2019-12-18 17:15:07,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 17:15:07,757 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:15:07,757 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:15:07,758 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:15:07,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:15:07,758 INFO L82 PathProgramCache]: Analyzing trace with hash -45017831, now seen corresponding path program 1 times [2019-12-18 17:15:07,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:15:07,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995748378] [2019-12-18 17:15:07,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:15:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:15:07,875 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:15:07,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995748378] [2019-12-18 17:15:07,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:15:07,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:15:07,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985526732] [2019-12-18 17:15:07,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:15:07,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:15:07,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:15:07,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:15:07,878 INFO L87 Difference]: Start difference. First operand 2242 states and 5899 transitions. Second operand 5 states. [2019-12-18 17:15:07,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:15:07,925 INFO L93 Difference]: Finished difference Result 1366 states and 3668 transitions. [2019-12-18 17:15:07,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:15:07,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-18 17:15:07,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:15:07,930 INFO L225 Difference]: With dead ends: 1366 [2019-12-18 17:15:07,930 INFO L226 Difference]: Without dead ends: 1366 [2019-12-18 17:15:07,931 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:15:07,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2019-12-18 17:15:07,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1282. [2019-12-18 17:15:07,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1282 states. [2019-12-18 17:15:07,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 3460 transitions. [2019-12-18 17:15:07,965 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 3460 transitions. Word has length 29 [2019-12-18 17:15:07,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:15:07,966 INFO L462 AbstractCegarLoop]: Abstraction has 1282 states and 3460 transitions. [2019-12-18 17:15:07,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:15:07,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 3460 transitions. [2019-12-18 17:15:07,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 17:15:07,972 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:15:07,972 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:15:07,972 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:15:07,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:15:07,973 INFO L82 PathProgramCache]: Analyzing trace with hash -651252201, now seen corresponding path program 1 times [2019-12-18 17:15:07,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:15:07,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769284351] [2019-12-18 17:15:07,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:15:08,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:15:08,098 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:15:08,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769284351] [2019-12-18 17:15:08,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:15:08,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:15:08,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587798652] [2019-12-18 17:15:08,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:15:08,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:15:08,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:15:08,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:15:08,100 INFO L87 Difference]: Start difference. First operand 1282 states and 3460 transitions. Second operand 4 states. [2019-12-18 17:15:08,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:15:08,125 INFO L93 Difference]: Finished difference Result 1917 states and 4864 transitions. [2019-12-18 17:15:08,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:15:08,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-12-18 17:15:08,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:15:08,128 INFO L225 Difference]: With dead ends: 1917 [2019-12-18 17:15:08,128 INFO L226 Difference]: Without dead ends: 673 [2019-12-18 17:15:08,128 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:15:08,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2019-12-18 17:15:08,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 673. [2019-12-18 17:15:08,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2019-12-18 17:15:08,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 1475 transitions. [2019-12-18 17:15:08,143 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 1475 transitions. Word has length 44 [2019-12-18 17:15:08,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:15:08,145 INFO L462 AbstractCegarLoop]: Abstraction has 673 states and 1475 transitions. [2019-12-18 17:15:08,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:15:08,145 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 1475 transitions. [2019-12-18 17:15:08,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 17:15:08,150 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:15:08,150 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:15:08,151 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:15:08,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:15:08,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1022585143, now seen corresponding path program 2 times [2019-12-18 17:15:08,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:15:08,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049734520] [2019-12-18 17:15:08,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:15:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:15:08,226 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:15:08,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049734520] [2019-12-18 17:15:08,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:15:08,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:15:08,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851934833] [2019-12-18 17:15:08,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:15:08,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:15:08,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:15:08,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:15:08,228 INFO L87 Difference]: Start difference. First operand 673 states and 1475 transitions. Second operand 4 states. [2019-12-18 17:15:08,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:15:08,249 INFO L93 Difference]: Finished difference Result 1060 states and 2349 transitions. [2019-12-18 17:15:08,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:15:08,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-12-18 17:15:08,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:15:08,251 INFO L225 Difference]: With dead ends: 1060 [2019-12-18 17:15:08,251 INFO L226 Difference]: Without dead ends: 408 [2019-12-18 17:15:08,252 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:15:08,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-12-18 17:15:08,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2019-12-18 17:15:08,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-12-18 17:15:08,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 907 transitions. [2019-12-18 17:15:08,261 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 907 transitions. Word has length 44 [2019-12-18 17:15:08,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:15:08,262 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 907 transitions. [2019-12-18 17:15:08,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:15:08,262 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 907 transitions. [2019-12-18 17:15:08,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 17:15:08,263 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:15:08,264 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:15:08,264 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:15:08,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:15:08,264 INFO L82 PathProgramCache]: Analyzing trace with hash -891161673, now seen corresponding path program 3 times [2019-12-18 17:15:08,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:15:08,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424569546] [2019-12-18 17:15:08,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:15:08,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:15:08,489 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:15:08,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424569546] [2019-12-18 17:15:08,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:15:08,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:15:08,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13720069] [2019-12-18 17:15:08,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:15:08,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:15:08,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:15:08,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:15:08,491 INFO L87 Difference]: Start difference. First operand 408 states and 907 transitions. Second operand 3 states. [2019-12-18 17:15:08,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:15:08,514 INFO L93 Difference]: Finished difference Result 406 states and 902 transitions. [2019-12-18 17:15:08,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:15:08,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-18 17:15:08,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:15:08,516 INFO L225 Difference]: With dead ends: 406 [2019-12-18 17:15:08,516 INFO L226 Difference]: Without dead ends: 406 [2019-12-18 17:15:08,516 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:15:08,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-12-18 17:15:08,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2019-12-18 17:15:08,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-12-18 17:15:08,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 902 transitions. [2019-12-18 17:15:08,525 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 902 transitions. Word has length 44 [2019-12-18 17:15:08,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:15:08,525 INFO L462 AbstractCegarLoop]: Abstraction has 406 states and 902 transitions. [2019-12-18 17:15:08,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:15:08,526 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 902 transitions. [2019-12-18 17:15:08,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-18 17:15:08,528 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:15:08,528 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:15:08,528 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:15:08,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:15:08,529 INFO L82 PathProgramCache]: Analyzing trace with hash -252375621, now seen corresponding path program 1 times [2019-12-18 17:15:08,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:15:08,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495959380] [2019-12-18 17:15:08,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:15:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:15:08,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:15:08,732 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:15:08,733 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:15:08,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_76| 0 0))) (and (= 0 v_~weak$$choice0~0_10) (= v_~y$w_buff1~0_255 0) (= 0 v_~y$w_buff0~0_383) (= v_~a~0_43 0) (= v_~y$r_buff0_thd1~0_30 0) (= 0 v_~y$read_delayed_var~0.offset_8) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t934~0.base_38|)) (= v_~y$w_buff0_used~0_658 0) (= 0 v_~__unbuffered_p0_EAX~0_49) (= v_~z~0_82 0) (= v_~y$read_delayed~0_8 0) (= v_~x~0_24 0) (= v_~weak$$choice2~0_156 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t934~0.base_38| 4)) (= v_~__unbuffered_cnt~0_101 0) (= 0 v_~y$r_buff1_thd2~0_256) (= v_~y$w_buff1_used~0_429 0) (= 0 v_~y$r_buff0_thd3~0_155) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~y$flush_delayed~0_35) (= 0 |v_#NULL.base_4|) (= v_~main$tmp_guard0~0_20 0) (= 0 v_~__unbuffered_p1_EAX~0_63) (= 0 v_~__unbuffered_p2_EAX~0_107) (= (store .cse0 |v_ULTIMATE.start_main_~#t934~0.base_38| 1) |v_#valid_74|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t934~0.base_38| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t934~0.base_38|) |v_ULTIMATE.start_main_~#t934~0.offset_26| 0)) |v_#memory_int_17|) (= v_~y$mem_tmp~0_12 0) (= v_~y~0_134 0) (= |v_#NULL.offset_4| 0) (= 0 v_~y$read_delayed_var~0.base_8) (= |v_ULTIMATE.start_main_~#t934~0.offset_26| 0) (= 0 v_~y$r_buff0_thd2~0_301) (= v_~y$r_buff1_thd0~0_160 0) (= v_~__unbuffered_p2_EBX~0_107 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t934~0.base_38|) (= 0 v_~y$r_buff1_thd1~0_80) (= 0 v_~y$r_buff1_thd3~0_129) (= v_~y$r_buff0_thd0~0_90 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_18|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_20|, #NULL.offset=|v_#NULL.offset_4|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~a~0=v_~a~0_43, ULTIMATE.start_main_~#t935~0.base=|v_ULTIMATE.start_main_~#t935~0.base_40|, ~y$mem_tmp~0=v_~y$mem_tmp~0_12, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_49, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_129, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_63, ULTIMATE.start_main_~#t936~0.offset=|v_ULTIMATE.start_main_~#t936~0.offset_19|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_30, ~y$flush_delayed~0=v_~y$flush_delayed~0_35, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_107, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_107, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_32|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_68|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_34|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_79|, ~y$w_buff1~0=v_~y$w_buff1~0_255, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_301, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_160, ~x~0=v_~x~0_24, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_658, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_11|, ULTIMATE.start_main_~#t935~0.offset=|v_ULTIMATE.start_main_~#t935~0.offset_27|, ULTIMATE.start_main_~#t936~0.base=|v_ULTIMATE.start_main_~#t936~0.base_32|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_80, ~y$w_buff0~0=v_~y$w_buff0~0_383, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_155, ~y~0=v_~y~0_134, ULTIMATE.start_main_~#t934~0.base=|v_ULTIMATE.start_main_~#t934~0.base_38|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_66|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_66|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_256, ULTIMATE.start_main_~#t934~0.offset=|v_ULTIMATE.start_main_~#t934~0.offset_26|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_90, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_82, ~weak$$choice2~0=v_~weak$$choice2~0_156, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_429} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, #NULL.offset, ~y$read_delayed~0, ~a~0, ULTIMATE.start_main_~#t935~0.base, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t936~0.offset, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, 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, ULTIMATE.start_main_~#t935~0.offset, ULTIMATE.start_main_~#t936~0.base, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t934~0.base, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t934~0.offset, 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:15:08,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L822-1-->L824: Formula: (and (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t935~0.base_13|)) (= |v_ULTIMATE.start_main_~#t935~0.offset_11| 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t935~0.base_13| 4) |v_#length_17|) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t935~0.base_13| 1) |v_#valid_38|) (not (= 0 |v_ULTIMATE.start_main_~#t935~0.base_13|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t935~0.base_13|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t935~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t935~0.base_13|) |v_ULTIMATE.start_main_~#t935~0.offset_11| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t935~0.base=|v_ULTIMATE.start_main_~#t935~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t935~0.offset=|v_ULTIMATE.start_main_~#t935~0.offset_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_11|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t935~0.base, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t935~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 17:15:08,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L824-1-->L826: Formula: (and (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t936~0.base_12| 1)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t936~0.base_12| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t936~0.base_12|) (= |v_ULTIMATE.start_main_~#t936~0.offset_10| 0) (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t936~0.base_12|) 0) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t936~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t936~0.base_12|) |v_ULTIMATE.start_main_~#t936~0.offset_10| 2)) |v_#memory_int_9|) (not (= |v_ULTIMATE.start_main_~#t936~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, ULTIMATE.start_main_~#t936~0.offset=|v_ULTIMATE.start_main_~#t936~0.offset_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t936~0.base=|v_ULTIMATE.start_main_~#t936~0.base_12|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t936~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t936~0.base, #length] because there is no mapped edge [2019-12-18 17:15:08,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [606] [606] L4-->L799: Formula: (and (= v_~y$r_buff0_thd3~0_16 v_~y$r_buff1_thd3~0_10) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_6)) (= v_~__unbuffered_p2_EBX~0_4 v_~a~0_4) (= 1 v_~z~0_3) (= v_~y$r_buff0_thd0~0_18 v_~y$r_buff1_thd0~0_10) (= v_~y$r_buff1_thd1~0_3 v_~y$r_buff0_thd1~0_3) (= v_~__unbuffered_p2_EAX~0_4 v_~z~0_3) (= v_~y$r_buff0_thd3~0_15 1) (= v_~y$r_buff0_thd2~0_37 v_~y$r_buff1_thd2~0_23)) InVars {~a~0=v_~a~0_4, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_16, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_18, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_3, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_6} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_4, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_6, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_23, ~a~0=v_~a~0_4, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_3, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_10, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_15, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_18, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_4, ~z~0=v_~z~0_3, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_10} 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:15:08,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_18 v_~__unbuffered_p0_EAX~0_19) (= v_~a~0_27 1) (= v_P0Thread1of1ForFork0_~arg.base_15 |v_P0Thread1of1ForFork0_#in~arg.base_15|) (= |v_P0Thread1of1ForFork0_#res.base_11| 0) (= v_~__unbuffered_cnt~0_76 (+ v_~__unbuffered_cnt~0_77 1)) (= v_P0Thread1of1ForFork0_~arg.offset_15 |v_P0Thread1of1ForFork0_#in~arg.offset_15|) (= 0 |v_P0Thread1of1ForFork0_#res.offset_11|)) 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_77, ~x~0=v_~x~0_18} OutVars{~a~0=v_~a~0_27, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_19, 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_76, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_15, ~x~0=v_~x~0_18, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_15} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 17:15:08,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L758-->L758-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-988634612 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite8_In-988634612| |P1Thread1of1ForFork1_#t~ite8_Out-988634612|) (= |P1Thread1of1ForFork1_#t~ite9_Out-988634612| ~y$w_buff0~0_In-988634612)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-988634612 256) 0))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-988634612 256) 0)) (and (= (mod ~y$w_buff1_used~0_In-988634612 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-988634612 256)))) .cse0 (= |P1Thread1of1ForFork1_#t~ite9_Out-988634612| |P1Thread1of1ForFork1_#t~ite8_Out-988634612|) (= ~y$w_buff0~0_In-988634612 |P1Thread1of1ForFork1_#t~ite8_Out-988634612|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-988634612, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-988634612, ~y$w_buff0~0=~y$w_buff0~0_In-988634612, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-988634612, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In-988634612|, ~weak$$choice2~0=~weak$$choice2~0_In-988634612, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-988634612} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-988634612, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-988634612, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-988634612|, ~y$w_buff0~0=~y$w_buff0~0_In-988634612, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-988634612, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out-988634612|, ~weak$$choice2~0=~weak$$choice2~0_In-988634612, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-988634612} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 17:15:08,760 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L762-->L763: Formula: (and (not (= (mod v_~weak$$choice2~0_22 256) 0)) (= v_~y$r_buff0_thd2~0_85 v_~y$r_buff0_thd2~0_84)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_16|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_12|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_84, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_9|, ~weak$$choice2~0=v_~weak$$choice2~0_22} 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:15:08,760 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1644113804 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite23_In-1644113804| |P1Thread1of1ForFork1_#t~ite23_Out-1644113804|) (not .cse0) (= ~y$r_buff1_thd2~0_In-1644113804 |P1Thread1of1ForFork1_#t~ite24_Out-1644113804|)) (and (= ~y$r_buff1_thd2~0_In-1644113804 |P1Thread1of1ForFork1_#t~ite23_Out-1644113804|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1644113804 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-1644113804 256)) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1644113804 256))) (and .cse1 (= (mod ~y$w_buff1_used~0_In-1644113804 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite24_Out-1644113804| |P1Thread1of1ForFork1_#t~ite23_Out-1644113804|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1644113804, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1644113804, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1644113804, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-1644113804|, ~weak$$choice2~0=~weak$$choice2~0_In-1644113804, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1644113804} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1644113804, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1644113804, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1644113804, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-1644113804|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-1644113804|, ~weak$$choice2~0=~weak$$choice2~0_In-1644113804, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1644113804} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-12-18 17:15:08,761 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [615] [615] L765-->L773: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 v_~y$flush_delayed~0_8) (not (= 0 (mod v_~y$flush_delayed~0_9 256))) (= v_~y~0_14 v_~y$mem_tmp~0_4)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~y~0=v_~y~0_14, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_11|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-18 17:15:08,763 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1717069109 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In1717069109 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite28_Out1717069109|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1717069109 |P2Thread1of1ForFork2_#t~ite28_Out1717069109|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1717069109, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1717069109} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1717069109, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1717069109, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out1717069109|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-18 17:15:08,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L801-->L801-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-75157911 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-75157911 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-75157911 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In-75157911 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite29_Out-75157911|)) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-75157911 |P2Thread1of1ForFork2_#t~ite29_Out-75157911|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-75157911, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-75157911, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-75157911, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-75157911} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-75157911, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-75157911, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-75157911, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-75157911|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-75157911} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-18 17:15:08,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L802-->L803: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In1903897791 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1903897791 256)))) (or (and (= ~y$r_buff0_thd3~0_Out1903897791 ~y$r_buff0_thd3~0_In1903897791) (or .cse0 .cse1)) (and (not .cse1) (= ~y$r_buff0_thd3~0_Out1903897791 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1903897791, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1903897791} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1903897791, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out1903897791|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1903897791} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 17:15:08,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L803-->L803-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In1363504781 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd3~0_In1363504781 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1363504781 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In1363504781 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite31_Out1363504781| 0)) (and (= |P2Thread1of1ForFork2_#t~ite31_Out1363504781| ~y$r_buff1_thd3~0_In1363504781) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1363504781, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1363504781, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1363504781, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1363504781} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1363504781, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1363504781, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out1363504781|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1363504781, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1363504781} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-18 17:15:08,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L803-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite31_28| v_~y$r_buff1_thd3~0_47) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_47, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_27|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, 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:15:08,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [610] [610] L826-1-->L832: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 17:15:08,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L832-2-->L832-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In419252825 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In419252825 256)))) (or (and (= |ULTIMATE.start_main_#t~ite35_Out419252825| ~y~0_In419252825) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite35_Out419252825| ~y$w_buff1~0_In419252825) (not .cse0) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In419252825, ~y~0=~y~0_In419252825, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In419252825, ~y$w_buff1_used~0=~y$w_buff1_used~0_In419252825} OutVars{~y$w_buff1~0=~y$w_buff1~0_In419252825, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out419252825|, ~y~0=~y~0_In419252825, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In419252825, ~y$w_buff1_used~0=~y$w_buff1_used~0_In419252825} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-18 17:15:08,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L832-4-->L833: Formula: (= v_~y~0_55 |v_ULTIMATE.start_main_#t~ite35_32|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_32|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_33|, ~y~0=v_~y~0_55} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-12-18 17:15:08,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L833-->L833-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1245081363 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1245081363 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite37_Out-1245081363|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-1245081363 |ULTIMATE.start_main_#t~ite37_Out-1245081363|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1245081363, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1245081363} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1245081363, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1245081363, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1245081363|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 17:15:08,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L834-->L834-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd0~0_In-1758922909 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1758922909 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1758922909 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1758922909 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite38_Out-1758922909|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-1758922909 |ULTIMATE.start_main_#t~ite38_Out-1758922909|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1758922909, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1758922909, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1758922909, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1758922909} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1758922909, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1758922909, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1758922909|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1758922909, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1758922909} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 17:15:08,774 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L835-->L835-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1292436496 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1292436496 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite39_Out-1292436496| ~y$r_buff0_thd0~0_In-1292436496)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite39_Out-1292436496| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1292436496, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1292436496} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1292436496, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1292436496|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1292436496} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 17:15:08,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L836-->L836-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In1936468036 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In1936468036 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In1936468036 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1936468036 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite40_Out1936468036|)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite40_Out1936468036| ~y$r_buff1_thd0~0_In1936468036) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1936468036, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1936468036, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1936468036, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1936468036} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1936468036|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1936468036, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1936468036, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1936468036, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1936468036} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 17:15:08,776 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_20 0) (= v_~__unbuffered_p2_EBX~0_84 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|) (= 1 v_~__unbuffered_p2_EAX~0_84) (= v_~y$r_buff1_thd0~0_131 |v_ULTIMATE.start_main_#t~ite40_46|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~__unbuffered_p0_EAX~0_34)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_84, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_84} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_84, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_84, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_131, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} 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:15:08,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:15:08 BasicIcfg [2019-12-18 17:15:08,898 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:15:08,901 INFO L168 Benchmark]: Toolchain (without parser) took 12347.37 ms. Allocated memory was 145.2 MB in the beginning and 449.8 MB in the end (delta: 304.6 MB). Free memory was 99.8 MB in the beginning and 300.9 MB in the end (delta: -201.1 MB). Peak memory consumption was 103.5 MB. Max. memory is 7.1 GB. [2019-12-18 17:15:08,902 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 145.2 MB. Free memory is still 120.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 17:15:08,904 INFO L168 Benchmark]: CACSL2BoogieTranslator took 752.74 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.6 MB in the beginning and 155.4 MB in the end (delta: -55.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-18 17:15:08,907 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.70 ms. Allocated memory is still 202.4 MB. Free memory was 155.4 MB in the beginning and 152.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 17:15:08,911 INFO L168 Benchmark]: Boogie Preprocessor took 36.29 ms. Allocated memory is still 202.4 MB. Free memory was 152.6 MB in the beginning and 150.7 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:15:08,912 INFO L168 Benchmark]: RCFGBuilder took 770.00 ms. Allocated memory is still 202.4 MB. Free memory was 150.7 MB in the beginning and 106.7 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. [2019-12-18 17:15:08,913 INFO L168 Benchmark]: TraceAbstraction took 10716.10 ms. Allocated memory was 202.4 MB in the beginning and 449.8 MB in the end (delta: 247.5 MB). Free memory was 106.7 MB in the beginning and 300.9 MB in the end (delta: -194.3 MB). Peak memory consumption was 53.2 MB. Max. memory is 7.1 GB. [2019-12-18 17:15:08,924 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.46 ms. Allocated memory is still 145.2 MB. Free memory is still 120.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 752.74 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.6 MB in the beginning and 155.4 MB in the end (delta: -55.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.70 ms. Allocated memory is still 202.4 MB. Free memory was 155.4 MB in the beginning and 152.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.29 ms. Allocated memory is still 202.4 MB. Free memory was 152.6 MB in the beginning and 150.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 770.00 ms. Allocated memory is still 202.4 MB. Free memory was 150.7 MB in the beginning and 106.7 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10716.10 ms. Allocated memory was 202.4 MB in the beginning and 449.8 MB in the end (delta: 247.5 MB). Free memory was 106.7 MB in the beginning and 300.9 MB in the end (delta: -194.3 MB). Peak memory consumption was 53.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 154 ProgramPointsBefore, 71 ProgramPointsAfterwards, 179 TransitionsBefore, 79 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 8 FixpointIterations, 35 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 21 ChoiceCompositions, 4868 VarBasedMoverChecksPositive, 199 VarBasedMoverChecksNegative, 61 SemBasedMoverChecksPositive, 174 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 44280 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t934, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L824] FCALL, FORK 0 pthread_create(&t935, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L826] FCALL, FORK 0 pthread_create(&t936, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 1 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L750] 2 x = 1 [L753] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 2 y$flush_delayed = weak$$choice2 [L756] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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] [L757] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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] [L757] 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) [L799] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [!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)=1, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __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_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))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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] [L758] 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)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __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 : (!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))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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 = 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)) [L760] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __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_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))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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] [L760] 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)) [L761] 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_p0_EAX=0, __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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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$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)) [L763] 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)) [L764] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_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] [L799] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L832] 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_p0_EAX=0, __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=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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] [L833] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L834] 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 [L835] 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, 145 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.3s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 942 SDtfs, 820 SDslu, 891 SDs, 0 SdLazy, 310 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12302occurred 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.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 1358 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 288 NumberOfCodeBlocks, 288 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 233 ConstructedInterpolants, 0 QuantifiedInterpolants, 37271 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...