/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe031_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 15:09:22,353 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 15:09:22,355 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 15:09:22,368 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 15:09:22,368 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 15:09:22,369 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 15:09:22,370 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 15:09:22,372 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 15:09:22,374 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 15:09:22,375 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 15:09:22,376 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 15:09:22,377 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 15:09:22,377 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 15:09:22,378 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 15:09:22,379 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 15:09:22,380 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 15:09:22,381 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 15:09:22,382 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 15:09:22,383 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 15:09:22,385 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 15:09:22,387 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 15:09:22,388 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 15:09:22,389 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 15:09:22,390 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 15:09:22,392 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 15:09:22,392 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 15:09:22,393 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 15:09:22,394 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 15:09:22,394 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 15:09:22,395 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 15:09:22,395 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 15:09:22,396 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 15:09:22,397 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 15:09:22,397 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 15:09:22,398 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 15:09:22,399 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 15:09:22,399 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 15:09:22,399 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 15:09:22,400 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 15:09:22,401 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 15:09:22,401 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 15:09:22,402 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 15:09:22,416 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 15:09:22,416 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 15:09:22,417 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 15:09:22,417 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 15:09:22,417 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 15:09:22,418 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 15:09:22,418 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 15:09:22,418 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 15:09:22,418 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 15:09:22,419 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 15:09:22,419 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 15:09:22,419 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 15:09:22,419 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 15:09:22,419 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 15:09:22,420 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 15:09:22,420 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 15:09:22,420 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 15:09:22,420 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 15:09:22,420 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 15:09:22,421 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 15:09:22,421 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 15:09:22,421 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 15:09:22,421 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 15:09:22,421 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 15:09:22,422 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 15:09:22,422 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 15:09:22,422 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 15:09:22,422 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 15:09:22,422 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 15:09:22,423 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 15:09:22,730 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 15:09:22,746 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 15:09:22,749 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 15:09:22,751 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 15:09:22,751 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 15:09:22,753 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_power.oepc.i [2019-12-18 15:09:22,832 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e43ce1da1/637adeb3c4f144ff87423138037071f1/FLAGfc5b63919 [2019-12-18 15:09:23,322 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 15:09:23,323 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_power.oepc.i [2019-12-18 15:09:23,349 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e43ce1da1/637adeb3c4f144ff87423138037071f1/FLAGfc5b63919 [2019-12-18 15:09:23,599 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e43ce1da1/637adeb3c4f144ff87423138037071f1 [2019-12-18 15:09:23,609 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 15:09:23,611 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 15:09:23,614 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 15:09:23,614 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 15:09:23,618 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 15:09:23,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:09:23" (1/1) ... [2019-12-18 15:09:23,622 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12e0c6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:23, skipping insertion in model container [2019-12-18 15:09:23,622 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:09:23" (1/1) ... [2019-12-18 15:09:23,631 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 15:09:23,705 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 15:09:24,234 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:09:24,250 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 15:09:24,375 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:09:24,448 INFO L208 MainTranslator]: Completed translation [2019-12-18 15:09:24,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:24 WrapperNode [2019-12-18 15:09:24,448 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 15:09:24,449 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 15:09:24,449 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 15:09:24,450 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 15:09:24,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:24" (1/1) ... [2019-12-18 15:09:24,479 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:24" (1/1) ... [2019-12-18 15:09:24,524 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 15:09:24,524 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 15:09:24,525 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 15:09:24,525 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 15:09:24,533 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:24" (1/1) ... [2019-12-18 15:09:24,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:24" (1/1) ... [2019-12-18 15:09:24,539 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:24" (1/1) ... [2019-12-18 15:09:24,540 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:24" (1/1) ... [2019-12-18 15:09:24,551 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:24" (1/1) ... [2019-12-18 15:09:24,555 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:24" (1/1) ... [2019-12-18 15:09:24,559 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:24" (1/1) ... [2019-12-18 15:09:24,564 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 15:09:24,564 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 15:09:24,564 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 15:09:24,564 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 15:09:24,565 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:24" (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 15:09:24,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 15:09:24,626 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 15:09:24,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 15:09:24,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 15:09:24,627 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 15:09:24,627 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 15:09:24,627 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 15:09:24,627 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 15:09:24,627 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 15:09:24,628 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 15:09:24,628 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 15:09:24,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 15:09:24,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 15:09:24,630 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 15:09:25,453 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 15:09:25,454 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 15:09:25,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:09:25 BoogieIcfgContainer [2019-12-18 15:09:25,455 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 15:09:25,457 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 15:09:25,457 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 15:09:25,461 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 15:09:25,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 03:09:23" (1/3) ... [2019-12-18 15:09:25,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3424ae2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:09:25, skipping insertion in model container [2019-12-18 15:09:25,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:09:24" (2/3) ... [2019-12-18 15:09:25,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3424ae2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:09:25, skipping insertion in model container [2019-12-18 15:09:25,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:09:25" (3/3) ... [2019-12-18 15:09:25,467 INFO L109 eAbstractionObserver]: Analyzing ICFG safe031_power.oepc.i [2019-12-18 15:09:25,479 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 15:09:25,480 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 15:09:25,491 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 15:09:25,492 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 15:09:25,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,555 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,556 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,587 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,587 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,588 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,588 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,588 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,596 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,596 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,606 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,607 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,607 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,613 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,613 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,617 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,618 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:09:25,654 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 15:09:25,672 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 15:09:25,673 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 15:09:25,673 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 15:09:25,673 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 15:09:25,673 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 15:09:25,673 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 15:09:25,673 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 15:09:25,673 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 15:09:25,690 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 193 transitions [2019-12-18 15:09:25,692 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-18 15:09:25,791 INFO L126 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-18 15:09:25,791 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:09:25,815 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 9/156 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 15:09:25,839 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-18 15:09:25,917 INFO L126 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-18 15:09:25,917 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:09:25,928 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 9/156 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 15:09:25,951 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 15:09:25,952 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 15:09:31,563 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 15:09:31,712 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 15:09:31,736 INFO L206 etLargeBlockEncoding]: Checked pairs total: 64880 [2019-12-18 15:09:31,737 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-18 15:09:31,740 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-18 15:09:42,761 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 83222 states. [2019-12-18 15:09:42,763 INFO L276 IsEmpty]: Start isEmpty. Operand 83222 states. [2019-12-18 15:09:42,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 15:09:42,769 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:42,770 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 15:09:42,771 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:42,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:42,776 INFO L82 PathProgramCache]: Analyzing trace with hash 793650723, now seen corresponding path program 1 times [2019-12-18 15:09:42,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:42,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870743325] [2019-12-18 15:09:42,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:42,983 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 15:09:42,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870743325] [2019-12-18 15:09:42,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:42,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 15:09:42,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760218765] [2019-12-18 15:09:42,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:09:42,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:43,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:09:43,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:09:43,008 INFO L87 Difference]: Start difference. First operand 83222 states. Second operand 3 states. [2019-12-18 15:09:43,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:43,981 INFO L93 Difference]: Finished difference Result 82272 states and 355122 transitions. [2019-12-18 15:09:43,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:09:43,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 15:09:43,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:46,876 INFO L225 Difference]: With dead ends: 82272 [2019-12-18 15:09:46,876 INFO L226 Difference]: Without dead ends: 77232 [2019-12-18 15:09:46,878 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 15:09:49,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77232 states. [2019-12-18 15:09:51,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77232 to 77232. [2019-12-18 15:09:51,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77232 states. [2019-12-18 15:09:55,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77232 states to 77232 states and 332862 transitions. [2019-12-18 15:09:55,904 INFO L78 Accepts]: Start accepts. Automaton has 77232 states and 332862 transitions. Word has length 5 [2019-12-18 15:09:55,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:09:55,904 INFO L462 AbstractCegarLoop]: Abstraction has 77232 states and 332862 transitions. [2019-12-18 15:09:55,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:09:55,904 INFO L276 IsEmpty]: Start isEmpty. Operand 77232 states and 332862 transitions. [2019-12-18 15:09:55,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 15:09:55,919 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:09:55,919 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:09:55,920 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:09:55,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:09:55,920 INFO L82 PathProgramCache]: Analyzing trace with hash -187432799, now seen corresponding path program 1 times [2019-12-18 15:09:55,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:09:55,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104003716] [2019-12-18 15:09:55,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:09:55,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:09:56,065 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 15:09:56,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104003716] [2019-12-18 15:09:56,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:09:56,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:09:56,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369668430] [2019-12-18 15:09:56,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:09:56,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:09:56,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:09:56,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:09:56,069 INFO L87 Difference]: Start difference. First operand 77232 states and 332862 transitions. Second operand 4 states. [2019-12-18 15:09:57,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:09:57,003 INFO L93 Difference]: Finished difference Result 119112 states and 491884 transitions. [2019-12-18 15:09:57,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:09:57,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 15:09:57,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:09:57,495 INFO L225 Difference]: With dead ends: 119112 [2019-12-18 15:09:57,495 INFO L226 Difference]: Without dead ends: 119007 [2019-12-18 15:09:57,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 15:10:04,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119007 states. [2019-12-18 15:10:06,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119007 to 111499. [2019-12-18 15:10:06,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111499 states. [2019-12-18 15:10:06,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111499 states to 111499 states and 464543 transitions. [2019-12-18 15:10:06,675 INFO L78 Accepts]: Start accepts. Automaton has 111499 states and 464543 transitions. Word has length 13 [2019-12-18 15:10:06,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:10:06,676 INFO L462 AbstractCegarLoop]: Abstraction has 111499 states and 464543 transitions. [2019-12-18 15:10:06,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:10:06,676 INFO L276 IsEmpty]: Start isEmpty. Operand 111499 states and 464543 transitions. [2019-12-18 15:10:06,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 15:10:06,679 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:10:06,680 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:10:06,680 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:10:06,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:10:06,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1509262706, now seen corresponding path program 1 times [2019-12-18 15:10:06,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:10:06,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787898800] [2019-12-18 15:10:06,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:10:06,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:10:06,758 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 15:10:06,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787898800] [2019-12-18 15:10:06,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:10:06,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:10:06,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443274067] [2019-12-18 15:10:06,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:10:06,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:10:06,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:10:06,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:10:06,760 INFO L87 Difference]: Start difference. First operand 111499 states and 464543 transitions. Second operand 3 states. [2019-12-18 15:10:10,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:10:10,249 INFO L93 Difference]: Finished difference Result 27724 states and 93399 transitions. [2019-12-18 15:10:10,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:10:10,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 15:10:10,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:10:10,304 INFO L225 Difference]: With dead ends: 27724 [2019-12-18 15:10:10,304 INFO L226 Difference]: Without dead ends: 27724 [2019-12-18 15:10:10,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:10:10,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27724 states. [2019-12-18 15:10:10,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27724 to 27724. [2019-12-18 15:10:10,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27724 states. [2019-12-18 15:10:10,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27724 states to 27724 states and 93399 transitions. [2019-12-18 15:10:10,875 INFO L78 Accepts]: Start accepts. Automaton has 27724 states and 93399 transitions. Word has length 13 [2019-12-18 15:10:10,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:10:10,876 INFO L462 AbstractCegarLoop]: Abstraction has 27724 states and 93399 transitions. [2019-12-18 15:10:10,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:10:10,876 INFO L276 IsEmpty]: Start isEmpty. Operand 27724 states and 93399 transitions. [2019-12-18 15:10:10,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 15:10:10,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:10:10,878 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:10:10,878 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:10:10,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:10:10,878 INFO L82 PathProgramCache]: Analyzing trace with hash 2053226586, now seen corresponding path program 1 times [2019-12-18 15:10:10,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:10:10,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034579438] [2019-12-18 15:10:10,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:10:10,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:10:10,976 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 15:10:10,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034579438] [2019-12-18 15:10:10,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:10:10,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:10:10,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990990867] [2019-12-18 15:10:10,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:10:10,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:10:10,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:10:10,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:10:10,979 INFO L87 Difference]: Start difference. First operand 27724 states and 93399 transitions. Second operand 5 states. [2019-12-18 15:10:11,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:10:11,474 INFO L93 Difference]: Finished difference Result 40807 states and 134933 transitions. [2019-12-18 15:10:11,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 15:10:11,475 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 15:10:11,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:10:11,546 INFO L225 Difference]: With dead ends: 40807 [2019-12-18 15:10:11,546 INFO L226 Difference]: Without dead ends: 40789 [2019-12-18 15:10:11,546 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 15:10:11,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40789 states. [2019-12-18 15:10:12,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40789 to 32055. [2019-12-18 15:10:12,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32055 states. [2019-12-18 15:10:12,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32055 states to 32055 states and 107275 transitions. [2019-12-18 15:10:12,602 INFO L78 Accepts]: Start accepts. Automaton has 32055 states and 107275 transitions. Word has length 14 [2019-12-18 15:10:12,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:10:12,603 INFO L462 AbstractCegarLoop]: Abstraction has 32055 states and 107275 transitions. [2019-12-18 15:10:12,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:10:12,603 INFO L276 IsEmpty]: Start isEmpty. Operand 32055 states and 107275 transitions. [2019-12-18 15:10:12,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:10:12,613 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:10:12,614 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 15:10:12,614 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:10:12,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:10:12,614 INFO L82 PathProgramCache]: Analyzing trace with hash 112714396, now seen corresponding path program 1 times [2019-12-18 15:10:12,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:10:12,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086799045] [2019-12-18 15:10:12,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:10:12,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:10:12,711 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 15:10:12,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086799045] [2019-12-18 15:10:12,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:10:12,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 15:10:12,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840328596] [2019-12-18 15:10:12,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:10:12,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:10:12,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:10:12,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:10:12,713 INFO L87 Difference]: Start difference. First operand 32055 states and 107275 transitions. Second operand 6 states. [2019-12-18 15:10:13,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:10:13,416 INFO L93 Difference]: Finished difference Result 51183 states and 167445 transitions. [2019-12-18 15:10:13,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 15:10:13,417 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 15:10:13,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:10:13,508 INFO L225 Difference]: With dead ends: 51183 [2019-12-18 15:10:13,508 INFO L226 Difference]: Without dead ends: 51153 [2019-12-18 15:10:13,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 15:10:13,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51153 states. [2019-12-18 15:10:14,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51153 to 34768. [2019-12-18 15:10:14,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34768 states. [2019-12-18 15:10:14,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34768 states to 34768 states and 115556 transitions. [2019-12-18 15:10:14,634 INFO L78 Accepts]: Start accepts. Automaton has 34768 states and 115556 transitions. Word has length 22 [2019-12-18 15:10:14,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:10:14,634 INFO L462 AbstractCegarLoop]: Abstraction has 34768 states and 115556 transitions. [2019-12-18 15:10:14,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:10:14,634 INFO L276 IsEmpty]: Start isEmpty. Operand 34768 states and 115556 transitions. [2019-12-18 15:10:14,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:10:14,643 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:10:14,643 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 15:10:14,644 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:10:14,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:10:14,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1117346120, now seen corresponding path program 1 times [2019-12-18 15:10:14,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:10:14,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274543824] [2019-12-18 15:10:14,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:10:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:10:14,738 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 15:10:14,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274543824] [2019-12-18 15:10:14,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:10:14,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 15:10:14,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397181652] [2019-12-18 15:10:14,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:10:14,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:10:14,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:10:14,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:10:14,743 INFO L87 Difference]: Start difference. First operand 34768 states and 115556 transitions. Second operand 6 states. [2019-12-18 15:10:15,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:10:15,594 INFO L93 Difference]: Finished difference Result 51553 states and 167314 transitions. [2019-12-18 15:10:15,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:10:15,594 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 15:10:15,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:10:15,688 INFO L225 Difference]: With dead ends: 51553 [2019-12-18 15:10:15,688 INFO L226 Difference]: Without dead ends: 51523 [2019-12-18 15:10:15,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:10:15,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51523 states. [2019-12-18 15:10:16,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51523 to 36074. [2019-12-18 15:10:16,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36074 states. [2019-12-18 15:10:16,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36074 states to 36074 states and 118567 transitions. [2019-12-18 15:10:16,413 INFO L78 Accepts]: Start accepts. Automaton has 36074 states and 118567 transitions. Word has length 22 [2019-12-18 15:10:16,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:10:16,413 INFO L462 AbstractCegarLoop]: Abstraction has 36074 states and 118567 transitions. [2019-12-18 15:10:16,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:10:16,413 INFO L276 IsEmpty]: Start isEmpty. Operand 36074 states and 118567 transitions. [2019-12-18 15:10:16,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:10:16,427 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:10:16,427 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:10:16,427 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:10:16,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:10:16,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1691433742, now seen corresponding path program 1 times [2019-12-18 15:10:16,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:10:16,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452053037] [2019-12-18 15:10:16,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:10:16,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:10:16,476 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 15:10:16,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452053037] [2019-12-18 15:10:16,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:10:16,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:10:16,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259409735] [2019-12-18 15:10:16,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:10:16,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:10:16,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:10:16,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:10:16,479 INFO L87 Difference]: Start difference. First operand 36074 states and 118567 transitions. Second operand 4 states. [2019-12-18 15:10:16,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:10:16,551 INFO L93 Difference]: Finished difference Result 14149 states and 43172 transitions. [2019-12-18 15:10:16,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 15:10:16,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 15:10:16,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:10:16,572 INFO L225 Difference]: With dead ends: 14149 [2019-12-18 15:10:16,573 INFO L226 Difference]: Without dead ends: 14149 [2019-12-18 15:10:16,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:10:16,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14149 states. [2019-12-18 15:10:17,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14149 to 13955. [2019-12-18 15:10:17,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13955 states. [2019-12-18 15:10:17,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13955 states to 13955 states and 42611 transitions. [2019-12-18 15:10:17,037 INFO L78 Accepts]: Start accepts. Automaton has 13955 states and 42611 transitions. Word has length 25 [2019-12-18 15:10:17,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:10:17,038 INFO L462 AbstractCegarLoop]: Abstraction has 13955 states and 42611 transitions. [2019-12-18 15:10:17,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:10:17,038 INFO L276 IsEmpty]: Start isEmpty. Operand 13955 states and 42611 transitions. [2019-12-18 15:10:17,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 15:10:17,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:10:17,058 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:10:17,058 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:10:17,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:10:17,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1334742722, now seen corresponding path program 1 times [2019-12-18 15:10:17,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:10:17,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443141643] [2019-12-18 15:10:17,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:10:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:10:17,130 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 15:10:17,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443141643] [2019-12-18 15:10:17,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:10:17,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:10:17,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675363717] [2019-12-18 15:10:17,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:10:17,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:10:17,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:10:17,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:10:17,132 INFO L87 Difference]: Start difference. First operand 13955 states and 42611 transitions. Second operand 3 states. [2019-12-18 15:10:17,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:10:17,263 INFO L93 Difference]: Finished difference Result 25821 states and 78709 transitions. [2019-12-18 15:10:17,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:10:17,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 15:10:17,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:10:17,296 INFO L225 Difference]: With dead ends: 25821 [2019-12-18 15:10:17,297 INFO L226 Difference]: Without dead ends: 14420 [2019-12-18 15:10:17,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:10:17,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14420 states. [2019-12-18 15:10:17,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14420 to 14287. [2019-12-18 15:10:17,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14287 states. [2019-12-18 15:10:17,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14287 states to 14287 states and 42676 transitions. [2019-12-18 15:10:17,615 INFO L78 Accepts]: Start accepts. Automaton has 14287 states and 42676 transitions. Word has length 39 [2019-12-18 15:10:17,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:10:17,617 INFO L462 AbstractCegarLoop]: Abstraction has 14287 states and 42676 transitions. [2019-12-18 15:10:17,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:10:17,618 INFO L276 IsEmpty]: Start isEmpty. Operand 14287 states and 42676 transitions. [2019-12-18 15:10:17,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 15:10:17,645 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:10:17,645 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] [2019-12-18 15:10:17,646 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:10:17,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:10:17,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1169825091, now seen corresponding path program 1 times [2019-12-18 15:10:17,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:10:17,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388475819] [2019-12-18 15:10:17,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:10:17,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:10:17,708 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 15:10:17,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388475819] [2019-12-18 15:10:17,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:10:17,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 15:10:17,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500673365] [2019-12-18 15:10:17,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:10:17,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:10:17,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:10:17,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:10:17,711 INFO L87 Difference]: Start difference. First operand 14287 states and 42676 transitions. Second operand 5 states. [2019-12-18 15:10:17,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:10:17,792 INFO L93 Difference]: Finished difference Result 12923 states and 39241 transitions. [2019-12-18 15:10:17,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:10:17,793 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 15:10:17,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:10:17,810 INFO L225 Difference]: With dead ends: 12923 [2019-12-18 15:10:17,810 INFO L226 Difference]: Without dead ends: 10951 [2019-12-18 15:10:17,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:10:17,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10951 states. [2019-12-18 15:10:17,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10951 to 10573. [2019-12-18 15:10:17,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10573 states. [2019-12-18 15:10:17,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10573 states to 10573 states and 32791 transitions. [2019-12-18 15:10:17,974 INFO L78 Accepts]: Start accepts. Automaton has 10573 states and 32791 transitions. Word has length 40 [2019-12-18 15:10:17,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:10:17,974 INFO L462 AbstractCegarLoop]: Abstraction has 10573 states and 32791 transitions. [2019-12-18 15:10:17,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:10:17,974 INFO L276 IsEmpty]: Start isEmpty. Operand 10573 states and 32791 transitions. [2019-12-18 15:10:17,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 15:10:17,989 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:10:17,989 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] [2019-12-18 15:10:17,990 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:10:17,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:10:17,990 INFO L82 PathProgramCache]: Analyzing trace with hash 917917389, now seen corresponding path program 1 times [2019-12-18 15:10:17,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:10:17,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260744847] [2019-12-18 15:10:17,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:10:18,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:10:18,054 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 15:10:18,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260744847] [2019-12-18 15:10:18,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:10:18,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:10:18,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481714046] [2019-12-18 15:10:18,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:10:18,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:10:18,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:10:18,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:10:18,057 INFO L87 Difference]: Start difference. First operand 10573 states and 32791 transitions. Second operand 3 states. [2019-12-18 15:10:18,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:10:18,154 INFO L93 Difference]: Finished difference Result 14303 states and 43654 transitions. [2019-12-18 15:10:18,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:10:18,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 15:10:18,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:10:18,182 INFO L225 Difference]: With dead ends: 14303 [2019-12-18 15:10:18,182 INFO L226 Difference]: Without dead ends: 14303 [2019-12-18 15:10:18,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:10:18,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14303 states. [2019-12-18 15:10:18,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14303 to 11263. [2019-12-18 15:10:18,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11263 states. [2019-12-18 15:10:18,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11263 states to 11263 states and 34861 transitions. [2019-12-18 15:10:18,511 INFO L78 Accepts]: Start accepts. Automaton has 11263 states and 34861 transitions. Word has length 54 [2019-12-18 15:10:18,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:10:18,512 INFO L462 AbstractCegarLoop]: Abstraction has 11263 states and 34861 transitions. [2019-12-18 15:10:18,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:10:18,512 INFO L276 IsEmpty]: Start isEmpty. Operand 11263 states and 34861 transitions. [2019-12-18 15:10:18,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 15:10:18,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:10:18,542 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] [2019-12-18 15:10:18,542 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:10:18,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:10:18,542 INFO L82 PathProgramCache]: Analyzing trace with hash 2132180587, now seen corresponding path program 1 times [2019-12-18 15:10:18,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:10:18,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37499834] [2019-12-18 15:10:18,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:10:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:10:18,639 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 15:10:18,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37499834] [2019-12-18 15:10:18,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:10:18,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:10:18,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877611957] [2019-12-18 15:10:18,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:10:18,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:10:18,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:10:18,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:10:18,642 INFO L87 Difference]: Start difference. First operand 11263 states and 34861 transitions. Second operand 6 states. [2019-12-18 15:10:19,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:10:19,034 INFO L93 Difference]: Finished difference Result 33207 states and 101689 transitions. [2019-12-18 15:10:19,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 15:10:19,036 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-18 15:10:19,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:10:19,080 INFO L225 Difference]: With dead ends: 33207 [2019-12-18 15:10:19,081 INFO L226 Difference]: Without dead ends: 23787 [2019-12-18 15:10:19,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-18 15:10:19,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23787 states. [2019-12-18 15:10:19,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23787 to 13957. [2019-12-18 15:10:19,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13957 states. [2019-12-18 15:10:19,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13957 states to 13957 states and 43447 transitions. [2019-12-18 15:10:19,522 INFO L78 Accepts]: Start accepts. Automaton has 13957 states and 43447 transitions. Word has length 54 [2019-12-18 15:10:19,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:10:19,523 INFO L462 AbstractCegarLoop]: Abstraction has 13957 states and 43447 transitions. [2019-12-18 15:10:19,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:10:19,523 INFO L276 IsEmpty]: Start isEmpty. Operand 13957 states and 43447 transitions. [2019-12-18 15:10:19,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 15:10:19,539 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:10:19,539 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] [2019-12-18 15:10:19,539 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:10:19,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:10:19,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1318577837, now seen corresponding path program 2 times [2019-12-18 15:10:19,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:10:19,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802501730] [2019-12-18 15:10:19,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:10:19,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:10:19,627 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 15:10:19,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802501730] [2019-12-18 15:10:19,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:10:19,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 15:10:19,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68927355] [2019-12-18 15:10:19,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:10:19,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:10:19,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:10:19,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:10:19,629 INFO L87 Difference]: Start difference. First operand 13957 states and 43447 transitions. Second operand 7 states. [2019-12-18 15:10:20,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:10:20,123 INFO L93 Difference]: Finished difference Result 33199 states and 101841 transitions. [2019-12-18 15:10:20,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:10:20,123 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 15:10:20,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:10:20,168 INFO L225 Difference]: With dead ends: 33199 [2019-12-18 15:10:20,168 INFO L226 Difference]: Without dead ends: 25551 [2019-12-18 15:10:20,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:10:20,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25551 states. [2019-12-18 15:10:20,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25551 to 16624. [2019-12-18 15:10:20,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16624 states. [2019-12-18 15:10:20,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16624 states to 16624 states and 51830 transitions. [2019-12-18 15:10:20,508 INFO L78 Accepts]: Start accepts. Automaton has 16624 states and 51830 transitions. Word has length 54 [2019-12-18 15:10:20,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:10:20,508 INFO L462 AbstractCegarLoop]: Abstraction has 16624 states and 51830 transitions. [2019-12-18 15:10:20,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:10:20,508 INFO L276 IsEmpty]: Start isEmpty. Operand 16624 states and 51830 transitions. [2019-12-18 15:10:20,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 15:10:20,526 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:10:20,526 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] [2019-12-18 15:10:20,526 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:10:20,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:10:20,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1742027941, now seen corresponding path program 3 times [2019-12-18 15:10:20,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:10:20,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656706576] [2019-12-18 15:10:20,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:10:20,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:10:20,608 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 15:10:20,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656706576] [2019-12-18 15:10:20,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:10:20,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 15:10:20,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411288663] [2019-12-18 15:10:20,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:10:20,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:10:20,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:10:20,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:10:20,611 INFO L87 Difference]: Start difference. First operand 16624 states and 51830 transitions. Second operand 7 states. [2019-12-18 15:10:21,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:10:21,060 INFO L93 Difference]: Finished difference Result 29813 states and 90433 transitions. [2019-12-18 15:10:21,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 15:10:21,060 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 15:10:21,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:10:21,114 INFO L225 Difference]: With dead ends: 29813 [2019-12-18 15:10:21,114 INFO L226 Difference]: Without dead ends: 27722 [2019-12-18 15:10:21,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:10:21,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27722 states. [2019-12-18 15:10:21,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27722 to 16706. [2019-12-18 15:10:21,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16706 states. [2019-12-18 15:10:21,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16706 states to 16706 states and 52124 transitions. [2019-12-18 15:10:21,633 INFO L78 Accepts]: Start accepts. Automaton has 16706 states and 52124 transitions. Word has length 54 [2019-12-18 15:10:21,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:10:21,634 INFO L462 AbstractCegarLoop]: Abstraction has 16706 states and 52124 transitions. [2019-12-18 15:10:21,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:10:21,634 INFO L276 IsEmpty]: Start isEmpty. Operand 16706 states and 52124 transitions. [2019-12-18 15:10:21,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 15:10:21,661 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:10:21,661 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] [2019-12-18 15:10:21,661 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:10:21,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:10:21,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1733304659, now seen corresponding path program 1 times [2019-12-18 15:10:21,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:10:21,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622956774] [2019-12-18 15:10:21,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:10:21,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:10:21,702 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 15:10:21,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622956774] [2019-12-18 15:10:21,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:10:21,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:10:21,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217273031] [2019-12-18 15:10:21,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:10:21,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:10:21,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:10:21,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:10:21,705 INFO L87 Difference]: Start difference. First operand 16706 states and 52124 transitions. Second operand 3 states. [2019-12-18 15:10:21,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:10:21,961 INFO L93 Difference]: Finished difference Result 18535 states and 56308 transitions. [2019-12-18 15:10:21,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:10:21,961 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 15:10:21,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:10:21,994 INFO L225 Difference]: With dead ends: 18535 [2019-12-18 15:10:21,994 INFO L226 Difference]: Without dead ends: 18535 [2019-12-18 15:10:21,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:10:22,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18535 states. [2019-12-18 15:10:22,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18535 to 15978. [2019-12-18 15:10:22,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15978 states. [2019-12-18 15:10:22,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15978 states to 15978 states and 49163 transitions. [2019-12-18 15:10:22,259 INFO L78 Accepts]: Start accepts. Automaton has 15978 states and 49163 transitions. Word has length 54 [2019-12-18 15:10:22,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:10:22,259 INFO L462 AbstractCegarLoop]: Abstraction has 15978 states and 49163 transitions. [2019-12-18 15:10:22,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:10:22,259 INFO L276 IsEmpty]: Start isEmpty. Operand 15978 states and 49163 transitions. [2019-12-18 15:10:22,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 15:10:22,280 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:10:22,280 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] [2019-12-18 15:10:22,280 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:10:22,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:10:22,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1573799015, now seen corresponding path program 4 times [2019-12-18 15:10:22,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:10:22,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890823673] [2019-12-18 15:10:22,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:10:22,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:10:22,365 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 15:10:22,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890823673] [2019-12-18 15:10:22,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:10:22,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 15:10:22,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346471653] [2019-12-18 15:10:22,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:10:22,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:10:22,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:10:22,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:10:22,367 INFO L87 Difference]: Start difference. First operand 15978 states and 49163 transitions. Second operand 7 states. [2019-12-18 15:10:22,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:10:22,769 INFO L93 Difference]: Finished difference Result 31956 states and 95510 transitions. [2019-12-18 15:10:22,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 15:10:22,769 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 15:10:22,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:10:22,819 INFO L225 Difference]: With dead ends: 31956 [2019-12-18 15:10:22,820 INFO L226 Difference]: Without dead ends: 26966 [2019-12-18 15:10:22,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 15:10:22,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26966 states. [2019-12-18 15:10:23,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26966 to 16134. [2019-12-18 15:10:23,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16134 states. [2019-12-18 15:10:23,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16134 states to 16134 states and 49593 transitions. [2019-12-18 15:10:23,156 INFO L78 Accepts]: Start accepts. Automaton has 16134 states and 49593 transitions. Word has length 54 [2019-12-18 15:10:23,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:10:23,156 INFO L462 AbstractCegarLoop]: Abstraction has 16134 states and 49593 transitions. [2019-12-18 15:10:23,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:10:23,156 INFO L276 IsEmpty]: Start isEmpty. Operand 16134 states and 49593 transitions. [2019-12-18 15:10:23,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 15:10:23,177 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:10:23,178 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] [2019-12-18 15:10:23,178 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:10:23,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:10:23,178 INFO L82 PathProgramCache]: Analyzing trace with hash 721174547, now seen corresponding path program 5 times [2019-12-18 15:10:23,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:10:23,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102962814] [2019-12-18 15:10:23,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:10:23,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:10:23,261 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 15:10:23,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102962814] [2019-12-18 15:10:23,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:10:23,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:10:23,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305489132] [2019-12-18 15:10:23,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:10:23,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:10:23,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:10:23,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:10:23,263 INFO L87 Difference]: Start difference. First operand 16134 states and 49593 transitions. Second operand 3 states. [2019-12-18 15:10:23,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:10:23,316 INFO L93 Difference]: Finished difference Result 12976 states and 38987 transitions. [2019-12-18 15:10:23,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:10:23,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 15:10:23,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:10:23,332 INFO L225 Difference]: With dead ends: 12976 [2019-12-18 15:10:23,333 INFO L226 Difference]: Without dead ends: 12976 [2019-12-18 15:10:23,333 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 15:10:23,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12976 states. [2019-12-18 15:10:23,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12976 to 12502. [2019-12-18 15:10:23,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12502 states. [2019-12-18 15:10:23,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12502 states to 12502 states and 37525 transitions. [2019-12-18 15:10:23,504 INFO L78 Accepts]: Start accepts. Automaton has 12502 states and 37525 transitions. Word has length 54 [2019-12-18 15:10:23,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:10:23,504 INFO L462 AbstractCegarLoop]: Abstraction has 12502 states and 37525 transitions. [2019-12-18 15:10:23,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:10:23,504 INFO L276 IsEmpty]: Start isEmpty. Operand 12502 states and 37525 transitions. [2019-12-18 15:10:23,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 15:10:23,517 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:10:23,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] [2019-12-18 15:10:23,517 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:10:23,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:10:23,518 INFO L82 PathProgramCache]: Analyzing trace with hash 262840158, now seen corresponding path program 1 times [2019-12-18 15:10:23,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:10:23,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517458115] [2019-12-18 15:10:23,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:10:23,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:10:23,618 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 15:10:23,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517458115] [2019-12-18 15:10:23,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:10:23,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:10:23,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007214561] [2019-12-18 15:10:23,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:10:23,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:10:23,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:10:23,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:10:23,620 INFO L87 Difference]: Start difference. First operand 12502 states and 37525 transitions. Second operand 3 states. [2019-12-18 15:10:23,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:10:23,680 INFO L93 Difference]: Finished difference Result 12502 states and 37523 transitions. [2019-12-18 15:10:23,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:10:23,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 15:10:23,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:10:23,702 INFO L225 Difference]: With dead ends: 12502 [2019-12-18 15:10:23,703 INFO L226 Difference]: Without dead ends: 12502 [2019-12-18 15:10:23,703 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 15:10:23,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12502 states. [2019-12-18 15:10:23,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12502 to 10981. [2019-12-18 15:10:23,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10981 states. [2019-12-18 15:10:24,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10981 states to 10981 states and 33292 transitions. [2019-12-18 15:10:24,010 INFO L78 Accepts]: Start accepts. Automaton has 10981 states and 33292 transitions. Word has length 55 [2019-12-18 15:10:24,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:10:24,010 INFO L462 AbstractCegarLoop]: Abstraction has 10981 states and 33292 transitions. [2019-12-18 15:10:24,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:10:24,011 INFO L276 IsEmpty]: Start isEmpty. Operand 10981 states and 33292 transitions. [2019-12-18 15:10:24,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 15:10:24,036 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:10:24,036 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] [2019-12-18 15:10:24,036 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:10:24,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:10:24,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1377038518, now seen corresponding path program 1 times [2019-12-18 15:10:24,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:10:24,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287724753] [2019-12-18 15:10:24,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:10:24,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:10:24,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:10:24,417 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 15:10:24,417 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 15:10:24,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] ULTIMATE.startENTRY-->L816: Formula: (let ((.cse0 (store |v_#valid_78| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x~0_189) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2513~0.base_30| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2513~0.base_30|) |v_ULTIMATE.start_main_~#t2513~0.offset_17| 0)) |v_#memory_int_21|) (= v_~main$tmp_guard0~0_19 0) (= 0 v_~x$w_buff0~0_458) (= 0 v_~x$w_buff1~0_338) (= v_~main$tmp_guard1~0_59 0) (< 0 |v_#StackHeapBarrier_17|) (= (select .cse0 |v_ULTIMATE.start_main_~#t2513~0.base_30|) 0) (= v_~x$mem_tmp~0_36 0) (= 0 v_~__unbuffered_p0_EAX~0_70) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2513~0.base_30| 4)) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2513~0.base_30|) (= 0 v_~weak$$choice0~0_29) (= 0 v_~x$read_delayed~0_6) (= v_~__unbuffered_cnt~0_127 0) (= 0 v_~x$r_buff1_thd2~0_267) (= 0 v_~x$w_buff0_used~0_920) (= (store .cse0 |v_ULTIMATE.start_main_~#t2513~0.base_30| 1) |v_#valid_76|) (= 0 v_~x$w_buff1_used~0_659) (= 0 v_~x$r_buff0_thd2~0_309) (= 0 v_~x$r_buff1_thd3~0_288) (= v_~x$r_buff1_thd1~0_390 0) (= v_~y~0_272 0) (= v_~weak$$choice2~0_165 0) (= 0 v_~x$r_buff0_thd3~0_149) (= v_~x$r_buff0_thd1~0_356 0) (= |v_#NULL.offset_5| 0) (= v_~z~0_94 0) (= v_~x$flush_delayed~0_66 0) (= 0 |v_ULTIMATE.start_main_~#t2513~0.offset_17|) (= 0 |v_#NULL.base_5|) (= v_~x$r_buff0_thd0~0_158 0) (= v_~x$r_buff1_thd0~0_324 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_78|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_458, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_356, ~x$flush_delayed~0=v_~x$flush_delayed~0_66, ULTIMATE.start_main_~#t2513~0.base=|v_ULTIMATE.start_main_~#t2513~0.base_30|, ULTIMATE.start_main_~#t2513~0.offset=|v_ULTIMATE.start_main_~#t2513~0.offset_17|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_124|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_288, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_390, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_59, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_149, ~x$mem_tmp~0=v_~x$mem_tmp~0_36, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_42|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_226|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_70, ULTIMATE.start_main_~#t2515~0.base=|v_ULTIMATE.start_main_~#t2515~0.base_24|, #length=|v_#length_23|, ~y~0=v_~y~0_272, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_158, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_18|, ULTIMATE.start_main_~#t2514~0.offset=|v_ULTIMATE.start_main_~#t2514~0.offset_18|, ~x$w_buff1~0=v_~x$w_buff1~0_338, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_659, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_267, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_324, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_309, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_920, ~weak$$choice0~0=v_~weak$$choice0~0_29, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t2515~0.offset=|v_ULTIMATE.start_main_~#t2515~0.offset_18|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_37|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_94, ~weak$$choice2~0=v_~weak$$choice2~0_165, ~x~0=v_~x~0_189, ULTIMATE.start_main_~#t2514~0.base=|v_ULTIMATE.start_main_~#t2514~0.base_24|, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t2513~0.base, ULTIMATE.start_main_~#t2513~0.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t2515~0.base, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2514~0.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t2515~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ULTIMATE.start_main_~#t2514~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 15:10:24,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L816-1-->L818: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2514~0.base_13|) (= 0 |v_ULTIMATE.start_main_~#t2514~0.offset_11|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t2514~0.base_13|)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t2514~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t2514~0.base_13| 0)) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2514~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2514~0.base_13|) |v_ULTIMATE.start_main_~#t2514~0.offset_11| 1))) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2514~0.base_13| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2514~0.offset=|v_ULTIMATE.start_main_~#t2514~0.offset_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2514~0.base=|v_ULTIMATE.start_main_~#t2514~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2514~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2514~0.base] because there is no mapped edge [2019-12-18 15:10:24,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L5-->L773: Formula: (and (= v_~x$r_buff1_thd3~0_11 v_~x$r_buff0_thd3~0_15) (= 1 v_~x$r_buff0_thd2~0_17) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6)) (= 1 v_~y~0_6) (= v_~x$r_buff1_thd1~0_25 v_~x$r_buff0_thd1~0_43) (= v_~x$r_buff1_thd2~0_11 v_~x$r_buff0_thd2~0_18) (= v_~x$r_buff1_thd0~0_11 v_~x$r_buff0_thd0~0_15)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_15, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_18} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_11, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_11, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_15, ~y~0=v_~y~0_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_17, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_11} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 15:10:24,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L818-1-->L820: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2515~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2515~0.base_13|) |v_ULTIMATE.start_main_~#t2515~0.offset_11| 2)) |v_#memory_int_13|) (not (= 0 |v_ULTIMATE.start_main_~#t2515~0.base_13|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2515~0.base_13|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2515~0.base_13| 4)) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t2515~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t2515~0.offset_11|) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t2515~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t2515~0.offset=|v_ULTIMATE.start_main_~#t2515~0.offset_11|, ULTIMATE.start_main_~#t2515~0.base=|v_ULTIMATE.start_main_~#t2515~0.base_13|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2515~0.offset, ULTIMATE.start_main_~#t2515~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 15:10:24,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L793-2-->L793-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd3~0_In1176830622 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1176830622 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite32_Out1176830622| ~x$w_buff1~0_In1176830622) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x~0_In1176830622 |P2Thread1of1ForFork1_#t~ite32_Out1176830622|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1176830622, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1176830622, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1176830622, ~x~0=~x~0_In1176830622} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out1176830622|, ~x$w_buff1~0=~x$w_buff1~0_In1176830622, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1176830622, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1176830622, ~x~0=~x~0_In1176830622} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 15:10:24,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L793-4-->L794: Formula: (= v_~x~0_67 |v_P2Thread1of1ForFork1_#t~ite32_24|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_24|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_23|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_39|, ~x~0=v_~x~0_67} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 15:10:24,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L794-->L794-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In859238903 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In859238903 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite34_Out859238903| ~x$w_buff0_used~0_In859238903) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite34_Out859238903| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In859238903, ~x$w_buff0_used~0=~x$w_buff0_used~0_In859238903} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out859238903|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In859238903, ~x$w_buff0_used~0=~x$w_buff0_used~0_In859238903} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 15:10:24,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L795-->L795-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In-2135333830 256))) (.cse3 (= (mod ~x$r_buff1_thd3~0_In-2135333830 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-2135333830 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-2135333830 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite35_Out-2135333830|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In-2135333830 |P2Thread1of1ForFork1_#t~ite35_Out-2135333830|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2135333830, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2135333830, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2135333830, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2135333830} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-2135333830|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2135333830, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2135333830, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2135333830, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2135333830} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 15:10:24,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In-938229334 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-938229334 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite36_Out-938229334| 0)) (and (= |P2Thread1of1ForFork1_#t~ite36_Out-938229334| ~x$r_buff0_thd3~0_In-938229334) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-938229334, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-938229334} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-938229334|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-938229334, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-938229334} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 15:10:24,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L797-->L797-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In-1592386127 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1592386127 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1592386127 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In-1592386127 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite37_Out-1592386127| ~x$r_buff1_thd3~0_In-1592386127)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork1_#t~ite37_Out-1592386127|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1592386127, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1592386127, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1592386127, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1592386127} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-1592386127|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1592386127, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1592386127, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1592386127, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1592386127} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 15:10:24,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L797-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd3~0_57 |v_P2Thread1of1ForFork1_#t~ite37_36|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_35|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_57, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 15:10:24,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L739-->L739-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1583270979 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite12_Out1583270979| ~x$w_buff1~0_In1583270979) (= |P0Thread1of1ForFork2_#t~ite11_In1583270979| |P0Thread1of1ForFork2_#t~ite11_Out1583270979|)) (and (= |P0Thread1of1ForFork2_#t~ite11_Out1583270979| ~x$w_buff1~0_In1583270979) (= |P0Thread1of1ForFork2_#t~ite11_Out1583270979| |P0Thread1of1ForFork2_#t~ite12_Out1583270979|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In1583270979 256) 0))) (or (and .cse1 (= (mod ~x$r_buff1_thd1~0_In1583270979 256) 0)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In1583270979 256))) (= 0 (mod ~x$w_buff0_used~0_In1583270979 256)))) .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1583270979, ~x$w_buff1~0=~x$w_buff1~0_In1583270979, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1583270979, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1583270979, ~weak$$choice2~0=~weak$$choice2~0_In1583270979, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In1583270979|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1583270979} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1583270979, ~x$w_buff1~0=~x$w_buff1~0_In1583270979, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1583270979, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1583270979, ~weak$$choice2~0=~weak$$choice2~0_In1583270979, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out1583270979|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out1583270979|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1583270979} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 15:10:24,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L740-->L740-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-905777206 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite14_In-905777206| |P0Thread1of1ForFork2_#t~ite14_Out-905777206|) (= |P0Thread1of1ForFork2_#t~ite15_Out-905777206| ~x$w_buff0_used~0_In-905777206)) (and (= |P0Thread1of1ForFork2_#t~ite14_Out-905777206| |P0Thread1of1ForFork2_#t~ite15_Out-905777206|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-905777206 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In-905777206 256)) (and .cse1 (= (mod ~x$w_buff1_used~0_In-905777206 256) 0)) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-905777206 256) 0)))) (= |P0Thread1of1ForFork2_#t~ite14_Out-905777206| ~x$w_buff0_used~0_In-905777206)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-905777206, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-905777206, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-905777206, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-905777206|, ~weak$$choice2~0=~weak$$choice2~0_In-905777206, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-905777206} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-905777206, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-905777206, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-905777206|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-905777206, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-905777206|, ~weak$$choice2~0=~weak$$choice2~0_In-905777206, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-905777206} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 15:10:24,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L742-->L743: Formula: (and (= v_~x$r_buff0_thd1~0_88 v_~x$r_buff0_thd1~0_87) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_88, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_11|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_29, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_9|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 15:10:24,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L743-->L743-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-895372478 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite24_Out-895372478| ~x$r_buff1_thd1~0_In-895372478) (= |P0Thread1of1ForFork2_#t~ite23_In-895372478| |P0Thread1of1ForFork2_#t~ite23_Out-895372478|)) (and (= ~x$r_buff1_thd1~0_In-895372478 |P0Thread1of1ForFork2_#t~ite23_Out-895372478|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-895372478 256) 0))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-895372478 256))) (= (mod ~x$w_buff0_used~0_In-895372478 256) 0) (and (= (mod ~x$r_buff1_thd1~0_In-895372478 256) 0) .cse1))) .cse0 (= |P0Thread1of1ForFork2_#t~ite24_Out-895372478| |P0Thread1of1ForFork2_#t~ite23_Out-895372478|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-895372478, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-895372478, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-895372478, ~weak$$choice2~0=~weak$$choice2~0_In-895372478, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-895372478|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-895372478} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-895372478, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-895372478, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-895372478, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-895372478|, ~weak$$choice2~0=~weak$$choice2~0_In-895372478, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-895372478|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-895372478} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-18 15:10:24,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L745-->L753: Formula: (and (= 0 v_~x$flush_delayed~0_8) (= v_~x$mem_tmp~0_5 v_~x~0_24) (not (= (mod v_~x$flush_delayed~0_9 256) 0)) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_11|, ~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 15:10:24,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In887825076 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In887825076 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out887825076| ~x$w_buff0_used~0_In887825076)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out887825076| 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In887825076, ~x$w_buff0_used~0=~x$w_buff0_used~0_In887825076} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In887825076, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out887825076|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In887825076} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 15:10:24,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In1450942522 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1450942522 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In1450942522 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd2~0_In1450942522 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out1450942522|)) (and (= |P1Thread1of1ForFork0_#t~ite29_Out1450942522| ~x$w_buff1_used~0_In1450942522) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1450942522, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1450942522, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1450942522, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1450942522} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1450942522, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1450942522, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1450942522, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out1450942522|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1450942522} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 15:10:24,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L776-->L777: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In1538677627 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1538677627 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out1538677627)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In1538677627 ~x$r_buff0_thd2~0_Out1538677627)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1538677627, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1538677627} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1538677627|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1538677627, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1538677627} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 15:10:24,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L777-->L777-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd2~0_In297027283 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In297027283 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In297027283 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In297027283 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out297027283| ~x$r_buff1_thd2~0_In297027283) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork0_#t~ite31_Out297027283| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In297027283, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In297027283, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In297027283, ~x$w_buff0_used~0=~x$w_buff0_used~0_In297027283} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out297027283|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In297027283, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In297027283, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In297027283, ~x$w_buff0_used~0=~x$w_buff0_used~0_In297027283} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 15:10:24,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L777-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_67 |v_P1Thread1of1ForFork0_#t~ite31_40|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_89 1) v_~__unbuffered_cnt~0_88)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_39|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_67, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 15:10:24,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L820-1-->L826: Formula: (and (= 3 v_~__unbuffered_cnt~0_29) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 15:10:24,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L826-2-->L826-5: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In-2100251927 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-2100251927 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite42_Out-2100251927| |ULTIMATE.start_main_#t~ite41_Out-2100251927|))) (or (and (= ~x$w_buff1~0_In-2100251927 |ULTIMATE.start_main_#t~ite41_Out-2100251927|) (not .cse0) (not .cse1) .cse2) (and (or .cse0 .cse1) (= ~x~0_In-2100251927 |ULTIMATE.start_main_#t~ite41_Out-2100251927|) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-2100251927, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2100251927, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2100251927, ~x~0=~x~0_In-2100251927} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-2100251927|, ~x$w_buff1~0=~x$w_buff1~0_In-2100251927, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2100251927, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2100251927, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-2100251927|, ~x~0=~x~0_In-2100251927} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 15:10:24,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L827-->L827-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In2115368084 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In2115368084 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite43_Out2115368084| 0)) (and (= |ULTIMATE.start_main_#t~ite43_Out2115368084| ~x$w_buff0_used~0_In2115368084) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2115368084, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2115368084} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2115368084, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out2115368084|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2115368084} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 15:10:24,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L828-->L828-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1882168240 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-1882168240 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1882168240 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1882168240 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-1882168240| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-1882168240| ~x$w_buff1_used~0_In-1882168240)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1882168240, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1882168240, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1882168240, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1882168240} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1882168240, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1882168240, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1882168240, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1882168240|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1882168240} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 15:10:24,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-2107901089 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-2107901089 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-2107901089|) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd0~0_In-2107901089 |ULTIMATE.start_main_#t~ite45_Out-2107901089|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2107901089, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2107901089} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2107901089, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-2107901089|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2107901089} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 15:10:24,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L830-->L830-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1382881895 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1382881895 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In1382881895 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In1382881895 256)))) (or (and (= ~x$r_buff1_thd0~0_In1382881895 |ULTIMATE.start_main_#t~ite46_Out1382881895|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite46_Out1382881895|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1382881895, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1382881895, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1382881895, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1382881895} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1382881895, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1382881895|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1382881895, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1382881895, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1382881895} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 15:10:24,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~main$tmp_guard1~0_18 0) (= v_~z~0_43 2) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9| (mod v_~main$tmp_guard1~0_18 256)) (= v_~y~0_108 2) (= 0 v_~__unbuffered_p0_EAX~0_24) (= v_~x$r_buff1_thd0~0_148 |v_ULTIMATE.start_main_#t~ite46_39|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_39|, ~z~0=v_~z~0_43, ~y~0=v_~y~0_108} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_38|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~z~0=v_~z~0_43, ~y~0=v_~y~0_108, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_148, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 15:10:24,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 03:10:24 BasicIcfg [2019-12-18 15:10:24,566 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 15:10:24,567 INFO L168 Benchmark]: Toolchain (without parser) took 60956.85 ms. Allocated memory was 133.7 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 96.6 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 795.6 MB. Max. memory is 7.1 GB. [2019-12-18 15:10:24,568 INFO L168 Benchmark]: CDTParser took 0.55 ms. Allocated memory is still 133.7 MB. Free memory was 116.9 MB in the beginning and 116.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 15:10:24,569 INFO L168 Benchmark]: CACSL2BoogieTranslator took 834.69 ms. Allocated memory was 133.7 MB in the beginning and 197.7 MB in the end (delta: 64.0 MB). Free memory was 96.1 MB in the beginning and 149.5 MB in the end (delta: -53.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-18 15:10:24,570 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.90 ms. Allocated memory is still 197.7 MB. Free memory was 149.5 MB in the beginning and 146.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 15:10:24,574 INFO L168 Benchmark]: Boogie Preprocessor took 39.49 ms. Allocated memory is still 197.7 MB. Free memory was 146.6 MB in the beginning and 144.4 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-12-18 15:10:24,574 INFO L168 Benchmark]: RCFGBuilder took 891.33 ms. Allocated memory is still 197.7 MB. Free memory was 144.4 MB in the beginning and 97.6 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. [2019-12-18 15:10:24,575 INFO L168 Benchmark]: TraceAbstraction took 59109.09 ms. Allocated memory was 197.7 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 96.9 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 731.9 MB. Max. memory is 7.1 GB. [2019-12-18 15:10:24,583 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.55 ms. Allocated memory is still 133.7 MB. Free memory was 116.9 MB in the beginning and 116.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 834.69 ms. Allocated memory was 133.7 MB in the beginning and 197.7 MB in the end (delta: 64.0 MB). Free memory was 96.1 MB in the beginning and 149.5 MB in the end (delta: -53.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.90 ms. Allocated memory is still 197.7 MB. Free memory was 149.5 MB in the beginning and 146.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.49 ms. Allocated memory is still 197.7 MB. Free memory was 146.6 MB in the beginning and 144.4 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 891.33 ms. Allocated memory is still 197.7 MB. Free memory was 144.4 MB in the beginning and 97.6 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 59109.09 ms. Allocated memory was 197.7 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 96.9 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 731.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 162 ProgramPointsBefore, 83 ProgramPointsAfterwards, 193 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 26 ChoiceCompositions, 6611 VarBasedMoverChecksPositive, 290 VarBasedMoverChecksNegative, 125 SemBasedMoverChecksPositive, 244 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 64880 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L816] FCALL, FORK 0 pthread_create(&t2513, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L818] FCALL, FORK 0 pthread_create(&t2514, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 1 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L820] FCALL, FORK 0 pthread_create(&t2515, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L787] 3 y = 2 [L790] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L793] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L728] 1 z = 2 [L733] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L734] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L735] 1 x$flush_delayed = weak$$choice2 [L736] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=2, z=2] [L737] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=2, z=2] [L737] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L738] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=2, z=2] [L794] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L795] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L796] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L738] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L739] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L740] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L741] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] 1 __unbuffered_p0_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L773] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L774] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L775] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L826] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L827] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L828] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L829] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 2 error locations. Result: UNSAFE, OverallTime: 58.7s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 14.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3034 SDtfs, 2779 SDslu, 6644 SDs, 0 SdLazy, 2223 SolverSat, 122 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111499occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 25.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 96978 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 682 NumberOfCodeBlocks, 682 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 609 ConstructedInterpolants, 0 QuantifiedInterpolants, 108750 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...