/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix010_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 20:16:51,319 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 20:16:51,321 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 20:16:51,334 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 20:16:51,335 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 20:16:51,336 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 20:16:51,337 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 20:16:51,339 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 20:16:51,341 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 20:16:51,342 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 20:16:51,342 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 20:16:51,344 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 20:16:51,344 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 20:16:51,345 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 20:16:51,346 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 20:16:51,347 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 20:16:51,348 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 20:16:51,349 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 20:16:51,350 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 20:16:51,353 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 20:16:51,354 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 20:16:51,355 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 20:16:51,356 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 20:16:51,357 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 20:16:51,359 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 20:16:51,360 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 20:16:51,360 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 20:16:51,361 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 20:16:51,361 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 20:16:51,362 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 20:16:51,362 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 20:16:51,363 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 20:16:51,364 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 20:16:51,365 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 20:16:51,366 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 20:16:51,366 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 20:16:51,367 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 20:16:51,367 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 20:16:51,367 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 20:16:51,368 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 20:16:51,368 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 20:16:51,369 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 20:16:51,384 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 20:16:51,384 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 20:16:51,385 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 20:16:51,385 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 20:16:51,385 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 20:16:51,386 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 20:16:51,386 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 20:16:51,386 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 20:16:51,386 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 20:16:51,387 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 20:16:51,387 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 20:16:51,387 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 20:16:51,387 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 20:16:51,387 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 20:16:51,388 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 20:16:51,388 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 20:16:51,388 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 20:16:51,388 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 20:16:51,388 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 20:16:51,388 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 20:16:51,389 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 20:16:51,389 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:16:51,389 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 20:16:51,389 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 20:16:51,389 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 20:16:51,389 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 20:16:51,390 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 20:16:51,390 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 20:16:51,390 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 20:16:51,390 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 20:16:51,658 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 20:16:51,680 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 20:16:51,684 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 20:16:51,685 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 20:16:51,685 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 20:16:51,686 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix010_tso.opt.i [2019-12-18 20:16:51,754 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b36e732af/a8e7a2906fd342e984eef8b87a7d8e5a/FLAG3d3aac0ff [2019-12-18 20:16:52,312 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 20:16:52,313 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix010_tso.opt.i [2019-12-18 20:16:52,341 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b36e732af/a8e7a2906fd342e984eef8b87a7d8e5a/FLAG3d3aac0ff [2019-12-18 20:16:52,565 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b36e732af/a8e7a2906fd342e984eef8b87a7d8e5a [2019-12-18 20:16:52,575 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 20:16:52,577 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 20:16:52,578 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 20:16:52,579 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 20:16:52,584 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 20:16:52,585 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:16:52" (1/1) ... [2019-12-18 20:16:52,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d638138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:16:52, skipping insertion in model container [2019-12-18 20:16:52,589 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:16:52" (1/1) ... [2019-12-18 20:16:52,598 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 20:16:52,664 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 20:16:53,217 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:16:53,228 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 20:16:53,334 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:16:53,404 INFO L208 MainTranslator]: Completed translation [2019-12-18 20:16:53,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:16:53 WrapperNode [2019-12-18 20:16:53,404 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 20:16:53,405 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 20:16:53,405 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 20:16:53,405 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 20:16:53,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:16:53" (1/1) ... [2019-12-18 20:16:53,438 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:16:53" (1/1) ... [2019-12-18 20:16:53,470 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 20:16:53,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 20:16:53,471 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 20:16:53,471 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 20:16:53,479 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:16:53" (1/1) ... [2019-12-18 20:16:53,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:16:53" (1/1) ... [2019-12-18 20:16:53,484 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:16:53" (1/1) ... [2019-12-18 20:16:53,484 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:16:53" (1/1) ... [2019-12-18 20:16:53,495 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:16:53" (1/1) ... [2019-12-18 20:16:53,500 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:16:53" (1/1) ... [2019-12-18 20:16:53,504 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:16:53" (1/1) ... [2019-12-18 20:16:53,509 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 20:16:53,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 20:16:53,510 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 20:16:53,510 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 20:16:53,511 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:16:53" (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 20:16:53,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 20:16:53,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 20:16:53,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 20:16:53,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 20:16:53,575 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 20:16:53,575 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 20:16:53,575 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 20:16:53,576 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 20:16:53,577 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 20:16:53,577 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 20:16:53,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 20:16:53,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 20:16:53,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 20:16:53,583 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 20:16:54,436 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 20:16:54,437 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 20:16:54,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:16:54 BoogieIcfgContainer [2019-12-18 20:16:54,438 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 20:16:54,439 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 20:16:54,440 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 20:16:54,443 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 20:16:54,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:16:52" (1/3) ... [2019-12-18 20:16:54,444 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bd56300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:16:54, skipping insertion in model container [2019-12-18 20:16:54,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:16:53" (2/3) ... [2019-12-18 20:16:54,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bd56300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:16:54, skipping insertion in model container [2019-12-18 20:16:54,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:16:54" (3/3) ... [2019-12-18 20:16:54,447 INFO L109 eAbstractionObserver]: Analyzing ICFG mix010_tso.opt.i [2019-12-18 20:16:54,457 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 20:16:54,458 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 20:16:54,466 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 20:16:54,467 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 20:16:54,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,538 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,538 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,543 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,543 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,585 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,586 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,586 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,593 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,594 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,632 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,638 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,643 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,652 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,652 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,655 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,657 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:16:54,675 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 20:16:54,697 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 20:16:54,698 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 20:16:54,698 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 20:16:54,698 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 20:16:54,698 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 20:16:54,698 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 20:16:54,698 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 20:16:54,699 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 20:16:54,719 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 243 transitions [2019-12-18 20:16:54,721 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-18 20:16:54,838 INFO L126 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-18 20:16:54,838 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:16:54,862 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 568 event pairs. 9/191 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-18 20:16:54,897 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-18 20:16:54,963 INFO L126 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-18 20:16:54,964 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:16:54,977 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 568 event pairs. 9/191 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-18 20:16:55,009 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-18 20:16:55,010 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 20:16:58,737 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-12-18 20:16:59,133 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-18 20:16:59,271 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-18 20:16:59,299 INFO L206 etLargeBlockEncoding]: Checked pairs total: 134090 [2019-12-18 20:16:59,299 INFO L214 etLargeBlockEncoding]: Total number of compositions: 127 [2019-12-18 20:16:59,302 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 106 places, 126 transitions [2019-12-18 20:17:01,976 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 42246 states. [2019-12-18 20:17:01,978 INFO L276 IsEmpty]: Start isEmpty. Operand 42246 states. [2019-12-18 20:17:01,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 20:17:01,984 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:17:01,985 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:17:01,985 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 20:17:01,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:17:01,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1163944889, now seen corresponding path program 1 times [2019-12-18 20:17:02,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:17:02,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208122409] [2019-12-18 20:17:02,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:17:02,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:17:02,238 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 20:17:02,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208122409] [2019-12-18 20:17:02,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:17:02,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:17:02,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659596236] [2019-12-18 20:17:02,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:17:02,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:17:02,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:17:02,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:17:02,261 INFO L87 Difference]: Start difference. First operand 42246 states. Second operand 3 states. [2019-12-18 20:17:03,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:17:03,803 INFO L93 Difference]: Finished difference Result 41734 states and 169560 transitions. [2019-12-18 20:17:03,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:17:03,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 20:17:03,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:17:04,206 INFO L225 Difference]: With dead ends: 41734 [2019-12-18 20:17:04,207 INFO L226 Difference]: Without dead ends: 38854 [2019-12-18 20:17:04,208 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 20:17:05,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38854 states. [2019-12-18 20:17:06,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38854 to 38854. [2019-12-18 20:17:06,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38854 states. [2019-12-18 20:17:08,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38854 states to 38854 states and 157748 transitions. [2019-12-18 20:17:08,298 INFO L78 Accepts]: Start accepts. Automaton has 38854 states and 157748 transitions. Word has length 7 [2019-12-18 20:17:08,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:17:08,299 INFO L462 AbstractCegarLoop]: Abstraction has 38854 states and 157748 transitions. [2019-12-18 20:17:08,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:17:08,299 INFO L276 IsEmpty]: Start isEmpty. Operand 38854 states and 157748 transitions. [2019-12-18 20:17:08,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 20:17:08,304 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:17:08,304 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:17:08,305 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 20:17:08,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:17:08,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1542231911, now seen corresponding path program 1 times [2019-12-18 20:17:08,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:17:08,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988749570] [2019-12-18 20:17:08,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:17:08,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:17:08,458 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 20:17:08,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988749570] [2019-12-18 20:17:08,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:17:08,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:17:08,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968558051] [2019-12-18 20:17:08,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:17:08,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:17:08,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:17:08,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:17:08,463 INFO L87 Difference]: Start difference. First operand 38854 states and 157748 transitions. Second operand 4 states. [2019-12-18 20:17:09,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:17:09,412 INFO L93 Difference]: Finished difference Result 61490 states and 240522 transitions. [2019-12-18 20:17:09,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:17:09,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 20:17:09,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:17:09,727 INFO L225 Difference]: With dead ends: 61490 [2019-12-18 20:17:09,727 INFO L226 Difference]: Without dead ends: 61462 [2019-12-18 20:17:09,729 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 20:17:10,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61462 states. [2019-12-18 20:17:12,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61462 to 58792. [2019-12-18 20:17:12,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58792 states. [2019-12-18 20:17:15,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58792 states to 58792 states and 231943 transitions. [2019-12-18 20:17:15,537 INFO L78 Accepts]: Start accepts. Automaton has 58792 states and 231943 transitions. Word has length 13 [2019-12-18 20:17:15,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:17:15,538 INFO L462 AbstractCegarLoop]: Abstraction has 58792 states and 231943 transitions. [2019-12-18 20:17:15,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:17:15,538 INFO L276 IsEmpty]: Start isEmpty. Operand 58792 states and 231943 transitions. [2019-12-18 20:17:15,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 20:17:15,546 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:17:15,546 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:17:15,546 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 20:17:15,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:17:15,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1747872827, now seen corresponding path program 1 times [2019-12-18 20:17:15,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:17:15,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35082360] [2019-12-18 20:17:15,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:17:15,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:17:15,631 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 20:17:15,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35082360] [2019-12-18 20:17:15,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:17:15,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:17:15,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535250103] [2019-12-18 20:17:15,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:17:15,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:17:15,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:17:15,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:17:15,636 INFO L87 Difference]: Start difference. First operand 58792 states and 231943 transitions. Second operand 4 states. [2019-12-18 20:17:16,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:17:16,279 INFO L93 Difference]: Finished difference Result 76000 states and 295555 transitions. [2019-12-18 20:17:16,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:17:16,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 20:17:16,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:17:16,570 INFO L225 Difference]: With dead ends: 76000 [2019-12-18 20:17:16,570 INFO L226 Difference]: Without dead ends: 75972 [2019-12-18 20:17:16,571 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 20:17:19,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75972 states. [2019-12-18 20:17:20,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75972 to 66902. [2019-12-18 20:17:20,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66902 states. [2019-12-18 20:17:20,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66902 states to 66902 states and 262800 transitions. [2019-12-18 20:17:20,791 INFO L78 Accepts]: Start accepts. Automaton has 66902 states and 262800 transitions. Word has length 16 [2019-12-18 20:17:20,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:17:20,792 INFO L462 AbstractCegarLoop]: Abstraction has 66902 states and 262800 transitions. [2019-12-18 20:17:20,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:17:20,792 INFO L276 IsEmpty]: Start isEmpty. Operand 66902 states and 262800 transitions. [2019-12-18 20:17:20,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 20:17:20,801 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:17:20,801 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:17:20,802 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 20:17:20,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:17:20,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1292040923, now seen corresponding path program 1 times [2019-12-18 20:17:20,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:17:20,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044401038] [2019-12-18 20:17:20,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:17:20,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:17:20,862 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 20:17:20,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044401038] [2019-12-18 20:17:20,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:17:20,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:17:20,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750100916] [2019-12-18 20:17:20,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:17:20,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:17:20,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:17:20,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:17:20,865 INFO L87 Difference]: Start difference. First operand 66902 states and 262800 transitions. Second operand 3 states. [2019-12-18 20:17:21,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:17:21,690 INFO L93 Difference]: Finished difference Result 62750 states and 246122 transitions. [2019-12-18 20:17:21,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:17:21,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 20:17:21,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:17:21,880 INFO L225 Difference]: With dead ends: 62750 [2019-12-18 20:17:21,880 INFO L226 Difference]: Without dead ends: 62582 [2019-12-18 20:17:21,881 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 20:17:22,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62582 states. [2019-12-18 20:17:25,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62582 to 62582. [2019-12-18 20:17:25,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62582 states. [2019-12-18 20:17:25,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62582 states to 62582 states and 245526 transitions. [2019-12-18 20:17:25,981 INFO L78 Accepts]: Start accepts. Automaton has 62582 states and 245526 transitions. Word has length 18 [2019-12-18 20:17:25,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:17:25,981 INFO L462 AbstractCegarLoop]: Abstraction has 62582 states and 245526 transitions. [2019-12-18 20:17:25,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:17:25,981 INFO L276 IsEmpty]: Start isEmpty. Operand 62582 states and 245526 transitions. [2019-12-18 20:17:26,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 20:17:26,007 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:17:26,007 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] [2019-12-18 20:17:26,007 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 20:17:26,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:17:26,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1307614695, now seen corresponding path program 1 times [2019-12-18 20:17:26,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:17:26,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467663940] [2019-12-18 20:17:26,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:17:26,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:17:26,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:17:26,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467663940] [2019-12-18 20:17:26,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:17:26,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:17:26,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877904714] [2019-12-18 20:17:26,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:17:26,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:17:26,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:17:26,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:17:26,092 INFO L87 Difference]: Start difference. First operand 62582 states and 245526 transitions. Second operand 5 states. [2019-12-18 20:17:27,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:17:27,392 INFO L93 Difference]: Finished difference Result 75196 states and 291047 transitions. [2019-12-18 20:17:27,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 20:17:27,393 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 20:17:27,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:17:27,569 INFO L225 Difference]: With dead ends: 75196 [2019-12-18 20:17:27,569 INFO L226 Difference]: Without dead ends: 75144 [2019-12-18 20:17:27,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:17:28,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75144 states. [2019-12-18 20:17:29,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75144 to 62270. [2019-12-18 20:17:29,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62270 states. [2019-12-18 20:17:33,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62270 states to 62270 states and 244452 transitions. [2019-12-18 20:17:33,611 INFO L78 Accepts]: Start accepts. Automaton has 62270 states and 244452 transitions. Word has length 22 [2019-12-18 20:17:33,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:17:33,611 INFO L462 AbstractCegarLoop]: Abstraction has 62270 states and 244452 transitions. [2019-12-18 20:17:33,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:17:33,611 INFO L276 IsEmpty]: Start isEmpty. Operand 62270 states and 244452 transitions. [2019-12-18 20:17:33,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 20:17:33,685 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:17:33,685 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] [2019-12-18 20:17:33,686 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 20:17:33,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:17:33,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1189986838, now seen corresponding path program 1 times [2019-12-18 20:17:33,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:17:33,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703874222] [2019-12-18 20:17:33,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:17:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:17:33,761 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 20:17:33,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703874222] [2019-12-18 20:17:33,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:17:33,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:17:33,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517455374] [2019-12-18 20:17:33,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:17:33,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:17:33,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:17:33,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:17:33,763 INFO L87 Difference]: Start difference. First operand 62270 states and 244452 transitions. Second operand 5 states. [2019-12-18 20:17:34,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:17:34,253 INFO L93 Difference]: Finished difference Result 94430 states and 375492 transitions. [2019-12-18 20:17:34,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:17:34,254 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-12-18 20:17:34,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:17:34,456 INFO L225 Difference]: With dead ends: 94430 [2019-12-18 20:17:34,456 INFO L226 Difference]: Without dead ends: 82542 [2019-12-18 20:17:34,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:17:35,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82542 states. [2019-12-18 20:17:36,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82542 to 82542. [2019-12-18 20:17:36,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82542 states. [2019-12-18 20:17:37,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82542 states to 82542 states and 329856 transitions. [2019-12-18 20:17:37,304 INFO L78 Accepts]: Start accepts. Automaton has 82542 states and 329856 transitions. Word has length 32 [2019-12-18 20:17:37,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:17:37,304 INFO L462 AbstractCegarLoop]: Abstraction has 82542 states and 329856 transitions. [2019-12-18 20:17:37,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:17:37,304 INFO L276 IsEmpty]: Start isEmpty. Operand 82542 states and 329856 transitions. [2019-12-18 20:17:37,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 20:17:37,396 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:17:37,396 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] [2019-12-18 20:17:37,396 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 20:17:37,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:17:37,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1971502230, now seen corresponding path program 2 times [2019-12-18 20:17:37,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:17:37,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887687446] [2019-12-18 20:17:37,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:17:37,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:17:37,461 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 20:17:37,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887687446] [2019-12-18 20:17:37,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:17:37,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:17:37,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040076031] [2019-12-18 20:17:37,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:17:37,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:17:37,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:17:37,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:17:37,464 INFO L87 Difference]: Start difference. First operand 82542 states and 329856 transitions. Second operand 3 states. [2019-12-18 20:17:37,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:17:37,827 INFO L93 Difference]: Finished difference Result 82490 states and 329676 transitions. [2019-12-18 20:17:37,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:17:37,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-18 20:17:37,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:17:38,028 INFO L225 Difference]: With dead ends: 82490 [2019-12-18 20:17:38,028 INFO L226 Difference]: Without dead ends: 82490 [2019-12-18 20:17:38,028 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 20:17:39,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82490 states. [2019-12-18 20:17:44,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82490 to 82490. [2019-12-18 20:17:44,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82490 states. [2019-12-18 20:17:44,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82490 states to 82490 states and 329676 transitions. [2019-12-18 20:17:44,608 INFO L78 Accepts]: Start accepts. Automaton has 82490 states and 329676 transitions. Word has length 32 [2019-12-18 20:17:44,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:17:44,609 INFO L462 AbstractCegarLoop]: Abstraction has 82490 states and 329676 transitions. [2019-12-18 20:17:44,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:17:44,609 INFO L276 IsEmpty]: Start isEmpty. Operand 82490 states and 329676 transitions. [2019-12-18 20:17:44,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 20:17:44,728 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:17:44,728 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] [2019-12-18 20:17:44,728 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 20:17:44,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:17:44,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1739657011, now seen corresponding path program 1 times [2019-12-18 20:17:44,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:17:44,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808088406] [2019-12-18 20:17:44,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:17:44,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:17:44,831 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 20:17:44,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808088406] [2019-12-18 20:17:44,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:17:44,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:17:44,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028096229] [2019-12-18 20:17:44,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:17:44,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:17:44,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:17:44,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:17:44,833 INFO L87 Difference]: Start difference. First operand 82490 states and 329676 transitions. Second operand 3 states. [2019-12-18 20:17:45,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:17:45,188 INFO L93 Difference]: Finished difference Result 82490 states and 325052 transitions. [2019-12-18 20:17:45,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:17:45,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-18 20:17:45,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:17:45,384 INFO L225 Difference]: With dead ends: 82490 [2019-12-18 20:17:45,384 INFO L226 Difference]: Without dead ends: 82490 [2019-12-18 20:17:45,384 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 20:17:46,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82490 states. [2019-12-18 20:17:47,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82490 to 82170. [2019-12-18 20:17:47,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82170 states. [2019-12-18 20:17:51,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82170 states to 82170 states and 323964 transitions. [2019-12-18 20:17:51,942 INFO L78 Accepts]: Start accepts. Automaton has 82170 states and 323964 transitions. Word has length 33 [2019-12-18 20:17:51,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:17:51,943 INFO L462 AbstractCegarLoop]: Abstraction has 82170 states and 323964 transitions. [2019-12-18 20:17:51,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:17:51,943 INFO L276 IsEmpty]: Start isEmpty. Operand 82170 states and 323964 transitions. [2019-12-18 20:17:52,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 20:17:52,040 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:17:52,040 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] [2019-12-18 20:17:52,040 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 20:17:52,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:17:52,041 INFO L82 PathProgramCache]: Analyzing trace with hash -485153628, now seen corresponding path program 1 times [2019-12-18 20:17:52,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:17:52,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812512792] [2019-12-18 20:17:52,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:17:52,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:17:52,139 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 20:17:52,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812512792] [2019-12-18 20:17:52,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:17:52,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:17:52,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500202131] [2019-12-18 20:17:52,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 20:17:52,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:17:52,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 20:17:52,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:17:52,141 INFO L87 Difference]: Start difference. First operand 82170 states and 323964 transitions. Second operand 8 states. [2019-12-18 20:17:53,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:17:53,512 INFO L93 Difference]: Finished difference Result 143300 states and 562205 transitions. [2019-12-18 20:17:53,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 20:17:53,512 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-18 20:17:53,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:17:53,881 INFO L225 Difference]: With dead ends: 143300 [2019-12-18 20:17:53,881 INFO L226 Difference]: Without dead ends: 132810 [2019-12-18 20:17:53,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2019-12-18 20:17:55,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132810 states. [2019-12-18 20:17:57,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132810 to 92684. [2019-12-18 20:17:57,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92684 states. [2019-12-18 20:17:57,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92684 states to 92684 states and 365623 transitions. [2019-12-18 20:17:57,643 INFO L78 Accepts]: Start accepts. Automaton has 92684 states and 365623 transitions. Word has length 34 [2019-12-18 20:17:57,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:17:57,643 INFO L462 AbstractCegarLoop]: Abstraction has 92684 states and 365623 transitions. [2019-12-18 20:17:57,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 20:17:57,644 INFO L276 IsEmpty]: Start isEmpty. Operand 92684 states and 365623 transitions. [2019-12-18 20:17:57,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 20:17:57,751 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:17:57,752 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] [2019-12-18 20:17:57,752 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 20:17:57,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:17:57,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1010363922, now seen corresponding path program 2 times [2019-12-18 20:17:57,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:17:57,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558261516] [2019-12-18 20:17:57,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:17:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:17:57,926 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 20:17:57,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558261516] [2019-12-18 20:17:57,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:17:57,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:17:57,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169878801] [2019-12-18 20:17:57,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 20:17:57,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:17:57,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 20:17:57,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 20:17:57,928 INFO L87 Difference]: Start difference. First operand 92684 states and 365623 transitions. Second operand 10 states. [2019-12-18 20:18:00,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:00,037 INFO L93 Difference]: Finished difference Result 129606 states and 517086 transitions. [2019-12-18 20:18:00,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 20:18:00,037 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-12-18 20:18:00,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:01,316 INFO L225 Difference]: With dead ends: 129606 [2019-12-18 20:18:01,316 INFO L226 Difference]: Without dead ends: 121870 [2019-12-18 20:18:01,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2019-12-18 20:18:02,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121870 states. [2019-12-18 20:18:04,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121870 to 95984. [2019-12-18 20:18:04,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95984 states. [2019-12-18 20:18:04,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95984 states to 95984 states and 379387 transitions. [2019-12-18 20:18:04,598 INFO L78 Accepts]: Start accepts. Automaton has 95984 states and 379387 transitions. Word has length 34 [2019-12-18 20:18:04,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:04,599 INFO L462 AbstractCegarLoop]: Abstraction has 95984 states and 379387 transitions. [2019-12-18 20:18:04,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 20:18:04,599 INFO L276 IsEmpty]: Start isEmpty. Operand 95984 states and 379387 transitions. [2019-12-18 20:18:04,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 20:18:04,706 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:04,706 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] [2019-12-18 20:18:04,707 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 20:18:04,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:04,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1189312164, now seen corresponding path program 3 times [2019-12-18 20:18:04,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:04,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931191145] [2019-12-18 20:18:04,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:04,901 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 20:18:04,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931191145] [2019-12-18 20:18:04,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:04,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:18:04,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303472067] [2019-12-18 20:18:04,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 20:18:04,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:04,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 20:18:04,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:18:04,903 INFO L87 Difference]: Start difference. First operand 95984 states and 379387 transitions. Second operand 8 states. [2019-12-18 20:18:06,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:06,894 INFO L93 Difference]: Finished difference Result 140272 states and 551495 transitions. [2019-12-18 20:18:06,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 20:18:06,894 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-18 20:18:06,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:07,217 INFO L225 Difference]: With dead ends: 140272 [2019-12-18 20:18:07,217 INFO L226 Difference]: Without dead ends: 132048 [2019-12-18 20:18:07,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2019-12-18 20:18:08,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132048 states. [2019-12-18 20:18:13,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132048 to 92480. [2019-12-18 20:18:13,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92480 states. [2019-12-18 20:18:13,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92480 states to 92480 states and 364971 transitions. [2019-12-18 20:18:13,906 INFO L78 Accepts]: Start accepts. Automaton has 92480 states and 364971 transitions. Word has length 34 [2019-12-18 20:18:13,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:13,906 INFO L462 AbstractCegarLoop]: Abstraction has 92480 states and 364971 transitions. [2019-12-18 20:18:13,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 20:18:13,906 INFO L276 IsEmpty]: Start isEmpty. Operand 92480 states and 364971 transitions. [2019-12-18 20:18:14,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 20:18:14,023 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:14,024 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] [2019-12-18 20:18:14,024 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:18:14,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:14,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1575731334, now seen corresponding path program 4 times [2019-12-18 20:18:14,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:14,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168278482] [2019-12-18 20:18:14,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:14,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:14,125 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 20:18:14,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168278482] [2019-12-18 20:18:14,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:14,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:18:14,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119630061] [2019-12-18 20:18:14,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 20:18:14,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:14,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 20:18:14,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:18:14,127 INFO L87 Difference]: Start difference. First operand 92480 states and 364971 transitions. Second operand 8 states. [2019-12-18 20:18:16,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:16,092 INFO L93 Difference]: Finished difference Result 166574 states and 652386 transitions. [2019-12-18 20:18:16,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 20:18:16,092 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-18 20:18:16,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:16,505 INFO L225 Difference]: With dead ends: 166574 [2019-12-18 20:18:16,505 INFO L226 Difference]: Without dead ends: 152308 [2019-12-18 20:18:16,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-12-18 20:18:18,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152308 states. [2019-12-18 20:18:24,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152308 to 102196. [2019-12-18 20:18:24,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102196 states. [2019-12-18 20:18:24,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102196 states to 102196 states and 401977 transitions. [2019-12-18 20:18:24,827 INFO L78 Accepts]: Start accepts. Automaton has 102196 states and 401977 transitions. Word has length 34 [2019-12-18 20:18:24,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:24,827 INFO L462 AbstractCegarLoop]: Abstraction has 102196 states and 401977 transitions. [2019-12-18 20:18:24,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 20:18:24,828 INFO L276 IsEmpty]: Start isEmpty. Operand 102196 states and 401977 transitions. [2019-12-18 20:18:24,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 20:18:24,953 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:24,954 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] [2019-12-18 20:18:24,954 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:18:24,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:24,954 INFO L82 PathProgramCache]: Analyzing trace with hash 578018651, now seen corresponding path program 1 times [2019-12-18 20:18:24,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:24,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580209046] [2019-12-18 20:18:24,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:25,024 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 20:18:25,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580209046] [2019-12-18 20:18:25,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:25,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:18:25,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993664875] [2019-12-18 20:18:25,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:18:25,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:25,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:18:25,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:18:25,026 INFO L87 Difference]: Start difference. First operand 102196 states and 401977 transitions. Second operand 4 states. [2019-12-18 20:18:25,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:25,419 INFO L93 Difference]: Finished difference Result 60940 states and 210053 transitions. [2019-12-18 20:18:25,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:18:25,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-12-18 20:18:25,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:26,361 INFO L225 Difference]: With dead ends: 60940 [2019-12-18 20:18:26,362 INFO L226 Difference]: Without dead ends: 55332 [2019-12-18 20:18:26,362 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 20:18:26,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55332 states. [2019-12-18 20:18:27,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55332 to 55332. [2019-12-18 20:18:27,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55332 states. [2019-12-18 20:18:27,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55332 states to 55332 states and 190134 transitions. [2019-12-18 20:18:27,631 INFO L78 Accepts]: Start accepts. Automaton has 55332 states and 190134 transitions. Word has length 35 [2019-12-18 20:18:27,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:27,631 INFO L462 AbstractCegarLoop]: Abstraction has 55332 states and 190134 transitions. [2019-12-18 20:18:27,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:18:27,631 INFO L276 IsEmpty]: Start isEmpty. Operand 55332 states and 190134 transitions. [2019-12-18 20:18:27,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-18 20:18:27,690 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:27,690 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] [2019-12-18 20:18:27,690 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:18:27,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:27,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1129783466, now seen corresponding path program 1 times [2019-12-18 20:18:27,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:27,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630728852] [2019-12-18 20:18:27,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:27,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:27,735 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 20:18:27,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630728852] [2019-12-18 20:18:27,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:27,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:18:27,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322662490] [2019-12-18 20:18:27,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:18:27,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:27,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:18:27,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:18:27,737 INFO L87 Difference]: Start difference. First operand 55332 states and 190134 transitions. Second operand 4 states. [2019-12-18 20:18:30,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:30,010 INFO L93 Difference]: Finished difference Result 104407 states and 359030 transitions. [2019-12-18 20:18:30,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:18:30,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-18 20:18:30,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:30,132 INFO L225 Difference]: With dead ends: 104407 [2019-12-18 20:18:30,133 INFO L226 Difference]: Without dead ends: 55384 [2019-12-18 20:18:30,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:18:30,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55384 states. [2019-12-18 20:18:31,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55384 to 55332. [2019-12-18 20:18:31,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55332 states. [2019-12-18 20:18:31,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55332 states to 55332 states and 186039 transitions. [2019-12-18 20:18:31,597 INFO L78 Accepts]: Start accepts. Automaton has 55332 states and 186039 transitions. Word has length 36 [2019-12-18 20:18:31,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:31,597 INFO L462 AbstractCegarLoop]: Abstraction has 55332 states and 186039 transitions. [2019-12-18 20:18:31,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:18:31,597 INFO L276 IsEmpty]: Start isEmpty. Operand 55332 states and 186039 transitions. [2019-12-18 20:18:31,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-18 20:18:31,655 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:31,655 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] [2019-12-18 20:18:31,655 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:18:31,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:31,656 INFO L82 PathProgramCache]: Analyzing trace with hash -140155408, now seen corresponding path program 2 times [2019-12-18 20:18:31,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:31,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490263287] [2019-12-18 20:18:31,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:31,726 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 20:18:31,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490263287] [2019-12-18 20:18:31,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:31,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:18:31,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638772420] [2019-12-18 20:18:31,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:18:31,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:31,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:18:31,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:18:31,728 INFO L87 Difference]: Start difference. First operand 55332 states and 186039 transitions. Second operand 5 states. [2019-12-18 20:18:31,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:31,798 INFO L93 Difference]: Finished difference Result 10026 states and 28045 transitions. [2019-12-18 20:18:31,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:18:31,799 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-12-18 20:18:31,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:31,810 INFO L225 Difference]: With dead ends: 10026 [2019-12-18 20:18:31,810 INFO L226 Difference]: Without dead ends: 7104 [2019-12-18 20:18:31,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:18:31,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7104 states. [2019-12-18 20:18:31,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7104 to 7080. [2019-12-18 20:18:31,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7080 states. [2019-12-18 20:18:31,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7080 states to 7080 states and 17831 transitions. [2019-12-18 20:18:31,891 INFO L78 Accepts]: Start accepts. Automaton has 7080 states and 17831 transitions. Word has length 36 [2019-12-18 20:18:31,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:31,891 INFO L462 AbstractCegarLoop]: Abstraction has 7080 states and 17831 transitions. [2019-12-18 20:18:31,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:18:31,891 INFO L276 IsEmpty]: Start isEmpty. Operand 7080 states and 17831 transitions. [2019-12-18 20:18:31,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 20:18:31,897 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:31,898 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:18:31,898 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:18:31,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:31,898 INFO L82 PathProgramCache]: Analyzing trace with hash -944953888, now seen corresponding path program 1 times [2019-12-18 20:18:31,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:31,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872897917] [2019-12-18 20:18:31,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:31,981 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 20:18:31,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872897917] [2019-12-18 20:18:31,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:31,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:18:31,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615413980] [2019-12-18 20:18:31,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:18:31,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:31,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:18:31,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:18:31,983 INFO L87 Difference]: Start difference. First operand 7080 states and 17831 transitions. Second operand 6 states. [2019-12-18 20:18:32,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:32,072 INFO L93 Difference]: Finished difference Result 5823 states and 14964 transitions. [2019-12-18 20:18:32,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:18:32,072 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-12-18 20:18:32,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:32,078 INFO L225 Difference]: With dead ends: 5823 [2019-12-18 20:18:32,079 INFO L226 Difference]: Without dead ends: 2946 [2019-12-18 20:18:32,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:18:32,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2019-12-18 20:18:32,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 2922. [2019-12-18 20:18:32,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2922 states. [2019-12-18 20:18:32,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2922 states and 7467 transitions. [2019-12-18 20:18:32,133 INFO L78 Accepts]: Start accepts. Automaton has 2922 states and 7467 transitions. Word has length 47 [2019-12-18 20:18:32,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:32,134 INFO L462 AbstractCegarLoop]: Abstraction has 2922 states and 7467 transitions. [2019-12-18 20:18:32,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:18:32,134 INFO L276 IsEmpty]: Start isEmpty. Operand 2922 states and 7467 transitions. [2019-12-18 20:18:32,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-18 20:18:32,140 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:32,140 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:18:32,140 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:18:32,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:32,141 INFO L82 PathProgramCache]: Analyzing trace with hash 682868541, now seen corresponding path program 1 times [2019-12-18 20:18:32,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:32,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364979809] [2019-12-18 20:18:32,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:32,273 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 20:18:32,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364979809] [2019-12-18 20:18:32,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:32,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:18:32,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153150541] [2019-12-18 20:18:32,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:18:32,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:32,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:18:32,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:18:32,277 INFO L87 Difference]: Start difference. First operand 2922 states and 7467 transitions. Second operand 6 states. [2019-12-18 20:18:32,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:32,443 INFO L93 Difference]: Finished difference Result 5039 states and 12757 transitions. [2019-12-18 20:18:32,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 20:18:32,443 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-18 20:18:32,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:32,451 INFO L225 Difference]: With dead ends: 5039 [2019-12-18 20:18:32,451 INFO L226 Difference]: Without dead ends: 4524 [2019-12-18 20:18:32,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-18 20:18:32,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4524 states. [2019-12-18 20:18:32,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4524 to 3350. [2019-12-18 20:18:32,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3350 states. [2019-12-18 20:18:32,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3350 states to 3350 states and 8536 transitions. [2019-12-18 20:18:32,511 INFO L78 Accepts]: Start accepts. Automaton has 3350 states and 8536 transitions. Word has length 62 [2019-12-18 20:18:32,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:32,511 INFO L462 AbstractCegarLoop]: Abstraction has 3350 states and 8536 transitions. [2019-12-18 20:18:32,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:18:32,512 INFO L276 IsEmpty]: Start isEmpty. Operand 3350 states and 8536 transitions. [2019-12-18 20:18:32,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-18 20:18:32,516 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:32,517 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:18:32,517 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:18:32,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:32,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1657443581, now seen corresponding path program 2 times [2019-12-18 20:18:32,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:32,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439562392] [2019-12-18 20:18:32,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:32,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:32,570 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 20:18:32,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439562392] [2019-12-18 20:18:32,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:32,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:18:32,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047334543] [2019-12-18 20:18:32,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:18:32,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:32,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:18:32,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:18:32,572 INFO L87 Difference]: Start difference. First operand 3350 states and 8536 transitions. Second operand 4 states. [2019-12-18 20:18:32,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:32,597 INFO L93 Difference]: Finished difference Result 3713 states and 9361 transitions. [2019-12-18 20:18:32,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:18:32,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-18 20:18:32,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:32,598 INFO L225 Difference]: With dead ends: 3713 [2019-12-18 20:18:32,598 INFO L226 Difference]: Without dead ends: 414 [2019-12-18 20:18:32,598 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 20:18:32,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-12-18 20:18:32,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2019-12-18 20:18:32,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-12-18 20:18:32,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 898 transitions. [2019-12-18 20:18:32,604 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 898 transitions. Word has length 62 [2019-12-18 20:18:32,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:32,604 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 898 transitions. [2019-12-18 20:18:32,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:18:32,605 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 898 transitions. [2019-12-18 20:18:32,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 20:18:32,605 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:32,606 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:18:32,606 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:18:32,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:32,606 INFO L82 PathProgramCache]: Analyzing trace with hash 183287320, now seen corresponding path program 1 times [2019-12-18 20:18:32,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:32,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088462076] [2019-12-18 20:18:32,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:32,717 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 20:18:32,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088462076] [2019-12-18 20:18:32,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:32,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 20:18:32,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007036382] [2019-12-18 20:18:32,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 20:18:32,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:32,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 20:18:32,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:18:32,720 INFO L87 Difference]: Start difference. First operand 414 states and 898 transitions. Second operand 8 states. [2019-12-18 20:18:32,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:32,911 INFO L93 Difference]: Finished difference Result 890 states and 1901 transitions. [2019-12-18 20:18:32,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 20:18:32,912 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-18 20:18:32,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:32,913 INFO L225 Difference]: With dead ends: 890 [2019-12-18 20:18:32,913 INFO L226 Difference]: Without dead ends: 647 [2019-12-18 20:18:32,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-18 20:18:32,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-12-18 20:18:32,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 501. [2019-12-18 20:18:32,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-12-18 20:18:32,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 1054 transitions. [2019-12-18 20:18:32,920 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 1054 transitions. Word has length 63 [2019-12-18 20:18:32,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:32,920 INFO L462 AbstractCegarLoop]: Abstraction has 501 states and 1054 transitions. [2019-12-18 20:18:32,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 20:18:32,921 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 1054 transitions. [2019-12-18 20:18:32,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 20:18:32,921 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:32,922 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:18:32,922 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:18:32,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:32,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1420483866, now seen corresponding path program 2 times [2019-12-18 20:18:32,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:32,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428067941] [2019-12-18 20:18:32,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:18:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:18:33,041 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 20:18:33,041 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 20:18:33,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= v_~z$w_buff0_used~0_138 0) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~a~0_9) (= 0 v_~z$r_buff1_thd3~0_41) (= 0 v_~weak$$choice0~0_8) (= v_~main$tmp_guard1~0_16 0) (= v_~z$r_buff0_thd3~0_79 0) (= v_~z$r_buff0_thd1~0_10 0) (= 0 v_~z$r_buff1_thd2~0_32) (= 0 v_~__unbuffered_p1_EAX~0_15) (= v_~__unbuffered_p1_EBX~0_14 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t278~0.base_23|) 0) (= v_~z~0_28 0) (= v_~z$r_buff1_thd1~0_8 0) (= v_~z$read_delayed~0_8 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t278~0.base_23| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t278~0.base_23|) |v_ULTIMATE.start_main_~#t278~0.offset_18| 0)) |v_#memory_int_19|) (= 0 v_~__unbuffered_cnt~0_21) (= v_~z$read_delayed_var~0.base_8 0) (< 0 |v_#StackHeapBarrier_17|) (= |v_#valid_54| (store .cse0 |v_ULTIMATE.start_main_~#t278~0.base_23| 1)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t278~0.base_23| 4)) (= v_~z$r_buff0_thd0~0_21 0) (= v_~x~0_10 0) (= 0 v_~z$flush_delayed~0_17) (= v_~z$r_buff0_thd2~0_58 0) (= 0 v_~__unbuffered_p2_EAX~0_15) (= 0 v_~weak$$choice2~0_33) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t278~0.base_23|) (= |v_ULTIMATE.start_main_~#t278~0.offset_18| 0) (= v_~__unbuffered_p2_EBX~0_15 0) (= 0 v_~z$r_buff1_thd0~0_26) (= 0 v_~z$w_buff1_used~0_74) (= 0 v_~__unbuffered_p0_EAX~0_17) (= |v_#NULL.offset_5| 0) (= 0 v_~y~0_8) (= 0 v_~z$w_buff1~0_33) (= v_~z$mem_tmp~0_12 0) (= 0 v_~z$w_buff0~0_39) (= 0 |v_#NULL.base_5|) (= v_~z$read_delayed_var~0.offset_8 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ULTIMATE.start_main_~#t279~0.base=|v_ULTIMATE.start_main_~#t279~0.base_19|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_32, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t280~0.offset=|v_ULTIMATE.start_main_~#t280~0.offset_15|, ULTIMATE.start_main_~#t278~0.offset=|v_ULTIMATE.start_main_~#t278~0.offset_18|, ~a~0=v_~a~0_9, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_21, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_15, ~z$mem_tmp~0=v_~z$mem_tmp~0_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_15, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_12|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_74, ~z$flush_delayed~0=v_~z$flush_delayed~0_17, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_24|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_10|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_8, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_79, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_10, ULTIMATE.start_main_~#t278~0.base=|v_ULTIMATE.start_main_~#t278~0.base_23|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_33, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_26, ~y~0=v_~y~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_58, ULTIMATE.start_main_~#t280~0.base=|v_ULTIMATE.start_main_~#t280~0.base_18|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_138, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_41, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_13|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_10|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_10|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_28, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_10, ULTIMATE.start_main_~#t279~0.offset=|v_ULTIMATE.start_main_~#t279~0.offset_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t279~0.base, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t280~0.offset, ULTIMATE.start_main_~#t278~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t278~0.base, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t280~0.base, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t279~0.offset] because there is no mapped edge [2019-12-18 20:18:33,047 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L840-1-->L842: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t279~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t279~0.base_11|) |v_ULTIMATE.start_main_~#t279~0.offset_10| 1)) |v_#memory_int_13|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t279~0.base_11|)) (= |v_ULTIMATE.start_main_~#t279~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t279~0.base_11|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t279~0.base_11| 4)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t279~0.base_11|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t279~0.base_11| 1) |v_#valid_34|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t279~0.base=|v_ULTIMATE.start_main_~#t279~0.base_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t279~0.offset=|v_ULTIMATE.start_main_~#t279~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t279~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t279~0.offset] because there is no mapped edge [2019-12-18 20:18:33,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L842-1-->L844: Formula: (and (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t280~0.base_9| 1) |v_#valid_27|) (not (= |v_ULTIMATE.start_main_~#t280~0.base_9| 0)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t280~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t280~0.base_9|) |v_ULTIMATE.start_main_~#t280~0.offset_8| 2))) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t280~0.base_9|) (= 0 |v_ULTIMATE.start_main_~#t280~0.offset_8|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t280~0.base_9| 4)) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t280~0.base_9|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_27|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t280~0.offset=|v_ULTIMATE.start_main_~#t280~0.offset_8|, ULTIMATE.start_main_~#t280~0.base=|v_ULTIMATE.start_main_~#t280~0.base_9|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t280~0.offset, ULTIMATE.start_main_~#t280~0.base] because there is no mapped edge [2019-12-18 20:18:33,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [929] [929] P2ENTRY-->L4-3: Formula: (and (= (mod v_~z$w_buff1_used~0_58 256) 0) (= 1 v_~z$w_buff0~0_25) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_~z$w_buff0_used~0_108 v_~z$w_buff1_used~0_58) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5| v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_7) (= v_~z$w_buff0_used~0_107 1) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= v_~z$w_buff0~0_26 v_~z$w_buff1~0_23)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_108, ~z$w_buff0~0=v_~z$w_buff0~0_26, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_107, ~z$w_buff0~0=v_~z$w_buff0~0_25, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_58, ~z$w_buff1~0=v_~z$w_buff1~0_23, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_7} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 20:18:33,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [969] [969] L802-2-->L802-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1624392371 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1624392371 256) 0))) (or (and (= ~z$w_buff1~0_In-1624392371 |P2Thread1of1ForFork0_#t~ite28_Out-1624392371|) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite28_Out-1624392371| ~z$w_buff0~0_In-1624392371) (not .cse0) (not .cse1)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1624392371, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1624392371, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1624392371, ~z$w_buff1~0=~z$w_buff1~0_In-1624392371} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-1624392371|, ~z$w_buff0~0=~z$w_buff0~0_In-1624392371, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1624392371, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1624392371, ~z$w_buff1~0=~z$w_buff1~0_In-1624392371} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 20:18:33,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [886] [886] L802-4-->L803: Formula: (= v_~z~0_19 |v_P2Thread1of1ForFork0_#t~ite28_8|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_8|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_7|, ~z~0=v_~z~0_19, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, ~z~0, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 20:18:33,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L807-->L808: Formula: (and (= v_~z$r_buff0_thd3~0_48 v_~z$r_buff0_thd3~0_47) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_48, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 20:18:33,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [956] [956] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In937424543 256)))) (or (and (not .cse0) (= ~z$mem_tmp~0_In937424543 |P2Thread1of1ForFork0_#t~ite48_Out937424543|)) (and (= ~z~0_In937424543 |P2Thread1of1ForFork0_#t~ite48_Out937424543|) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In937424543, ~z$flush_delayed~0=~z$flush_delayed~0_In937424543, ~z~0=~z~0_In937424543} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out937424543|, ~z$mem_tmp~0=~z$mem_tmp~0_In937424543, ~z$flush_delayed~0=~z$flush_delayed~0_In937424543, ~z~0=~z~0_In937424543} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-18 20:18:33,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 1 v_~a~0_5) (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= v_~__unbuffered_p0_EAX~0_6 v_~x~0_5) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_5} OutVars{~a~0=v_~a~0_5, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_5, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 20:18:33,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [967] [967] L818-->L818-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1862691860 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In1862691860 256) 0))) (or (and (= ~z$w_buff0_used~0_In1862691860 |P2Thread1of1ForFork0_#t~ite51_Out1862691860|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork0_#t~ite51_Out1862691860|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1862691860, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1862691860} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1862691860, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1862691860, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out1862691860|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-18 20:18:33,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L819-->L819-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In-2146526228 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-2146526228 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-2146526228 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-2146526228 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite52_Out-2146526228| ~z$w_buff1_used~0_In-2146526228)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite52_Out-2146526228|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2146526228, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2146526228, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2146526228, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2146526228} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2146526228, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2146526228, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2146526228, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out-2146526228|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2146526228} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-18 20:18:33,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L820-->L821: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In83094544 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In83094544 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd3~0_In83094544 ~z$r_buff0_thd3~0_Out83094544)) (and (not .cse0) (= ~z$r_buff0_thd3~0_Out83094544 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In83094544, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In83094544} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In83094544, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out83094544, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out83094544|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-18 20:18:33,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L821-->L821-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1267007223 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In-1267007223 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1267007223 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1267007223 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite54_Out-1267007223| 0)) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork0_#t~ite54_Out-1267007223| ~z$r_buff1_thd3~0_In-1267007223) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1267007223, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1267007223, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1267007223, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1267007223} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1267007223, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out-1267007223|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1267007223, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1267007223, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1267007223} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-18 20:18:33,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L821-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_35 |v_P2Thread1of1ForFork0_#t~ite54_8|)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_35, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 20:18:33,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-1843358820 256) 0))) (or (and .cse0 (= ~z~0_In-1843358820 |P1Thread1of1ForFork2_#t~ite25_Out-1843358820|)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite25_Out-1843358820| ~z$mem_tmp~0_In-1843358820)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1843358820, ~z$flush_delayed~0=~z$flush_delayed~0_In-1843358820, ~z~0=~z~0_In-1843358820} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1843358820, ~z$flush_delayed~0=~z$flush_delayed~0_In-1843358820, ~z~0=~z~0_In-1843358820, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-1843358820|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 20:18:33,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L773-2-->P1EXIT: Formula: (and (= 0 v_~z$flush_delayed~0_13) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= |v_P1Thread1of1ForFork2_#t~ite25_8| v_~z~0_24) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~z~0=v_~z~0_24, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 20:18:33,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [902] [902] L848-->L850-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_96 256)) (= 0 (mod v_~z$r_buff0_thd0~0_15 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_96, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_96, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 20:18:33,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L850-2-->L850-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite59_Out382701272| |ULTIMATE.start_main_#t~ite58_Out382701272|)) (.cse2 (= (mod ~z$w_buff1_used~0_In382701272 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In382701272 256)))) (or (and .cse0 (not .cse1) (not .cse2) (= |ULTIMATE.start_main_#t~ite58_Out382701272| ~z$w_buff1~0_In382701272)) (and .cse0 (= |ULTIMATE.start_main_#t~ite58_Out382701272| ~z~0_In382701272) (or .cse2 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In382701272, ~z$w_buff1_used~0=~z$w_buff1_used~0_In382701272, ~z$w_buff1~0=~z$w_buff1~0_In382701272, ~z~0=~z~0_In382701272} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In382701272, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out382701272|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In382701272, ~z$w_buff1~0=~z$w_buff1~0_In382701272, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out382701272|, ~z~0=~z~0_In382701272} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-18 20:18:33,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L851-->L851-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1051292042 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1051292042 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1051292042 |ULTIMATE.start_main_#t~ite60_Out-1051292042|)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite60_Out-1051292042| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1051292042, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1051292042} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-1051292042|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1051292042, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1051292042} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-18 20:18:33,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L852-->L852-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1298622944 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1298622944 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1298622944 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1298622944 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1298622944 |ULTIMATE.start_main_#t~ite61_Out1298622944|)) (and (= 0 |ULTIMATE.start_main_#t~ite61_Out1298622944|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1298622944, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1298622944, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1298622944, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1298622944} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1298622944, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1298622944|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1298622944, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1298622944, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1298622944} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-18 20:18:33,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L853-->L853-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1309526817 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1309526817 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite62_Out1309526817| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite62_Out1309526817| ~z$r_buff0_thd0~0_In1309526817)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1309526817, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1309526817} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1309526817|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1309526817, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1309526817} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-18 20:18:33,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L854-->L854-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-1589915649 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-1589915649 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-1589915649 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1589915649 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite63_Out-1589915649|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite63_Out-1589915649| ~z$r_buff1_thd0~0_In-1589915649) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1589915649, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1589915649, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1589915649, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1589915649} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1589915649|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1589915649, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1589915649, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1589915649, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1589915649} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-18 20:18:33,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1011] [1011] L854-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_10 256)) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~main$tmp_guard1~0_10 0) (= v_~__unbuffered_p2_EBX~0_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start_main_#t~ite63_15| v_~z$r_buff1_thd0~0_18) (= 0 v_~__unbuffered_p0_EAX~0_11) (= 1 v_~__unbuffered_p1_EAX~0_9) (= v_~__unbuffered_p2_EAX~0_9 1)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_15|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_14|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 20:18:33,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 08:18:33 BasicIcfg [2019-12-18 20:18:33,200 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 20:18:33,201 INFO L168 Benchmark]: Toolchain (without parser) took 100624.61 ms. Allocated memory was 138.4 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 101.9 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 20:18:33,202 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 20:18:33,203 INFO L168 Benchmark]: CACSL2BoogieTranslator took 826.31 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.5 MB in the beginning and 155.4 MB in the end (delta: -53.9 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2019-12-18 20:18:33,203 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.51 ms. Allocated memory is still 202.9 MB. Free memory was 155.4 MB in the beginning and 152.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 20:18:33,204 INFO L168 Benchmark]: Boogie Preprocessor took 38.24 ms. Allocated memory is still 202.9 MB. Free memory was 152.7 MB in the beginning and 150.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 20:18:33,204 INFO L168 Benchmark]: RCFGBuilder took 929.09 ms. Allocated memory is still 202.9 MB. Free memory was 150.0 MB in the beginning and 94.4 MB in the end (delta: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 7.1 GB. [2019-12-18 20:18:33,205 INFO L168 Benchmark]: TraceAbstraction took 98760.20 ms. Allocated memory was 202.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 93.8 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-18 20:18:33,209 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.48 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 826.31 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.5 MB in the beginning and 155.4 MB in the end (delta: -53.9 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.51 ms. Allocated memory is still 202.9 MB. Free memory was 155.4 MB in the beginning and 152.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.24 ms. Allocated memory is still 202.9 MB. Free memory was 152.7 MB in the beginning and 150.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 929.09 ms. Allocated memory is still 202.9 MB. Free memory was 150.0 MB in the beginning and 94.4 MB in the end (delta: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 98760.20 ms. Allocated memory was 202.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 93.8 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.5s, 197 ProgramPointsBefore, 106 ProgramPointsAfterwards, 243 TransitionsBefore, 126 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 51 ConcurrentYvCompositions, 30 ChoiceCompositions, 8928 VarBasedMoverChecksPositive, 249 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 134090 CheckedPairsTotal, 127 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L840] FCALL, FORK 0 pthread_create(&t278, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] FCALL, FORK 0 pthread_create(&t279, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L844] FCALL, FORK 0 pthread_create(&t280, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L792] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L793] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L794] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L795] 3 z$r_buff0_thd3 = (_Bool)1 [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 z$flush_delayed = weak$$choice2 [L801] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=7, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=7, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L804] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L804] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L805] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L805] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L806] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 3 z = z$flush_delayed ? z$mem_tmp : z [L811] 3 z$flush_delayed = (_Bool)0 [L814] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 2 x = 1 [L755] 2 y = 1 [L758] 2 __unbuffered_p1_EAX = y [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 z$flush_delayed = weak$$choice2 [L764] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L818] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L765] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L819] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L766] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L767] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L768] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L769] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=8, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L771] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=8, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_EBX = z VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L851] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L852] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L853] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 188 locations, 2 error locations. Result: UNSAFE, OverallTime: 98.3s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 22.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4345 SDtfs, 6868 SDslu, 10867 SDs, 0 SdLazy, 3687 SolverSat, 164 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102196occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 65.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 182046 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 713 NumberOfCodeBlocks, 713 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 631 ConstructedInterpolants, 0 QuantifiedInterpolants, 86940 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...