/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe024_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 22:43:09,405 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 22:43:09,408 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 22:43:09,420 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 22:43:09,420 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 22:43:09,421 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 22:43:09,422 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 22:43:09,424 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 22:43:09,426 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 22:43:09,427 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 22:43:09,428 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 22:43:09,429 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 22:43:09,429 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 22:43:09,430 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 22:43:09,431 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 22:43:09,432 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 22:43:09,433 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 22:43:09,433 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 22:43:09,435 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 22:43:09,437 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 22:43:09,438 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 22:43:09,439 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 22:43:09,440 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 22:43:09,441 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 22:43:09,443 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 22:43:09,443 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 22:43:09,443 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 22:43:09,444 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 22:43:09,445 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 22:43:09,446 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 22:43:09,446 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 22:43:09,447 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 22:43:09,447 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 22:43:09,448 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 22:43:09,449 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 22:43:09,449 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 22:43:09,450 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 22:43:09,450 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 22:43:09,450 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 22:43:09,451 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 22:43:09,452 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 22:43:09,453 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 22:43:09,466 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 22:43:09,467 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 22:43:09,468 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 22:43:09,468 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 22:43:09,468 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 22:43:09,468 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 22:43:09,469 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 22:43:09,469 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 22:43:09,469 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 22:43:09,469 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 22:43:09,469 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 22:43:09,469 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 22:43:09,470 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 22:43:09,470 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 22:43:09,470 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 22:43:09,470 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 22:43:09,470 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 22:43:09,471 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 22:43:09,471 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 22:43:09,471 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 22:43:09,471 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 22:43:09,471 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:43:09,472 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 22:43:09,472 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 22:43:09,472 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 22:43:09,472 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 22:43:09,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 22:43:09,473 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 22:43:09,473 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 22:43:09,473 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 22:43:09,473 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 22:43:09,473 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 22:43:09,754 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 22:43:09,776 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 22:43:09,779 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 22:43:09,781 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 22:43:09,782 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 22:43:09,782 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe024_power.oepc.i [2019-12-27 22:43:09,872 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/984d6fbba/31234f5a19be4bd1a7426600287075e9/FLAG399324ddb [2019-12-27 22:43:10,463 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 22:43:10,464 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_power.oepc.i [2019-12-27 22:43:10,478 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/984d6fbba/31234f5a19be4bd1a7426600287075e9/FLAG399324ddb [2019-12-27 22:43:10,719 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/984d6fbba/31234f5a19be4bd1a7426600287075e9 [2019-12-27 22:43:10,728 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 22:43:10,730 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 22:43:10,731 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 22:43:10,731 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 22:43:10,734 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 22:43:10,735 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:43:10" (1/1) ... [2019-12-27 22:43:10,738 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce4072b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:43:10, skipping insertion in model container [2019-12-27 22:43:10,738 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:43:10" (1/1) ... [2019-12-27 22:43:10,746 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 22:43:10,819 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 22:43:11,348 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:43:11,361 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 22:43:11,448 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:43:11,544 INFO L208 MainTranslator]: Completed translation [2019-12-27 22:43:11,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:43:11 WrapperNode [2019-12-27 22:43:11,545 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 22:43:11,546 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 22:43:11,546 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 22:43:11,548 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 22:43:11,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:43:11" (1/1) ... [2019-12-27 22:43:11,578 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:43:11" (1/1) ... [2019-12-27 22:43:11,616 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 22:43:11,616 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 22:43:11,616 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 22:43:11,616 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 22:43:11,628 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:43:11" (1/1) ... [2019-12-27 22:43:11,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:43:11" (1/1) ... [2019-12-27 22:43:11,633 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:43:11" (1/1) ... [2019-12-27 22:43:11,633 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:43:11" (1/1) ... [2019-12-27 22:43:11,643 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:43:11" (1/1) ... [2019-12-27 22:43:11,648 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:43:11" (1/1) ... [2019-12-27 22:43:11,652 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:43:11" (1/1) ... [2019-12-27 22:43:11,659 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 22:43:11,659 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 22:43:11,660 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 22:43:11,660 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 22:43:11,661 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:43:11" (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-27 22:43:11,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 22:43:11,743 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 22:43:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 22:43:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 22:43:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 22:43:11,745 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 22:43:11,746 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 22:43:11,746 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 22:43:11,747 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 22:43:11,747 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 22:43:11,747 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 22:43:11,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 22:43:11,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 22:43:11,750 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 22:43:12,507 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 22:43:12,508 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 22:43:12,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:43:12 BoogieIcfgContainer [2019-12-27 22:43:12,509 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 22:43:12,510 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 22:43:12,511 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 22:43:12,514 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 22:43:12,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:43:10" (1/3) ... [2019-12-27 22:43:12,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33ac45ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:43:12, skipping insertion in model container [2019-12-27 22:43:12,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:43:11" (2/3) ... [2019-12-27 22:43:12,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33ac45ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:43:12, skipping insertion in model container [2019-12-27 22:43:12,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:43:12" (3/3) ... [2019-12-27 22:43:12,518 INFO L109 eAbstractionObserver]: Analyzing ICFG safe024_power.oepc.i [2019-12-27 22:43:12,528 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 22:43:12,528 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 22:43:12,537 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 22:43:12,538 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 22:43:12,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,584 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,584 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,618 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,618 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,619 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,623 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,624 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,633 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,633 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,643 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,643 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,644 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,667 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,667 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,671 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,672 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:43:12,691 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 22:43:12,712 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 22:43:12,713 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 22:43:12,713 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 22:43:12,713 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 22:43:12,713 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 22:43:12,713 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 22:43:12,713 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 22:43:12,713 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 22:43:12,731 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-27 22:43:12,733 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 22:43:12,842 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 22:43:12,842 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:43:12,864 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 22:43:12,886 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 22:43:12,968 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 22:43:12,968 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:43:12,975 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 22:43:12,994 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 22:43:12,995 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 22:43:16,752 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 22:43:16,884 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 22:43:16,910 INFO L206 etLargeBlockEncoding]: Checked pairs total: 75034 [2019-12-27 22:43:16,911 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-27 22:43:16,914 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 87 transitions [2019-12-27 22:43:28,502 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 85916 states. [2019-12-27 22:43:28,504 INFO L276 IsEmpty]: Start isEmpty. Operand 85916 states. [2019-12-27 22:43:28,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 22:43:28,510 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:43:28,511 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 22:43:28,511 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-27 22:43:28,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:43:28,516 INFO L82 PathProgramCache]: Analyzing trace with hash 797474655, now seen corresponding path program 1 times [2019-12-27 22:43:28,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:43:28,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888247] [2019-12-27 22:43:28,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:43:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:43:28,790 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-27 22:43:28,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888247] [2019-12-27 22:43:28,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:43:28,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:43:28,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1368608437] [2019-12-27 22:43:28,794 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:43:28,797 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:43:28,810 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 22:43:28,811 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:43:28,815 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:43:28,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:43:28,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:43:28,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:43:28,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:43:28,830 INFO L87 Difference]: Start difference. First operand 85916 states. Second operand 3 states. [2019-12-27 22:43:31,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:43:31,288 INFO L93 Difference]: Finished difference Result 84652 states and 359098 transitions. [2019-12-27 22:43:31,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:43:31,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 22:43:31,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:43:31,815 INFO L225 Difference]: With dead ends: 84652 [2019-12-27 22:43:31,815 INFO L226 Difference]: Without dead ends: 79738 [2019-12-27 22:43:31,820 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-27 22:43:36,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79738 states. [2019-12-27 22:43:38,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79738 to 79738. [2019-12-27 22:43:38,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79738 states. [2019-12-27 22:43:41,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79738 states to 79738 states and 337790 transitions. [2019-12-27 22:43:41,587 INFO L78 Accepts]: Start accepts. Automaton has 79738 states and 337790 transitions. Word has length 5 [2019-12-27 22:43:41,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:43:41,587 INFO L462 AbstractCegarLoop]: Abstraction has 79738 states and 337790 transitions. [2019-12-27 22:43:41,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:43:41,587 INFO L276 IsEmpty]: Start isEmpty. Operand 79738 states and 337790 transitions. [2019-12-27 22:43:41,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:43:41,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:43:41,597 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:43:41,597 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-27 22:43:41,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:43:41,598 INFO L82 PathProgramCache]: Analyzing trace with hash 334215787, now seen corresponding path program 1 times [2019-12-27 22:43:41,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:43:41,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744019524] [2019-12-27 22:43:41,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:43:41,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:43:41,768 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-27 22:43:41,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744019524] [2019-12-27 22:43:41,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:43:41,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:43:41,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1439920013] [2019-12-27 22:43:41,770 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:43:41,771 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:43:41,774 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:43:41,774 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:43:41,775 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:43:41,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:43:41,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:43:41,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:43:41,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:43:41,777 INFO L87 Difference]: Start difference. First operand 79738 states and 337790 transitions. Second operand 4 states. [2019-12-27 22:43:46,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:43:46,164 INFO L93 Difference]: Finished difference Result 122590 states and 499694 transitions. [2019-12-27 22:43:46,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:43:46,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 22:43:46,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:43:46,687 INFO L225 Difference]: With dead ends: 122590 [2019-12-27 22:43:46,688 INFO L226 Difference]: Without dead ends: 122513 [2019-12-27 22:43:46,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:43:50,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122513 states. [2019-12-27 22:43:52,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122513 to 111273. [2019-12-27 22:43:52,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111273 states. [2019-12-27 22:43:53,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111273 states to 111273 states and 458752 transitions. [2019-12-27 22:43:53,848 INFO L78 Accepts]: Start accepts. Automaton has 111273 states and 458752 transitions. Word has length 13 [2019-12-27 22:43:53,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:43:53,849 INFO L462 AbstractCegarLoop]: Abstraction has 111273 states and 458752 transitions. [2019-12-27 22:43:53,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:43:53,850 INFO L276 IsEmpty]: Start isEmpty. Operand 111273 states and 458752 transitions. [2019-12-27 22:43:53,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:43:53,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:43:53,854 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:43:53,854 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-27 22:43:53,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:43:53,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1013985611, now seen corresponding path program 1 times [2019-12-27 22:43:53,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:43:53,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875270515] [2019-12-27 22:43:53,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:43:53,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:43:53,918 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-27 22:43:53,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875270515] [2019-12-27 22:43:53,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:43:53,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:43:53,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [910797071] [2019-12-27 22:43:53,921 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:43:53,923 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:43:53,925 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:43:53,925 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:43:53,925 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:43:53,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:43:53,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:43:53,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:43:53,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:43:53,926 INFO L87 Difference]: Start difference. First operand 111273 states and 458752 transitions. Second operand 3 states. [2019-12-27 22:43:54,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:43:54,053 INFO L93 Difference]: Finished difference Result 27590 states and 92015 transitions. [2019-12-27 22:43:54,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:43:54,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 22:43:54,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:43:54,129 INFO L225 Difference]: With dead ends: 27590 [2019-12-27 22:43:54,129 INFO L226 Difference]: Without dead ends: 27590 [2019-12-27 22:43:54,130 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-27 22:43:54,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27590 states. [2019-12-27 22:43:54,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27590 to 27590. [2019-12-27 22:43:54,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27590 states. [2019-12-27 22:43:54,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27590 states to 27590 states and 92015 transitions. [2019-12-27 22:43:54,769 INFO L78 Accepts]: Start accepts. Automaton has 27590 states and 92015 transitions. Word has length 13 [2019-12-27 22:43:54,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:43:54,770 INFO L462 AbstractCegarLoop]: Abstraction has 27590 states and 92015 transitions. [2019-12-27 22:43:54,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:43:54,770 INFO L276 IsEmpty]: Start isEmpty. Operand 27590 states and 92015 transitions. [2019-12-27 22:43:54,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 22:43:54,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:43:54,772 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:43:54,773 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-27 22:43:54,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:43:54,773 INFO L82 PathProgramCache]: Analyzing trace with hash -569288949, now seen corresponding path program 1 times [2019-12-27 22:43:54,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:43:54,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367379866] [2019-12-27 22:43:54,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:43:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:43:56,082 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-27 22:43:56,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367379866] [2019-12-27 22:43:56,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:43:56,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:43:56,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1698267828] [2019-12-27 22:43:56,083 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:43:56,085 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:43:56,089 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 22:43:56,089 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:43:56,091 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:43:56,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:43:56,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:43:56,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:43:56,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:43:56,092 INFO L87 Difference]: Start difference. First operand 27590 states and 92015 transitions. Second operand 5 states. [2019-12-27 22:43:56,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:43:56,580 INFO L93 Difference]: Finished difference Result 40899 states and 133989 transitions. [2019-12-27 22:43:56,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:43:56,581 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 22:43:56,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:43:56,686 INFO L225 Difference]: With dead ends: 40899 [2019-12-27 22:43:56,686 INFO L226 Difference]: Without dead ends: 40883 [2019-12-27 22:43:56,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:43:56,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40883 states. [2019-12-27 22:43:57,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40883 to 30763. [2019-12-27 22:43:57,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30763 states. [2019-12-27 22:43:57,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30763 states to 30763 states and 102099 transitions. [2019-12-27 22:43:57,326 INFO L78 Accepts]: Start accepts. Automaton has 30763 states and 102099 transitions. Word has length 14 [2019-12-27 22:43:57,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:43:57,327 INFO L462 AbstractCegarLoop]: Abstraction has 30763 states and 102099 transitions. [2019-12-27 22:43:57,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:43:57,327 INFO L276 IsEmpty]: Start isEmpty. Operand 30763 states and 102099 transitions. [2019-12-27 22:43:57,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 22:43:57,337 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:43:57,337 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-27 22:43:57,337 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-27 22:43:57,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:43:57,337 INFO L82 PathProgramCache]: Analyzing trace with hash -777509353, now seen corresponding path program 1 times [2019-12-27 22:43:57,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:43:57,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143993547] [2019-12-27 22:43:57,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:43:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:43:57,539 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-27 22:43:57,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143993547] [2019-12-27 22:43:57,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:43:57,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:43:57,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1125768925] [2019-12-27 22:43:57,541 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:43:57,544 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:43:57,557 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 67 states and 110 transitions. [2019-12-27 22:43:57,557 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:43:57,558 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:43:57,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 22:43:57,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:43:57,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 22:43:57,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:43:57,559 INFO L87 Difference]: Start difference. First operand 30763 states and 102099 transitions. Second operand 8 states. [2019-12-27 22:43:58,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:43:58,826 INFO L93 Difference]: Finished difference Result 47671 states and 155526 transitions. [2019-12-27 22:43:58,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 22:43:58,827 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-27 22:43:58,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:43:58,908 INFO L225 Difference]: With dead ends: 47671 [2019-12-27 22:43:58,908 INFO L226 Difference]: Without dead ends: 47657 [2019-12-27 22:43:58,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2019-12-27 22:43:59,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47657 states. [2019-12-27 22:43:59,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47657 to 30740. [2019-12-27 22:43:59,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30740 states. [2019-12-27 22:43:59,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30740 states to 30740 states and 102022 transitions. [2019-12-27 22:43:59,766 INFO L78 Accepts]: Start accepts. Automaton has 30740 states and 102022 transitions. Word has length 22 [2019-12-27 22:43:59,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:43:59,767 INFO L462 AbstractCegarLoop]: Abstraction has 30740 states and 102022 transitions. [2019-12-27 22:43:59,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 22:43:59,767 INFO L276 IsEmpty]: Start isEmpty. Operand 30740 states and 102022 transitions. [2019-12-27 22:43:59,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 22:43:59,776 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:43:59,776 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-27 22:43:59,777 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-27 22:43:59,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:43:59,777 INFO L82 PathProgramCache]: Analyzing trace with hash -955175401, now seen corresponding path program 2 times [2019-12-27 22:43:59,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:43:59,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132605109] [2019-12-27 22:43:59,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:43:59,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:43:59,892 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-27 22:43:59,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132605109] [2019-12-27 22:43:59,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:43:59,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:43:59,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [318055309] [2019-12-27 22:43:59,894 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:43:59,897 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:43:59,909 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 63 states and 102 transitions. [2019-12-27 22:43:59,909 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:43:59,910 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:43:59,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:43:59,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:43:59,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:43:59,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:43:59,911 INFO L87 Difference]: Start difference. First operand 30740 states and 102022 transitions. Second operand 6 states. [2019-12-27 22:44:00,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:44:00,815 INFO L93 Difference]: Finished difference Result 50452 states and 163804 transitions. [2019-12-27 22:44:00,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 22:44:00,816 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 22:44:00,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:44:00,905 INFO L225 Difference]: With dead ends: 50452 [2019-12-27 22:44:00,905 INFO L226 Difference]: Without dead ends: 50436 [2019-12-27 22:44:00,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:44:01,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50436 states. [2019-12-27 22:44:01,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50436 to 33056. [2019-12-27 22:44:01,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33056 states. [2019-12-27 22:44:01,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33056 states to 33056 states and 108811 transitions. [2019-12-27 22:44:01,616 INFO L78 Accepts]: Start accepts. Automaton has 33056 states and 108811 transitions. Word has length 22 [2019-12-27 22:44:01,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:44:01,616 INFO L462 AbstractCegarLoop]: Abstraction has 33056 states and 108811 transitions. [2019-12-27 22:44:01,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:44:01,617 INFO L276 IsEmpty]: Start isEmpty. Operand 33056 states and 108811 transitions. [2019-12-27 22:44:01,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 22:44:01,625 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:44:01,625 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-27 22:44:01,625 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-27 22:44:01,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:44:01,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1831919425, now seen corresponding path program 1 times [2019-12-27 22:44:01,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:44:01,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639983389] [2019-12-27 22:44:01,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:44:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:44:01,747 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-27 22:44:01,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639983389] [2019-12-27 22:44:01,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:44:01,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:44:01,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [653446153] [2019-12-27 22:44:01,748 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:44:01,751 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:44:01,766 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 63 states and 102 transitions. [2019-12-27 22:44:01,766 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:44:01,768 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:44:01,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:44:01,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:44:01,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:44:01,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:44:01,769 INFO L87 Difference]: Start difference. First operand 33056 states and 108811 transitions. Second operand 6 states. [2019-12-27 22:44:02,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:44:02,838 INFO L93 Difference]: Finished difference Result 57959 states and 186262 transitions. [2019-12-27 22:44:02,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 22:44:02,839 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 22:44:02,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:44:02,938 INFO L225 Difference]: With dead ends: 57959 [2019-12-27 22:44:02,938 INFO L226 Difference]: Without dead ends: 57943 [2019-12-27 22:44:02,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:44:03,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57943 states. [2019-12-27 22:44:03,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57943 to 37990. [2019-12-27 22:44:03,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37990 states. [2019-12-27 22:44:03,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37990 states to 37990 states and 123566 transitions. [2019-12-27 22:44:03,732 INFO L78 Accepts]: Start accepts. Automaton has 37990 states and 123566 transitions. Word has length 22 [2019-12-27 22:44:03,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:44:03,733 INFO L462 AbstractCegarLoop]: Abstraction has 37990 states and 123566 transitions. [2019-12-27 22:44:03,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:44:03,733 INFO L276 IsEmpty]: Start isEmpty. Operand 37990 states and 123566 transitions. [2019-12-27 22:44:03,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 22:44:03,741 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:44:03,741 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-27 22:44:03,741 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-27 22:44:03,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:44:03,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1484420599, now seen corresponding path program 3 times [2019-12-27 22:44:03,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:44:03,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049773603] [2019-12-27 22:44:03,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:44:03,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:44:03,864 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-27 22:44:03,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049773603] [2019-12-27 22:44:03,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:44:03,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:44:03,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1400034196] [2019-12-27 22:44:03,865 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:44:03,869 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:44:03,881 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 69 states and 114 transitions. [2019-12-27 22:44:03,882 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:44:03,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 22:44:03,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:44:03,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:44:04,228 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2019-12-27 22:44:04,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-27 22:44:04,411 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 22:44:04,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 22:44:04,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:44:04,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 22:44:04,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:44:04,413 INFO L87 Difference]: Start difference. First operand 37990 states and 123566 transitions. Second operand 11 states. [2019-12-27 22:44:07,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:44:07,495 INFO L93 Difference]: Finished difference Result 68861 states and 220786 transitions. [2019-12-27 22:44:07,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 22:44:07,495 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-12-27 22:44:07,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:44:07,614 INFO L225 Difference]: With dead ends: 68861 [2019-12-27 22:44:07,614 INFO L226 Difference]: Without dead ends: 68833 [2019-12-27 22:44:07,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2019-12-27 22:44:07,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68833 states. [2019-12-27 22:44:08,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68833 to 38574. [2019-12-27 22:44:08,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38574 states. [2019-12-27 22:44:08,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38574 states to 38574 states and 125845 transitions. [2019-12-27 22:44:08,811 INFO L78 Accepts]: Start accepts. Automaton has 38574 states and 125845 transitions. Word has length 22 [2019-12-27 22:44:08,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:44:08,812 INFO L462 AbstractCegarLoop]: Abstraction has 38574 states and 125845 transitions. [2019-12-27 22:44:08,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 22:44:08,812 INFO L276 IsEmpty]: Start isEmpty. Operand 38574 states and 125845 transitions. [2019-12-27 22:44:08,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 22:44:08,827 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:44:08,827 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-27 22:44:08,827 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-27 22:44:08,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:44:08,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1832050688, now seen corresponding path program 1 times [2019-12-27 22:44:08,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:44:08,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163195336] [2019-12-27 22:44:08,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:44:08,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:44:08,869 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-27 22:44:08,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163195336] [2019-12-27 22:44:08,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:44:08,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:44:08,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1390926777] [2019-12-27 22:44:08,870 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:44:08,873 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:44:08,878 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 22:44:08,878 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:44:08,879 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:44:08,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:44:08,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:44:08,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:44:08,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:44:08,880 INFO L87 Difference]: Start difference. First operand 38574 states and 125845 transitions. Second operand 4 states. [2019-12-27 22:44:08,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:44:08,957 INFO L93 Difference]: Finished difference Result 15268 states and 46140 transitions. [2019-12-27 22:44:08,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:44:08,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 22:44:08,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:44:08,978 INFO L225 Difference]: With dead ends: 15268 [2019-12-27 22:44:08,978 INFO L226 Difference]: Without dead ends: 15268 [2019-12-27 22:44:08,978 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-27 22:44:09,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15268 states. [2019-12-27 22:44:09,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15268 to 15043. [2019-12-27 22:44:09,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15043 states. [2019-12-27 22:44:09,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15043 states to 15043 states and 45475 transitions. [2019-12-27 22:44:09,194 INFO L78 Accepts]: Start accepts. Automaton has 15043 states and 45475 transitions. Word has length 25 [2019-12-27 22:44:09,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:44:09,194 INFO L462 AbstractCegarLoop]: Abstraction has 15043 states and 45475 transitions. [2019-12-27 22:44:09,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:44:09,195 INFO L276 IsEmpty]: Start isEmpty. Operand 15043 states and 45475 transitions. [2019-12-27 22:44:09,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 22:44:09,215 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:44:09,215 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-27 22:44:09,216 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-27 22:44:09,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:44:09,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1925972027, now seen corresponding path program 1 times [2019-12-27 22:44:09,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:44:09,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081099221] [2019-12-27 22:44:09,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:44:09,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:44:09,277 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-27 22:44:09,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081099221] [2019-12-27 22:44:09,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:44:09,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:44:09,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1631083656] [2019-12-27 22:44:09,279 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:44:09,287 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:44:09,312 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 75 states and 103 transitions. [2019-12-27 22:44:09,312 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:44:09,313 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:44:09,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:44:09,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:44:09,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:44:09,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:44:09,314 INFO L87 Difference]: Start difference. First operand 15043 states and 45475 transitions. Second operand 5 states. [2019-12-27 22:44:09,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:44:09,410 INFO L93 Difference]: Finished difference Result 13686 states and 42008 transitions. [2019-12-27 22:44:09,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:44:09,411 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 22:44:09,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:44:09,439 INFO L225 Difference]: With dead ends: 13686 [2019-12-27 22:44:09,440 INFO L226 Difference]: Without dead ends: 13686 [2019-12-27 22:44:09,440 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-27 22:44:09,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13686 states. [2019-12-27 22:44:09,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13686 to 13136. [2019-12-27 22:44:09,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13136 states. [2019-12-27 22:44:09,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13136 states to 13136 states and 40455 transitions. [2019-12-27 22:44:09,760 INFO L78 Accepts]: Start accepts. Automaton has 13136 states and 40455 transitions. Word has length 39 [2019-12-27 22:44:09,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:44:09,760 INFO L462 AbstractCegarLoop]: Abstraction has 13136 states and 40455 transitions. [2019-12-27 22:44:09,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:44:09,760 INFO L276 IsEmpty]: Start isEmpty. Operand 13136 states and 40455 transitions. [2019-12-27 22:44:09,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:44:09,780 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:44:09,780 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-27 22:44:09,780 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-27 22:44:09,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:44:09,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1242350889, now seen corresponding path program 1 times [2019-12-27 22:44:09,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:44:09,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609593289] [2019-12-27 22:44:09,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:44:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:44:09,880 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-27 22:44:09,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609593289] [2019-12-27 22:44:09,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:44:09,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:44:09,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1940609700] [2019-12-27 22:44:09,882 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:44:09,899 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:44:10,145 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 212 states and 394 transitions. [2019-12-27 22:44:10,145 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:44:10,190 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 22:44:10,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:44:10,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:44:10,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:44:10,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:44:10,191 INFO L87 Difference]: Start difference. First operand 13136 states and 40455 transitions. Second operand 7 states. [2019-12-27 22:44:10,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:44:10,658 INFO L93 Difference]: Finished difference Result 30144 states and 92100 transitions. [2019-12-27 22:44:10,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 22:44:10,658 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 22:44:10,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:44:10,683 INFO L225 Difference]: With dead ends: 30144 [2019-12-27 22:44:10,683 INFO L226 Difference]: Without dead ends: 17326 [2019-12-27 22:44:10,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-12-27 22:44:10,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17326 states. [2019-12-27 22:44:10,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17326 to 11563. [2019-12-27 22:44:10,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11563 states. [2019-12-27 22:44:10,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11563 states to 11563 states and 35457 transitions. [2019-12-27 22:44:10,894 INFO L78 Accepts]: Start accepts. Automaton has 11563 states and 35457 transitions. Word has length 54 [2019-12-27 22:44:10,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:44:10,894 INFO L462 AbstractCegarLoop]: Abstraction has 11563 states and 35457 transitions. [2019-12-27 22:44:10,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:44:10,894 INFO L276 IsEmpty]: Start isEmpty. Operand 11563 states and 35457 transitions. [2019-12-27 22:44:10,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:44:10,910 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:44:10,911 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-27 22:44:10,911 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-27 22:44:10,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:44:10,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1480827867, now seen corresponding path program 2 times [2019-12-27 22:44:10,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:44:10,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302653872] [2019-12-27 22:44:10,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:44:10,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:44:11,016 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-27 22:44:11,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302653872] [2019-12-27 22:44:11,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:44:11,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:44:11,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [874717105] [2019-12-27 22:44:11,017 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:44:11,034 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:44:11,161 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 200 states and 371 transitions. [2019-12-27 22:44:11,161 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:44:11,303 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 22:44:11,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 22:44:11,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:44:11,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 22:44:11,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:44:11,304 INFO L87 Difference]: Start difference. First operand 11563 states and 35457 transitions. Second operand 8 states. [2019-12-27 22:44:11,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:44:11,728 INFO L93 Difference]: Finished difference Result 31073 states and 94161 transitions. [2019-12-27 22:44:11,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 22:44:11,728 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-27 22:44:11,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:44:11,767 INFO L225 Difference]: With dead ends: 31073 [2019-12-27 22:44:11,767 INFO L226 Difference]: Without dead ends: 23633 [2019-12-27 22:44:11,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 12 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-12-27 22:44:11,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23633 states. [2019-12-27 22:44:12,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23633 to 14200. [2019-12-27 22:44:12,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14200 states. [2019-12-27 22:44:12,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14200 states to 14200 states and 43698 transitions. [2019-12-27 22:44:12,058 INFO L78 Accepts]: Start accepts. Automaton has 14200 states and 43698 transitions. Word has length 54 [2019-12-27 22:44:12,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:44:12,170 INFO L462 AbstractCegarLoop]: Abstraction has 14200 states and 43698 transitions. [2019-12-27 22:44:12,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 22:44:12,170 INFO L276 IsEmpty]: Start isEmpty. Operand 14200 states and 43698 transitions. [2019-12-27 22:44:12,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:44:12,185 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:44:12,185 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-27 22:44:12,185 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-27 22:44:12,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:44:12,185 INFO L82 PathProgramCache]: Analyzing trace with hash 2052295147, now seen corresponding path program 3 times [2019-12-27 22:44:12,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:44:12,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157150366] [2019-12-27 22:44:12,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:44:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:44:12,268 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-27 22:44:12,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157150366] [2019-12-27 22:44:12,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:44:12,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:44:12,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [36995109] [2019-12-27 22:44:12,269 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:44:12,285 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:44:12,437 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 223 states and 421 transitions. [2019-12-27 22:44:12,438 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:44:12,572 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 22:44:12,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 22:44:12,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:44:12,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 22:44:12,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:44:12,573 INFO L87 Difference]: Start difference. First operand 14200 states and 43698 transitions. Second operand 11 states. [2019-12-27 22:44:14,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:44:14,528 INFO L93 Difference]: Finished difference Result 40090 states and 121035 transitions. [2019-12-27 22:44:14,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 22:44:14,529 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-12-27 22:44:14,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:44:14,602 INFO L225 Difference]: With dead ends: 40090 [2019-12-27 22:44:14,602 INFO L226 Difference]: Without dead ends: 29132 [2019-12-27 22:44:14,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2019-12-27 22:44:14,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29132 states. [2019-12-27 22:44:15,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29132 to 16119. [2019-12-27 22:44:15,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16119 states. [2019-12-27 22:44:15,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16119 states to 16119 states and 49371 transitions. [2019-12-27 22:44:15,139 INFO L78 Accepts]: Start accepts. Automaton has 16119 states and 49371 transitions. Word has length 54 [2019-12-27 22:44:15,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:44:15,139 INFO L462 AbstractCegarLoop]: Abstraction has 16119 states and 49371 transitions. [2019-12-27 22:44:15,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 22:44:15,139 INFO L276 IsEmpty]: Start isEmpty. Operand 16119 states and 49371 transitions. [2019-12-27 22:44:15,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:44:15,156 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:44:15,156 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-27 22:44:15,156 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-27 22:44:15,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:44:15,157 INFO L82 PathProgramCache]: Analyzing trace with hash 2024395633, now seen corresponding path program 4 times [2019-12-27 22:44:15,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:44:15,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39341100] [2019-12-27 22:44:15,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:44:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:44:15,244 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-27 22:44:15,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39341100] [2019-12-27 22:44:15,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:44:15,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:44:15,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [925563134] [2019-12-27 22:44:15,245 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:44:15,262 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:44:15,568 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 198 states and 368 transitions. [2019-12-27 22:44:15,568 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:44:15,852 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 25 times. [2019-12-27 22:44:15,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:44:15,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:44:15,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:44:15,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:44:15,853 INFO L87 Difference]: Start difference. First operand 16119 states and 49371 transitions. Second operand 10 states. [2019-12-27 22:44:17,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:44:17,980 INFO L93 Difference]: Finished difference Result 64633 states and 196825 transitions. [2019-12-27 22:44:17,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 22:44:17,981 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-12-27 22:44:17,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:44:18,060 INFO L225 Difference]: With dead ends: 64633 [2019-12-27 22:44:18,060 INFO L226 Difference]: Without dead ends: 50810 [2019-12-27 22:44:18,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 11 SyntacticMatches, 13 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=212, Invalid=718, Unknown=0, NotChecked=0, Total=930 [2019-12-27 22:44:18,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50810 states. [2019-12-27 22:44:18,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50810 to 18458. [2019-12-27 22:44:18,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18458 states. [2019-12-27 22:44:18,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18458 states to 18458 states and 57048 transitions. [2019-12-27 22:44:18,596 INFO L78 Accepts]: Start accepts. Automaton has 18458 states and 57048 transitions. Word has length 54 [2019-12-27 22:44:18,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:44:18,596 INFO L462 AbstractCegarLoop]: Abstraction has 18458 states and 57048 transitions. [2019-12-27 22:44:18,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:44:18,596 INFO L276 IsEmpty]: Start isEmpty. Operand 18458 states and 57048 transitions. [2019-12-27 22:44:18,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:44:18,623 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:44:18,624 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-27 22:44:18,624 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-27 22:44:18,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:44:18,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1380092391, now seen corresponding path program 1 times [2019-12-27 22:44:18,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:44:18,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824383766] [2019-12-27 22:44:18,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:44:18,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:44:18,756 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-27 22:44:18,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824383766] [2019-12-27 22:44:18,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:44:18,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:44:18,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [523436599] [2019-12-27 22:44:18,758 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:44:18,795 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:44:18,985 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 198 states and 368 transitions. [2019-12-27 22:44:18,986 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:44:18,995 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:44:18,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:44:18,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:44:18,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:44:18,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:44:18,996 INFO L87 Difference]: Start difference. First operand 18458 states and 57048 transitions. Second operand 3 states. [2019-12-27 22:44:19,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:44:19,104 INFO L93 Difference]: Finished difference Result 25158 states and 77709 transitions. [2019-12-27 22:44:19,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:44:19,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 22:44:19,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:44:19,139 INFO L225 Difference]: With dead ends: 25158 [2019-12-27 22:44:19,139 INFO L226 Difference]: Without dead ends: 25158 [2019-12-27 22:44:19,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:44:19,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25158 states. [2019-12-27 22:44:19,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25158 to 20823. [2019-12-27 22:44:19,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20823 states. [2019-12-27 22:44:19,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20823 states to 20823 states and 65263 transitions. [2019-12-27 22:44:19,494 INFO L78 Accepts]: Start accepts. Automaton has 20823 states and 65263 transitions. Word has length 54 [2019-12-27 22:44:19,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:44:19,494 INFO L462 AbstractCegarLoop]: Abstraction has 20823 states and 65263 transitions. [2019-12-27 22:44:19,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:44:19,494 INFO L276 IsEmpty]: Start isEmpty. Operand 20823 states and 65263 transitions. [2019-12-27 22:44:19,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:44:19,528 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:44:19,528 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:44:19,528 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-27 22:44:19,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:44:19,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1558398603, now seen corresponding path program 5 times [2019-12-27 22:44:19,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:44:19,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293452839] [2019-12-27 22:44:19,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:44:19,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:44:19,619 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-27 22:44:19,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293452839] [2019-12-27 22:44:19,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:44:19,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:44:19,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1166045834] [2019-12-27 22:44:19,622 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:44:19,638 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:44:19,809 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 178 states and 306 transitions. [2019-12-27 22:44:19,810 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:44:19,822 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:44:19,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:44:19,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:44:19,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:44:19,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:44:19,824 INFO L87 Difference]: Start difference. First operand 20823 states and 65263 transitions. Second operand 4 states. [2019-12-27 22:44:20,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:44:20,154 INFO L93 Difference]: Finished difference Result 21076 states and 63749 transitions. [2019-12-27 22:44:20,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:44:20,154 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-27 22:44:20,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:44:20,194 INFO L225 Difference]: With dead ends: 21076 [2019-12-27 22:44:20,194 INFO L226 Difference]: Without dead ends: 21076 [2019-12-27 22:44:20,195 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-27 22:44:20,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21076 states. [2019-12-27 22:44:20,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21076 to 14857. [2019-12-27 22:44:20,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14857 states. [2019-12-27 22:44:20,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14857 states to 14857 states and 45381 transitions. [2019-12-27 22:44:20,748 INFO L78 Accepts]: Start accepts. Automaton has 14857 states and 45381 transitions. Word has length 54 [2019-12-27 22:44:20,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:44:20,748 INFO L462 AbstractCegarLoop]: Abstraction has 14857 states and 45381 transitions. [2019-12-27 22:44:20,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:44:20,748 INFO L276 IsEmpty]: Start isEmpty. Operand 14857 states and 45381 transitions. [2019-12-27 22:44:20,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:44:20,765 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:44:20,765 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-27 22:44:20,765 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-27 22:44:20,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:44:20,765 INFO L82 PathProgramCache]: Analyzing trace with hash 2068351876, now seen corresponding path program 1 times [2019-12-27 22:44:20,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:44:20,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120211804] [2019-12-27 22:44:20,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:44:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:44:20,855 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-27 22:44:20,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120211804] [2019-12-27 22:44:20,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:44:20,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:44:20,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [57821175] [2019-12-27 22:44:20,856 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:44:20,871 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:44:21,012 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 189 states and 350 transitions. [2019-12-27 22:44:21,013 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:44:21,126 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 22:44:21,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:44:21,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:44:21,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:44:21,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:44:21,127 INFO L87 Difference]: Start difference. First operand 14857 states and 45381 transitions. Second operand 10 states. [2019-12-27 22:44:22,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:44:22,729 INFO L93 Difference]: Finished difference Result 23961 states and 71042 transitions. [2019-12-27 22:44:22,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 22:44:22,730 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-12-27 22:44:22,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:44:22,764 INFO L225 Difference]: With dead ends: 23961 [2019-12-27 22:44:22,764 INFO L226 Difference]: Without dead ends: 23813 [2019-12-27 22:44:22,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2019-12-27 22:44:22,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23813 states. [2019-12-27 22:44:23,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23813 to 19296. [2019-12-27 22:44:23,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19296 states. [2019-12-27 22:44:23,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19296 states to 19296 states and 58279 transitions. [2019-12-27 22:44:23,093 INFO L78 Accepts]: Start accepts. Automaton has 19296 states and 58279 transitions. Word has length 55 [2019-12-27 22:44:23,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:44:23,093 INFO L462 AbstractCegarLoop]: Abstraction has 19296 states and 58279 transitions. [2019-12-27 22:44:23,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:44:23,093 INFO L276 IsEmpty]: Start isEmpty. Operand 19296 states and 58279 transitions. [2019-12-27 22:44:23,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:44:23,115 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:44:23,115 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-27 22:44:23,115 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-27 22:44:23,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:44:23,116 INFO L82 PathProgramCache]: Analyzing trace with hash 41129598, now seen corresponding path program 2 times [2019-12-27 22:44:23,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:44:23,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403174989] [2019-12-27 22:44:23,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:44:23,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:44:23,211 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-27 22:44:23,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403174989] [2019-12-27 22:44:23,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:44:23,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 22:44:23,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [361110358] [2019-12-27 22:44:23,213 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:44:23,230 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:44:23,542 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 196 states and 360 transitions. [2019-12-27 22:44:23,543 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:44:23,674 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 22:44:23,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:44:23,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:44:23,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:44:23,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:44:23,676 INFO L87 Difference]: Start difference. First operand 19296 states and 58279 transitions. Second operand 10 states. [2019-12-27 22:44:24,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:44:24,822 INFO L93 Difference]: Finished difference Result 28177 states and 83144 transitions. [2019-12-27 22:44:24,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 22:44:24,823 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-12-27 22:44:24,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:44:24,861 INFO L225 Difference]: With dead ends: 28177 [2019-12-27 22:44:24,862 INFO L226 Difference]: Without dead ends: 28177 [2019-12-27 22:44:24,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 8 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2019-12-27 22:44:24,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28177 states. [2019-12-27 22:44:25,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28177 to 20783. [2019-12-27 22:44:25,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20783 states. [2019-12-27 22:44:25,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20783 states to 20783 states and 62564 transitions. [2019-12-27 22:44:25,239 INFO L78 Accepts]: Start accepts. Automaton has 20783 states and 62564 transitions. Word has length 55 [2019-12-27 22:44:25,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:44:25,239 INFO L462 AbstractCegarLoop]: Abstraction has 20783 states and 62564 transitions. [2019-12-27 22:44:25,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:44:25,240 INFO L276 IsEmpty]: Start isEmpty. Operand 20783 states and 62564 transitions. [2019-12-27 22:44:25,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:44:25,264 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:44:25,264 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:44:25,264 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:44:25,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:44:25,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1084774030, now seen corresponding path program 3 times [2019-12-27 22:44:25,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:44:25,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520924171] [2019-12-27 22:44:25,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:44:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:44:25,385 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-27 22:44:25,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520924171] [2019-12-27 22:44:25,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:44:25,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 22:44:25,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [205158417] [2019-12-27 22:44:25,386 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:44:25,401 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:44:25,523 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 180 states and 332 transitions. [2019-12-27 22:44:25,523 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:44:25,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:44:25,750 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 22:44:25,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 22:44:25,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:44:25,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 22:44:25,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-27 22:44:25,752 INFO L87 Difference]: Start difference. First operand 20783 states and 62564 transitions. Second operand 13 states. [2019-12-27 22:44:27,358 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-12-27 22:44:28,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:44:28,879 INFO L93 Difference]: Finished difference Result 26567 states and 78569 transitions. [2019-12-27 22:44:28,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 22:44:28,880 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2019-12-27 22:44:28,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:44:28,916 INFO L225 Difference]: With dead ends: 26567 [2019-12-27 22:44:28,916 INFO L226 Difference]: Without dead ends: 26567 [2019-12-27 22:44:28,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 16 SyntacticMatches, 8 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=255, Invalid=1227, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 22:44:29,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26567 states. [2019-12-27 22:44:29,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26567 to 18529. [2019-12-27 22:44:29,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18529 states. [2019-12-27 22:44:29,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18529 states to 18529 states and 56149 transitions. [2019-12-27 22:44:29,266 INFO L78 Accepts]: Start accepts. Automaton has 18529 states and 56149 transitions. Word has length 55 [2019-12-27 22:44:29,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:44:29,267 INFO L462 AbstractCegarLoop]: Abstraction has 18529 states and 56149 transitions. [2019-12-27 22:44:29,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 22:44:29,267 INFO L276 IsEmpty]: Start isEmpty. Operand 18529 states and 56149 transitions. [2019-12-27 22:44:29,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:44:29,287 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:44:29,287 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-27 22:44:29,288 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:44:29,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:44:29,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1247506214, now seen corresponding path program 4 times [2019-12-27 22:44:29,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:44:29,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050735058] [2019-12-27 22:44:29,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:44:29,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:44:29,408 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-27 22:44:29,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050735058] [2019-12-27 22:44:29,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:44:29,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 22:44:29,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1308931324] [2019-12-27 22:44:29,409 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:44:29,425 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:44:29,549 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 139 states and 226 transitions. [2019-12-27 22:44:29,549 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:44:29,705 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 22:44:29,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 22:44:29,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:44:29,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 22:44:29,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-27 22:44:29,707 INFO L87 Difference]: Start difference. First operand 18529 states and 56149 transitions. Second operand 12 states. [2019-12-27 22:44:31,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:44:31,179 INFO L93 Difference]: Finished difference Result 33639 states and 101191 transitions. [2019-12-27 22:44:31,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 22:44:31,179 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-12-27 22:44:31,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:44:31,216 INFO L225 Difference]: With dead ends: 33639 [2019-12-27 22:44:31,216 INFO L226 Difference]: Without dead ends: 26471 [2019-12-27 22:44:31,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2019-12-27 22:44:31,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26471 states. [2019-12-27 22:44:31,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26471 to 19041. [2019-12-27 22:44:31,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19041 states. [2019-12-27 22:44:31,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19041 states to 19041 states and 57238 transitions. [2019-12-27 22:44:31,738 INFO L78 Accepts]: Start accepts. Automaton has 19041 states and 57238 transitions. Word has length 55 [2019-12-27 22:44:31,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:44:31,738 INFO L462 AbstractCegarLoop]: Abstraction has 19041 states and 57238 transitions. [2019-12-27 22:44:31,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 22:44:31,738 INFO L276 IsEmpty]: Start isEmpty. Operand 19041 states and 57238 transitions. [2019-12-27 22:44:31,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:44:31,764 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:44:31,764 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-27 22:44:31,764 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:44:31,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:44:31,764 INFO L82 PathProgramCache]: Analyzing trace with hash -653717204, now seen corresponding path program 5 times [2019-12-27 22:44:31,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:44:31,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823830928] [2019-12-27 22:44:31,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:44:31,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:44:31,826 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-27 22:44:31,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823830928] [2019-12-27 22:44:31,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:44:31,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:44:31,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1512127813] [2019-12-27 22:44:31,827 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:44:31,842 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:44:31,965 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 136 states and 227 transitions. [2019-12-27 22:44:31,966 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:44:31,966 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:44:31,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:44:31,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:44:31,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:44:31,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:44:31,967 INFO L87 Difference]: Start difference. First operand 19041 states and 57238 transitions. Second operand 3 states. [2019-12-27 22:44:32,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:44:32,054 INFO L93 Difference]: Finished difference Result 19039 states and 57233 transitions. [2019-12-27 22:44:32,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:44:32,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 22:44:32,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:44:32,087 INFO L225 Difference]: With dead ends: 19039 [2019-12-27 22:44:32,088 INFO L226 Difference]: Without dead ends: 19039 [2019-12-27 22:44:32,088 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-27 22:44:32,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19039 states. [2019-12-27 22:44:32,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19039 to 17347. [2019-12-27 22:44:32,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17347 states. [2019-12-27 22:44:32,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17347 states to 17347 states and 52574 transitions. [2019-12-27 22:44:32,641 INFO L78 Accepts]: Start accepts. Automaton has 17347 states and 52574 transitions. Word has length 55 [2019-12-27 22:44:32,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:44:32,642 INFO L462 AbstractCegarLoop]: Abstraction has 17347 states and 52574 transitions. [2019-12-27 22:44:32,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:44:32,642 INFO L276 IsEmpty]: Start isEmpty. Operand 17347 states and 52574 transitions. [2019-12-27 22:44:32,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 22:44:32,678 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:44:32,678 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-27 22:44:32,678 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:44:32,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:44:32,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1955053525, now seen corresponding path program 1 times [2019-12-27 22:44:32,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:44:32,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942002439] [2019-12-27 22:44:32,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:44:32,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:44:32,978 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-27 22:44:32,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942002439] [2019-12-27 22:44:32,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:44:32,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 22:44:32,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [966021564] [2019-12-27 22:44:32,983 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:44:32,999 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:44:33,176 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 351 transitions. [2019-12-27 22:44:33,176 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:44:33,564 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 22:44:33,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 22:44:33,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:44:33,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 22:44:33,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 22:44:33,565 INFO L87 Difference]: Start difference. First operand 17347 states and 52574 transitions. Second operand 15 states. [2019-12-27 22:44:35,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:44:35,643 INFO L93 Difference]: Finished difference Result 31998 states and 95959 transitions. [2019-12-27 22:44:35,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 22:44:35,644 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-27 22:44:35,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:44:35,680 INFO L225 Difference]: With dead ends: 31998 [2019-12-27 22:44:35,680 INFO L226 Difference]: Without dead ends: 26114 [2019-12-27 22:44:35,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 6 SyntacticMatches, 7 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=282, Invalid=1278, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 22:44:35,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26114 states. [2019-12-27 22:44:35,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26114 to 16723. [2019-12-27 22:44:35,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16723 states. [2019-12-27 22:44:35,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16723 states to 16723 states and 50674 transitions. [2019-12-27 22:44:35,997 INFO L78 Accepts]: Start accepts. Automaton has 16723 states and 50674 transitions. Word has length 56 [2019-12-27 22:44:35,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:44:35,997 INFO L462 AbstractCegarLoop]: Abstraction has 16723 states and 50674 transitions. [2019-12-27 22:44:35,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 22:44:35,998 INFO L276 IsEmpty]: Start isEmpty. Operand 16723 states and 50674 transitions. [2019-12-27 22:44:36,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 22:44:36,016 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:44:36,016 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-27 22:44:36,016 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:44:36,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:44:36,016 INFO L82 PathProgramCache]: Analyzing trace with hash 379887659, now seen corresponding path program 2 times [2019-12-27 22:44:36,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:44:36,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832742029] [2019-12-27 22:44:36,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:44:36,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:44:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:44:36,128 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 22:44:36,128 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 22:44:36,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_53| 0 0))) (and (= 0 v_~x$w_buff1~0_24) (= v_~main$tmp_guard0~0_10 0) (= v_~x$r_buff1_thd1~0_42 0) (= 0 v_~x$r_buff0_thd2~0_24) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2345~0.base_19|)) (= 0 v_~x$r_buff0_thd0~0_20) (= v_~__unbuffered_p2_EBX~0_14 0) (= 0 v_~weak$$choice0~0_5) (= v_~z~0_10 0) (= 0 v_~__unbuffered_p0_EAX~0_14) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t2345~0.base_19| 4)) (= 0 v_~x$read_delayed_var~0.base_8) (= v_~x$w_buff1_used~0_67 0) (= |v_#valid_51| (store .cse0 |v_ULTIMATE.start_main_~#t2345~0.base_19| 1)) (< 0 |v_#StackHeapBarrier_14|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~x$read_delayed~0_8) (= 0 v_~x$read_delayed_var~0.offset_8) (= v_~x$flush_delayed~0_14 0) (= 0 v_~x$r_buff0_thd1~0_71) (= v_~x$r_buff1_thd2~0_16 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t2345~0.base_19|) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2345~0.base_19| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2345~0.base_19|) |v_ULTIMATE.start_main_~#t2345~0.offset_15| 0))) (= 0 v_~x$w_buff0_used~0_110) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_15 0) (= 0 |v_ULTIMATE.start_main_~#t2345~0.offset_15|) (= 0 v_~__unbuffered_cnt~0_22) (= v_~x$mem_tmp~0_11 0) (= v_~x~0_25 0) (= 0 v_~x$r_buff0_thd3~0_19) (= v_~y~0_10 0) (= 0 v_~__unbuffered_p2_EAX~0_14) (= v_~x$r_buff1_thd0~0_19 0) (= 0 v_~x$w_buff0~0_29) (= 0 |v_#NULL.base_5|) (= v_~x$r_buff1_thd3~0_16 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_29, ~x$flush_delayed~0=v_~x$flush_delayed~0_14, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_42, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_19, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_9|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ULTIMATE.start_main_~#t2345~0.offset=|v_ULTIMATE.start_main_~#t2345~0.offset_15|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~x$w_buff1~0=v_~x$w_buff1~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_67, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_8, ~weak$$choice0~0=v_~weak$$choice0~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t2347~0.base=|v_ULTIMATE.start_main_~#t2347~0.base_21|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~x~0=v_~x~0_25, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_71, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_17|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_~#t2346~0.offset=|v_ULTIMATE.start_main_~#t2346~0.offset_16|, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_9|, ~y~0=v_~y~0_10, ULTIMATE.start_main_~#t2346~0.base=|v_ULTIMATE.start_main_~#t2346~0.base_21|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_7|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_19, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_24, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_110, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_14|, ULTIMATE.start_main_~#t2345~0.base=|v_ULTIMATE.start_main_~#t2345~0.base_19|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t2347~0.offset=|v_ULTIMATE.start_main_~#t2347~0.offset_16|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ~z~0=v_~z~0_10, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x$read_delayed~0=v_~x$read_delayed~0_8} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2345~0.offset, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t2347~0.base, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t2346~0.offset, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_~#t2346~0.base, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, ULTIMATE.start_main_~#t2345~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t2347~0.offset, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 22:44:36,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L820-1-->L822: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2346~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t2346~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t2346~0.offset_11|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2346~0.base_13| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2346~0.base_13|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2346~0.base_13|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2346~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2346~0.base_13|) |v_ULTIMATE.start_main_~#t2346~0.offset_11| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2346~0.offset=|v_ULTIMATE.start_main_~#t2346~0.offset_11|, ULTIMATE.start_main_~#t2346~0.base=|v_ULTIMATE.start_main_~#t2346~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2346~0.offset, ULTIMATE.start_main_~#t2346~0.base] because there is no mapped edge [2019-12-27 22:44:36,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L822-1-->L824: Formula: (and (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2347~0.base_13| 4) |v_#length_17|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2347~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t2347~0.base_13| 0)) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2347~0.base_13|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2347~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2347~0.base_13|) |v_ULTIMATE.start_main_~#t2347~0.offset_11| 2)) |v_#memory_int_17|) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2347~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t2347~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2347~0.base=|v_ULTIMATE.start_main_~#t2347~0.base_13|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t2347~0.offset=|v_ULTIMATE.start_main_~#t2347~0.offset_11|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2347~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t2347~0.offset, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 22:44:36,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] P1ENTRY-->L5-3: Formula: (and (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1384632357| P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1384632357) (= ~x$w_buff0~0_In-1384632357 ~x$w_buff1~0_Out-1384632357) (= ~x$w_buff0~0_Out-1384632357 1) (= |P1Thread1of1ForFork0_#in~arg.base_In-1384632357| P1Thread1of1ForFork0_~arg.base_Out-1384632357) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1384632357| 1) (= ~x$w_buff1_used~0_Out-1384632357 ~x$w_buff0_used~0_In-1384632357) (= ~x$w_buff0_used~0_Out-1384632357 1) (= |P1Thread1of1ForFork0_#in~arg.offset_In-1384632357| P1Thread1of1ForFork0_~arg.offset_Out-1384632357) (= (mod ~x$w_buff1_used~0_Out-1384632357 256) 0)) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1384632357, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-1384632357|, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-1384632357|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1384632357} OutVars{~x$w_buff0~0=~x$w_buff0~0_Out-1384632357, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1384632357, P1Thread1of1ForFork0_~arg.offset=P1Thread1of1ForFork0_~arg.offset_Out-1384632357, P1Thread1of1ForFork0_~arg.base=P1Thread1of1ForFork0_~arg.base_Out-1384632357, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1384632357|, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-1384632357|, ~x$w_buff1~0=~x$w_buff1~0_Out-1384632357, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-1384632357|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-1384632357, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-1384632357} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 22:44:36,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L797-2-->L797-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In1240110796 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1240110796 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite32_Out1240110796| ~x$w_buff1~0_In1240110796)) (and (or .cse1 .cse0) (= ~x~0_In1240110796 |P2Thread1of1ForFork1_#t~ite32_Out1240110796|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1240110796, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1240110796, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1240110796, ~x~0=~x~0_In1240110796} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out1240110796|, ~x$w_buff1~0=~x$w_buff1~0_In1240110796, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1240110796, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1240110796, ~x~0=~x~0_In1240110796} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 22:44:36,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L797-4-->L798: Formula: (= v_~x~0_19 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 22:44:36,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In824688624 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In824688624 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In824688624 |P2Thread1of1ForFork1_#t~ite34_Out824688624|)) (and (= 0 |P2Thread1of1ForFork1_#t~ite34_Out824688624|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In824688624, ~x$w_buff0_used~0=~x$w_buff0_used~0_In824688624} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out824688624|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In824688624, ~x$w_buff0_used~0=~x$w_buff0_used~0_In824688624} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 22:44:36,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In452730106 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In452730106 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In452730106 |P1Thread1of1ForFork0_#t~ite28_Out452730106|)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out452730106|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In452730106, ~x$w_buff0_used~0=~x$w_buff0_used~0_In452730106} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In452730106, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out452730106|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In452730106} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 22:44:36,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In211435653 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In211435653 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In211435653 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd2~0_In211435653 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In211435653 |P1Thread1of1ForFork0_#t~ite29_Out211435653|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out211435653|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In211435653, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In211435653, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In211435653, ~x$w_buff0_used~0=~x$w_buff0_used~0_In211435653} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In211435653, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In211435653, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In211435653, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out211435653|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In211435653} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 22:44:36,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L780-->L781: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In291041392 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In291041392 256)))) (or (and (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out291041392) (not .cse1)) (and (= ~x$r_buff0_thd2~0_In291041392 ~x$r_buff0_thd2~0_Out291041392) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In291041392, ~x$w_buff0_used~0=~x$w_buff0_used~0_In291041392} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out291041392|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out291041392, ~x$w_buff0_used~0=~x$w_buff0_used~0_In291041392} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 22:44:36,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L781-->L781-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1003687792 256))) (.cse3 (= (mod ~x$r_buff1_thd2~0_In-1003687792 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1003687792 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-1003687792 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-1003687792|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~x$r_buff1_thd2~0_In-1003687792 |P1Thread1of1ForFork0_#t~ite31_Out-1003687792|) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1003687792, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1003687792, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1003687792, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1003687792} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1003687792|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1003687792, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1003687792, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1003687792, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1003687792} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 22:44:36,141 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L781-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd2~0_11 |v_P1Thread1of1ForFork0_#t~ite31_8|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, 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-27 22:44:36,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L743-->L743-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1558393642 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite12_Out1558393642| ~x$w_buff1~0_In1558393642) (= |P0Thread1of1ForFork2_#t~ite11_In1558393642| |P0Thread1of1ForFork2_#t~ite11_Out1558393642|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1558393642 256)))) (or (and (= 0 (mod ~x$w_buff1_used~0_In1558393642 256)) .cse1) (= (mod ~x$w_buff0_used~0_In1558393642 256) 0) (and (= (mod ~x$r_buff1_thd1~0_In1558393642 256) 0) .cse1))) .cse0 (= |P0Thread1of1ForFork2_#t~ite11_Out1558393642| ~x$w_buff1~0_In1558393642) (= |P0Thread1of1ForFork2_#t~ite11_Out1558393642| |P0Thread1of1ForFork2_#t~ite12_Out1558393642|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1558393642, ~x$w_buff1~0=~x$w_buff1~0_In1558393642, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1558393642, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1558393642, ~weak$$choice2~0=~weak$$choice2~0_In1558393642, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In1558393642|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1558393642} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1558393642, ~x$w_buff1~0=~x$w_buff1~0_In1558393642, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1558393642, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1558393642, ~weak$$choice2~0=~weak$$choice2~0_In1558393642, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out1558393642|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out1558393642|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1558393642} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 22:44:36,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L744-->L744-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1364766239 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite14_In1364766239| |P0Thread1of1ForFork2_#t~ite14_Out1364766239|) (= |P0Thread1of1ForFork2_#t~ite15_Out1364766239| ~x$w_buff0_used~0_In1364766239) (not .cse0)) (and .cse0 (= |P0Thread1of1ForFork2_#t~ite15_Out1364766239| |P0Thread1of1ForFork2_#t~ite14_Out1364766239|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In1364766239 256) 0))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1364766239 256))) (and (= (mod ~x$w_buff1_used~0_In1364766239 256) 0) .cse1) (= 0 (mod ~x$w_buff0_used~0_In1364766239 256)))) (= ~x$w_buff0_used~0_In1364766239 |P0Thread1of1ForFork2_#t~ite14_Out1364766239|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1364766239, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1364766239, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1364766239, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In1364766239|, ~weak$$choice2~0=~weak$$choice2~0_In1364766239, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1364766239} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1364766239, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1364766239, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out1364766239|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1364766239, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out1364766239|, ~weak$$choice2~0=~weak$$choice2~0_In1364766239, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1364766239} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 22:44:36,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L745-->L745-8: Formula: (let ((.cse1 (= |P0Thread1of1ForFork2_#t~ite18_Out-208798393| |P0Thread1of1ForFork2_#t~ite17_Out-208798393|)) (.cse2 (= (mod ~x$w_buff0_used~0_In-208798393 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-208798393 256) 0)) (.cse0 (= (mod ~weak$$choice2~0_In-208798393 256) 0)) (.cse5 (= 0 (mod ~x$r_buff1_thd1~0_In-208798393 256))) (.cse4 (= 0 (mod ~x$r_buff0_thd1~0_In-208798393 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite16_In-208798393| |P0Thread1of1ForFork2_#t~ite16_Out-208798393|) (or (and (= |P0Thread1of1ForFork2_#t~ite18_Out-208798393| ~x$w_buff1_used~0_In-208798393) (= |P0Thread1of1ForFork2_#t~ite17_In-208798393| |P0Thread1of1ForFork2_#t~ite17_Out-208798393|) (not .cse0)) (and .cse1 .cse0 (= ~x$w_buff1_used~0_In-208798393 |P0Thread1of1ForFork2_#t~ite17_Out-208798393|) (or .cse2 (and .cse3 .cse4) (and .cse4 .cse5))))) (let ((.cse6 (not .cse4))) (and .cse1 (= |P0Thread1of1ForFork2_#t~ite16_Out-208798393| |P0Thread1of1ForFork2_#t~ite17_Out-208798393|) (not .cse2) (or .cse6 (not .cse3)) .cse0 (or .cse6 (not .cse5)) (= |P0Thread1of1ForFork2_#t~ite16_Out-208798393| 0))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-208798393, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-208798393|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-208798393, P0Thread1of1ForFork2_#t~ite16=|P0Thread1of1ForFork2_#t~ite16_In-208798393|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-208798393, ~weak$$choice2~0=~weak$$choice2~0_In-208798393, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-208798393} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-208798393, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-208798393|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-208798393|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-208798393, P0Thread1of1ForFork2_#t~ite16=|P0Thread1of1ForFork2_#t~ite16_Out-208798393|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-208798393, ~weak$$choice2~0=~weak$$choice2~0_In-208798393, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-208798393} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17, P0Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-27 22:44:36,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L746-->L747: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~x$r_buff0_thd1~0_44 v_~x$r_buff0_thd1~0_43)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_44, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_8|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_7|, ~weak$$choice2~0=v_~weak$$choice2~0_19, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 22:44:36,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L747-->L747-8: Formula: (let ((.cse4 (= (mod ~x$w_buff0_used~0_In-1328741410 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd1~0_In-1328741410 256) 0)) (.cse6 (= 0 (mod ~x$r_buff0_thd1~0_In-1328741410 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-1328741410 256) 0)) (.cse5 (= |P0Thread1of1ForFork2_#t~ite24_Out-1328741410| |P0Thread1of1ForFork2_#t~ite23_Out-1328741410|)) (.cse0 (= (mod ~weak$$choice2~0_In-1328741410 256) 0))) (or (let ((.cse2 (not .cse6))) (and .cse0 (= |P0Thread1of1ForFork2_#t~ite23_Out-1328741410| |P0Thread1of1ForFork2_#t~ite22_Out-1328741410|) (or (not .cse1) .cse2) (or (not .cse3) .cse2) (not .cse4) .cse5 (= 0 |P0Thread1of1ForFork2_#t~ite22_Out-1328741410|))) (and (= |P0Thread1of1ForFork2_#t~ite22_In-1328741410| |P0Thread1of1ForFork2_#t~ite22_Out-1328741410|) (or (and .cse0 (or .cse4 (and .cse3 .cse6) (and .cse6 .cse1)) .cse5 (= ~x$r_buff1_thd1~0_In-1328741410 |P0Thread1of1ForFork2_#t~ite23_Out-1328741410|)) (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite23_In-1328741410| |P0Thread1of1ForFork2_#t~ite23_Out-1328741410|) (= ~x$r_buff1_thd1~0_In-1328741410 |P0Thread1of1ForFork2_#t~ite24_Out-1328741410|)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1328741410, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1328741410, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1328741410, ~weak$$choice2~0=~weak$$choice2~0_In-1328741410, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-1328741410|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_In-1328741410|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1328741410} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1328741410, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1328741410, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1328741410, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-1328741410|, ~weak$$choice2~0=~weak$$choice2~0_In-1328741410, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-1328741410|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_Out-1328741410|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1328741410} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22] because there is no mapped edge [2019-12-27 22:44:36,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L749-->L757: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_18) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 22:44:36,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In166847850 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In166847850 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In166847850 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In166847850 256)))) (or (and (= ~x$w_buff1_used~0_In166847850 |P2Thread1of1ForFork1_#t~ite35_Out166847850|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out166847850|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In166847850, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In166847850, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In166847850, ~x$w_buff0_used~0=~x$w_buff0_used~0_In166847850} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out166847850|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In166847850, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In166847850, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In166847850, ~x$w_buff0_used~0=~x$w_buff0_used~0_In166847850} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 22:44:36,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In2129325763 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In2129325763 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite36_Out2129325763| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite36_Out2129325763| ~x$r_buff0_thd3~0_In2129325763)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2129325763, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2129325763} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out2129325763|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2129325763, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2129325763} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 22:44:36,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd3~0_In1214280787 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In1214280787 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In1214280787 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1214280787 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite37_Out1214280787|)) (and (= ~x$r_buff1_thd3~0_In1214280787 |P2Thread1of1ForFork1_#t~ite37_Out1214280787|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1214280787, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1214280787, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1214280787, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1214280787} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1214280787|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1214280787, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1214280787, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1214280787, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1214280787} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 22:44:36,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork1_#t~ite37_8|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, 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-27 22:44:36,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L824-1-->L830: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 22:44:36,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L830-2-->L830-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1917086711 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1917086711 256)))) (or (and (not .cse0) (= ~x$w_buff1~0_In1917086711 |ULTIMATE.start_main_#t~ite41_Out1917086711|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite41_Out1917086711| ~x~0_In1917086711) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1917086711, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1917086711, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1917086711, ~x~0=~x~0_In1917086711} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1917086711|, ~x$w_buff1~0=~x$w_buff1~0_In1917086711, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1917086711, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1917086711, ~x~0=~x~0_In1917086711} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 22:44:36,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L830-4-->L831: Formula: (= v_~x~0_14 |v_ULTIMATE.start_main_#t~ite41_8|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_7|, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-27 22:44:36,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1629373109 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1629373109 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite43_Out1629373109| 0)) (and (= |ULTIMATE.start_main_#t~ite43_Out1629373109| ~x$w_buff0_used~0_In1629373109) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1629373109, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1629373109} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1629373109, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1629373109|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1629373109} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 22:44:36,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L832-->L832-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-81740409 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-81740409 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-81740409 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-81740409 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-81740409| ~x$w_buff1_used~0_In-81740409) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite44_Out-81740409|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-81740409, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-81740409, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-81740409, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-81740409} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-81740409, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-81740409, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-81740409, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-81740409|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-81740409} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 22:44:36,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L833-->L833-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-1843932393 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1843932393 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In-1843932393 |ULTIMATE.start_main_#t~ite45_Out-1843932393|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite45_Out-1843932393|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1843932393, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1843932393} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1843932393, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1843932393|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1843932393} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 22:44:36,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L834-->L834-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In1523733808 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1523733808 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1523733808 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1523733808 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite46_Out1523733808|)) (and (= ~x$r_buff1_thd0~0_In1523733808 |ULTIMATE.start_main_#t~ite46_Out1523733808|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1523733808, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1523733808, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1523733808, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1523733808} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1523733808, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1523733808|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1523733808, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1523733808, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1523733808} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 22:44:36,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_9 0) (= v_~__unbuffered_p0_EAX~0_8 0) (= v_~x$r_buff1_thd0~0_13 |v_ULTIMATE.start_main_#t~ite46_11|) (= v_~__unbuffered_p2_EBX~0_8 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_9 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_13, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} 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-27 22:44:36,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:44:36 BasicIcfg [2019-12-27 22:44:36,215 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 22:44:36,217 INFO L168 Benchmark]: Toolchain (without parser) took 85487.64 ms. Allocated memory was 142.6 MB in the beginning and 2.0 GB in the end (delta: 1.9 GB). Free memory was 98.5 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 679.3 MB. Max. memory is 7.1 GB. [2019-12-27 22:44:36,217 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 142.6 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 22:44:36,218 INFO L168 Benchmark]: CACSL2BoogieTranslator took 814.55 ms. Allocated memory was 142.6 MB in the beginning and 199.8 MB in the end (delta: 57.1 MB). Free memory was 98.3 MB in the beginning and 153.3 MB in the end (delta: -55.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-27 22:44:36,218 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.77 ms. Allocated memory is still 199.8 MB. Free memory was 153.3 MB in the beginning and 150.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 22:44:36,219 INFO L168 Benchmark]: Boogie Preprocessor took 43.04 ms. Allocated memory is still 199.8 MB. Free memory was 150.4 MB in the beginning and 148.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 22:44:36,219 INFO L168 Benchmark]: RCFGBuilder took 849.92 ms. Allocated memory is still 199.8 MB. Free memory was 148.3 MB in the beginning and 101.7 MB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 7.1 GB. [2019-12-27 22:44:36,220 INFO L168 Benchmark]: TraceAbstraction took 83704.70 ms. Allocated memory was 199.8 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 101.0 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 624.7 MB. Max. memory is 7.1 GB. [2019-12-27 22:44:36,223 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.21 ms. Allocated memory is still 142.6 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 814.55 ms. Allocated memory was 142.6 MB in the beginning and 199.8 MB in the end (delta: 57.1 MB). Free memory was 98.3 MB in the beginning and 153.3 MB in the end (delta: -55.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.77 ms. Allocated memory is still 199.8 MB. Free memory was 153.3 MB in the beginning and 150.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.04 ms. Allocated memory is still 199.8 MB. Free memory was 150.4 MB in the beginning and 148.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 849.92 ms. Allocated memory is still 199.8 MB. Free memory was 148.3 MB in the beginning and 101.7 MB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 83704.70 ms. Allocated memory was 199.8 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 101.0 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 624.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 164 ProgramPointsBefore, 82 ProgramPointsAfterwards, 195 TransitionsBefore, 87 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 25 ConcurrentYvCompositions, 30 ChoiceCompositions, 6629 VarBasedMoverChecksPositive, 194 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 75034 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2345, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L822] FCALL, FORK 0 pthread_create(&t2346, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L767] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L768] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L769] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L770] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L771] 2 x$r_buff0_thd2 = (_Bool)1 [L774] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L777] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L824] FCALL, FORK 0 pthread_create(&t2347, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L791] 3 __unbuffered_p2_EAX = y [L794] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, z=0] [L797] 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, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, z=0] [L732] 1 z = 1 [L737] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L738] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L739] 1 x$flush_delayed = weak$$choice2 [L740] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] 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, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] 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) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 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 [L741] 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) [L742] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L742] 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)) [L743] 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)) [L744] 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)) [L745] 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)) [L747] 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)) [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] 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 [L800] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 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, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L831] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 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 [L833] 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, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 83.4s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 31.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4805 SDtfs, 6344 SDslu, 17746 SDs, 0 SdLazy, 13043 SolverSat, 325 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 455 GetRequests, 100 SyntacticMatches, 70 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1461 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111273occurred 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: 27.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 216221 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 908 NumberOfCodeBlocks, 908 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 830 ConstructedInterpolants, 0 QuantifiedInterpolants, 143388 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...