/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/mix031_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:55:20,522 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:55:20,525 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:55:20,536 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:55:20,537 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:55:20,538 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:55:20,539 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:55:20,541 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:55:20,542 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:55:20,543 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:55:20,544 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:55:20,545 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:55:20,545 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:55:20,546 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:55:20,547 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:55:20,548 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:55:20,549 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:55:20,550 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:55:20,553 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:55:20,555 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:55:20,557 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:55:20,557 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:55:20,559 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:55:20,559 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:55:20,561 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:55:20,561 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:55:20,562 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:55:20,563 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:55:20,563 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:55:20,564 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:55:20,564 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:55:20,565 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:55:20,565 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:55:20,566 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:55:20,567 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:55:20,567 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:55:20,568 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:55:20,568 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:55:20,568 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:55:20,569 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:55:20,570 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:55:20,570 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 20:55:20,584 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:55:20,585 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:55:20,586 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:55:20,586 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:55:20,586 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:55:20,586 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:55:20,586 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:55:20,587 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:55:20,587 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:55:20,587 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:55:20,587 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:55:20,587 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:55:20,588 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:55:20,588 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:55:20,588 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:55:20,588 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:55:20,588 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:55:20,589 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:55:20,589 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:55:20,589 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:55:20,589 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:55:20,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:55:20,590 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:55:20,590 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:55:20,590 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:55:20,590 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:55:20,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:55:20,590 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:55:20,591 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:55:20,591 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:55:20,591 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:55:20,591 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:55:20,845 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:55:20,863 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:55:20,867 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:55:20,869 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:55:20,869 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:55:20,870 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031_tso.oepc.i [2019-12-27 20:55:20,939 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/411329357/088bdf53d0fb4032a0c67becb5ec769e/FLAG5c6ccd987 [2019-12-27 20:55:21,476 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:55:21,477 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031_tso.oepc.i [2019-12-27 20:55:21,506 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/411329357/088bdf53d0fb4032a0c67becb5ec769e/FLAG5c6ccd987 [2019-12-27 20:55:21,757 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/411329357/088bdf53d0fb4032a0c67becb5ec769e [2019-12-27 20:55:21,768 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:55:21,770 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:55:21,774 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:55:21,774 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:55:21,777 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:55:21,778 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:55:21" (1/1) ... [2019-12-27 20:55:21,782 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25e03748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:21, skipping insertion in model container [2019-12-27 20:55:21,782 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:55:21" (1/1) ... [2019-12-27 20:55:21,789 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:55:21,842 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:55:22,346 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:55:22,361 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:55:22,429 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:55:22,514 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:55:22,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:22 WrapperNode [2019-12-27 20:55:22,515 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:55:22,516 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:55:22,516 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:55:22,518 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:55:22,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:22" (1/1) ... [2019-12-27 20:55:22,546 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:22" (1/1) ... [2019-12-27 20:55:22,576 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:55:22,576 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:55:22,576 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:55:22,577 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:55:22,586 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:22" (1/1) ... [2019-12-27 20:55:22,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:22" (1/1) ... [2019-12-27 20:55:22,591 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:22" (1/1) ... [2019-12-27 20:55:22,592 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:22" (1/1) ... [2019-12-27 20:55:22,604 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:22" (1/1) ... [2019-12-27 20:55:22,609 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:22" (1/1) ... [2019-12-27 20:55:22,613 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:22" (1/1) ... [2019-12-27 20:55:22,618 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:55:22,618 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:55:22,618 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:55:22,619 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:55:22,619 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:22" (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 20:55:22,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:55:22,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:55:22,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:55:22,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:55:22,701 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:55:22,701 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:55:22,701 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:55:22,701 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:55:22,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:55:22,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:55:22,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:55:22,704 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 20:55:23,431 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:55:23,431 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:55:23,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:55:23 BoogieIcfgContainer [2019-12-27 20:55:23,432 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:55:23,434 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:55:23,435 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:55:23,437 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:55:23,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:55:21" (1/3) ... [2019-12-27 20:55:23,438 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb44b9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:55:23, skipping insertion in model container [2019-12-27 20:55:23,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:22" (2/3) ... [2019-12-27 20:55:23,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb44b9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:55:23, skipping insertion in model container [2019-12-27 20:55:23,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:55:23" (3/3) ... [2019-12-27 20:55:23,441 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_tso.oepc.i [2019-12-27 20:55:23,451 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:55:23,451 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:55:23,459 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:55:23,461 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:55:23,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,501 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,501 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,501 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,502 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,502 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,512 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,512 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,563 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,563 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,564 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,569 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,572 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:23,587 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 20:55:23,607 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:55:23,608 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:55:23,608 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:55:23,608 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:55:23,608 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:55:23,608 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:55:23,609 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:55:23,609 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:55:23,626 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 185 transitions [2019-12-27 20:55:23,628 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 185 transitions [2019-12-27 20:55:23,720 INFO L132 PetriNetUnfolder]: 41/183 cut-off events. [2019-12-27 20:55:23,720 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:55:23,733 INFO L76 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 183 events. 41/183 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 20:55:23,753 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 185 transitions [2019-12-27 20:55:23,800 INFO L132 PetriNetUnfolder]: 41/183 cut-off events. [2019-12-27 20:55:23,800 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:55:23,807 INFO L76 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 183 events. 41/183 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 20:55:23,826 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 20:55:23,827 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:55:27,131 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 20:55:27,245 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 20:55:27,434 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 20:55:27,564 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 20:55:27,589 INFO L206 etLargeBlockEncoding]: Checked pairs total: 56825 [2019-12-27 20:55:27,589 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-12-27 20:55:27,593 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 90 transitions [2019-12-27 20:55:28,031 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8850 states. [2019-12-27 20:55:28,033 INFO L276 IsEmpty]: Start isEmpty. Operand 8850 states. [2019-12-27 20:55:28,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 20:55:28,040 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:28,040 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 20:55:28,041 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:28,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:28,048 INFO L82 PathProgramCache]: Analyzing trace with hash 799211, now seen corresponding path program 1 times [2019-12-27 20:55:28,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:28,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12767703] [2019-12-27 20:55:28,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:28,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:28,271 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 20:55:28,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12767703] [2019-12-27 20:55:28,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:28,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:55:28,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1067056151] [2019-12-27 20:55:28,277 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:28,282 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:28,295 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 20:55:28,295 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:28,299 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:55:28,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:55:28,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:28,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:55:28,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:55:28,312 INFO L87 Difference]: Start difference. First operand 8850 states. Second operand 3 states. [2019-12-27 20:55:28,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:28,646 INFO L93 Difference]: Finished difference Result 8682 states and 28632 transitions. [2019-12-27 20:55:28,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:55:28,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 20:55:28,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:28,790 INFO L225 Difference]: With dead ends: 8682 [2019-12-27 20:55:28,793 INFO L226 Difference]: Without dead ends: 8178 [2019-12-27 20:55:28,800 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 20:55:29,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8178 states. [2019-12-27 20:55:29,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8178 to 8178. [2019-12-27 20:55:29,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8178 states. [2019-12-27 20:55:29,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8178 states to 8178 states and 26922 transitions. [2019-12-27 20:55:29,433 INFO L78 Accepts]: Start accepts. Automaton has 8178 states and 26922 transitions. Word has length 3 [2019-12-27 20:55:29,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:29,433 INFO L462 AbstractCegarLoop]: Abstraction has 8178 states and 26922 transitions. [2019-12-27 20:55:29,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:55:29,433 INFO L276 IsEmpty]: Start isEmpty. Operand 8178 states and 26922 transitions. [2019-12-27 20:55:29,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 20:55:29,439 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:29,440 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:55:29,440 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:29,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:29,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1718486747, now seen corresponding path program 1 times [2019-12-27 20:55:29,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:29,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35960873] [2019-12-27 20:55:29,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:29,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:29,574 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 20:55:29,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35960873] [2019-12-27 20:55:29,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:29,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:55:29,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1763212727] [2019-12-27 20:55:29,577 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:29,580 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:29,585 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 20:55:29,585 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:29,586 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:55:29,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:55:29,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:29,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:55:29,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:55:29,590 INFO L87 Difference]: Start difference. First operand 8178 states and 26922 transitions. Second operand 3 states. [2019-12-27 20:55:29,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:29,638 INFO L93 Difference]: Finished difference Result 1311 states and 3027 transitions. [2019-12-27 20:55:29,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:55:29,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 20:55:29,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:29,647 INFO L225 Difference]: With dead ends: 1311 [2019-12-27 20:55:29,648 INFO L226 Difference]: Without dead ends: 1311 [2019-12-27 20:55:29,649 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 20:55:29,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2019-12-27 20:55:29,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 1311. [2019-12-27 20:55:29,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1311 states. [2019-12-27 20:55:29,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 3027 transitions. [2019-12-27 20:55:29,710 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 3027 transitions. Word has length 11 [2019-12-27 20:55:29,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:29,710 INFO L462 AbstractCegarLoop]: Abstraction has 1311 states and 3027 transitions. [2019-12-27 20:55:29,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:55:29,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 3027 transitions. [2019-12-27 20:55:29,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:55:29,718 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:29,718 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:55:29,718 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:29,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:29,719 INFO L82 PathProgramCache]: Analyzing trace with hash 950402147, now seen corresponding path program 1 times [2019-12-27 20:55:29,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:29,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292929965] [2019-12-27 20:55:29,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:29,824 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 20:55:29,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292929965] [2019-12-27 20:55:29,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:29,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:55:29,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1462578158] [2019-12-27 20:55:29,825 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:29,827 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:29,830 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 20:55:29,831 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:29,831 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:55:29,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:55:29,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:29,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:55:29,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:55:29,832 INFO L87 Difference]: Start difference. First operand 1311 states and 3027 transitions. Second operand 3 states. [2019-12-27 20:55:29,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:29,912 INFO L93 Difference]: Finished difference Result 2020 states and 4648 transitions. [2019-12-27 20:55:29,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:55:29,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 20:55:29,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:29,925 INFO L225 Difference]: With dead ends: 2020 [2019-12-27 20:55:29,926 INFO L226 Difference]: Without dead ends: 2020 [2019-12-27 20:55:29,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:55:29,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2020 states. [2019-12-27 20:55:29,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2020 to 1471. [2019-12-27 20:55:29,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2019-12-27 20:55:29,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 3484 transitions. [2019-12-27 20:55:29,975 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 3484 transitions. Word has length 14 [2019-12-27 20:55:29,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:29,976 INFO L462 AbstractCegarLoop]: Abstraction has 1471 states and 3484 transitions. [2019-12-27 20:55:29,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:55:29,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 3484 transitions. [2019-12-27 20:55:29,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:55:29,977 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:29,977 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:55:29,977 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:29,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:29,978 INFO L82 PathProgramCache]: Analyzing trace with hash 950504478, now seen corresponding path program 1 times [2019-12-27 20:55:29,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:29,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760660273] [2019-12-27 20:55:29,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:29,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:30,033 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 20:55:30,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760660273] [2019-12-27 20:55:30,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:30,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:55:30,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [553617270] [2019-12-27 20:55:30,039 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:30,041 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:30,045 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 20:55:30,045 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:30,045 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:55:30,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:55:30,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:30,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:55:30,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:55:30,047 INFO L87 Difference]: Start difference. First operand 1471 states and 3484 transitions. Second operand 4 states. [2019-12-27 20:55:30,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:30,239 INFO L93 Difference]: Finished difference Result 1830 states and 4214 transitions. [2019-12-27 20:55:30,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:55:30,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 20:55:30,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:30,251 INFO L225 Difference]: With dead ends: 1830 [2019-12-27 20:55:30,251 INFO L226 Difference]: Without dead ends: 1830 [2019-12-27 20:55:30,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:55:30,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2019-12-27 20:55:30,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1766. [2019-12-27 20:55:30,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1766 states. [2019-12-27 20:55:30,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 4090 transitions. [2019-12-27 20:55:30,359 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 4090 transitions. Word has length 14 [2019-12-27 20:55:30,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:30,360 INFO L462 AbstractCegarLoop]: Abstraction has 1766 states and 4090 transitions. [2019-12-27 20:55:30,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:55:30,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 4090 transitions. [2019-12-27 20:55:30,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:55:30,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:30,361 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:55:30,361 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:30,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:30,361 INFO L82 PathProgramCache]: Analyzing trace with hash 785604646, now seen corresponding path program 1 times [2019-12-27 20:55:30,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:30,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312746562] [2019-12-27 20:55:30,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:30,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:30,466 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 20:55:30,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312746562] [2019-12-27 20:55:30,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:30,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:55:30,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [451446580] [2019-12-27 20:55:30,468 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:30,470 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:30,473 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 20:55:30,473 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:30,474 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:55:30,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:55:30,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:30,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:55:30,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:55:30,475 INFO L87 Difference]: Start difference. First operand 1766 states and 4090 transitions. Second operand 4 states. [2019-12-27 20:55:30,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:30,667 INFO L93 Difference]: Finished difference Result 2141 states and 4886 transitions. [2019-12-27 20:55:30,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:55:30,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 20:55:30,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:30,679 INFO L225 Difference]: With dead ends: 2141 [2019-12-27 20:55:30,679 INFO L226 Difference]: Without dead ends: 2141 [2019-12-27 20:55:30,680 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 20:55:30,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2141 states. [2019-12-27 20:55:30,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2141 to 1881. [2019-12-27 20:55:30,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1881 states. [2019-12-27 20:55:30,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1881 states to 1881 states and 4350 transitions. [2019-12-27 20:55:30,727 INFO L78 Accepts]: Start accepts. Automaton has 1881 states and 4350 transitions. Word has length 14 [2019-12-27 20:55:30,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:30,728 INFO L462 AbstractCegarLoop]: Abstraction has 1881 states and 4350 transitions. [2019-12-27 20:55:30,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:55:30,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 4350 transitions. [2019-12-27 20:55:30,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 20:55:30,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:30,731 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 20:55:30,731 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:30,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:30,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1292642456, now seen corresponding path program 1 times [2019-12-27 20:55:30,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:30,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074598554] [2019-12-27 20:55:30,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:30,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:30,795 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 20:55:30,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074598554] [2019-12-27 20:55:30,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:30,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:55:30,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1186707754] [2019-12-27 20:55:30,796 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:30,800 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:30,805 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 20:55:30,805 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:30,806 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:55:30,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:55:30,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:30,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:55:30,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:55:30,808 INFO L87 Difference]: Start difference. First operand 1881 states and 4350 transitions. Second operand 5 states. [2019-12-27 20:55:31,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:31,046 INFO L93 Difference]: Finished difference Result 2408 states and 5400 transitions. [2019-12-27 20:55:31,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:55:31,047 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 20:55:31,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:31,057 INFO L225 Difference]: With dead ends: 2408 [2019-12-27 20:55:31,057 INFO L226 Difference]: Without dead ends: 2408 [2019-12-27 20:55:31,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:55:31,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2408 states. [2019-12-27 20:55:31,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2408 to 2152. [2019-12-27 20:55:31,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2152 states. [2019-12-27 20:55:31,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 4906 transitions. [2019-12-27 20:55:31,109 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 4906 transitions. Word has length 25 [2019-12-27 20:55:31,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:31,109 INFO L462 AbstractCegarLoop]: Abstraction has 2152 states and 4906 transitions. [2019-12-27 20:55:31,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:55:31,110 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 4906 transitions. [2019-12-27 20:55:31,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 20:55:31,112 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:31,112 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] [2019-12-27 20:55:31,113 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:31,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:31,113 INFO L82 PathProgramCache]: Analyzing trace with hash -797480945, now seen corresponding path program 1 times [2019-12-27 20:55:31,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:31,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292830286] [2019-12-27 20:55:31,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:31,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:31,155 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 20:55:31,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292830286] [2019-12-27 20:55:31,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:31,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:55:31,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [8255442] [2019-12-27 20:55:31,156 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:31,161 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:31,170 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 70 transitions. [2019-12-27 20:55:31,170 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:31,229 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:55:31,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:55:31,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:31,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:55:31,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:55:31,232 INFO L87 Difference]: Start difference. First operand 2152 states and 4906 transitions. Second operand 5 states. [2019-12-27 20:55:31,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:31,256 INFO L93 Difference]: Finished difference Result 1117 states and 2441 transitions. [2019-12-27 20:55:31,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:55:31,257 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 20:55:31,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:31,269 INFO L225 Difference]: With dead ends: 1117 [2019-12-27 20:55:31,269 INFO L226 Difference]: Without dead ends: 1117 [2019-12-27 20:55:31,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 20:55:31,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2019-12-27 20:55:31,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1059. [2019-12-27 20:55:31,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1059 states. [2019-12-27 20:55:31,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 2334 transitions. [2019-12-27 20:55:31,308 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 2334 transitions. Word has length 26 [2019-12-27 20:55:31,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:31,309 INFO L462 AbstractCegarLoop]: Abstraction has 1059 states and 2334 transitions. [2019-12-27 20:55:31,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:55:31,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 2334 transitions. [2019-12-27 20:55:31,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 20:55:31,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:31,312 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] [2019-12-27 20:55:31,312 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:31,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:31,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1810395798, now seen corresponding path program 1 times [2019-12-27 20:55:31,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:31,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12129748] [2019-12-27 20:55:31,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:31,434 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 20:55:31,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12129748] [2019-12-27 20:55:31,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:31,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:55:31,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [105108154] [2019-12-27 20:55:31,436 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:31,479 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:31,486 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 26 transitions. [2019-12-27 20:55:31,487 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:31,487 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:55:31,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:55:31,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:31,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:55:31,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:55:31,489 INFO L87 Difference]: Start difference. First operand 1059 states and 2334 transitions. Second operand 5 states. [2019-12-27 20:55:31,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:31,678 INFO L93 Difference]: Finished difference Result 1193 states and 2576 transitions. [2019-12-27 20:55:31,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:55:31,678 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 20:55:31,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:31,682 INFO L225 Difference]: With dead ends: 1193 [2019-12-27 20:55:31,682 INFO L226 Difference]: Without dead ends: 1193 [2019-12-27 20:55:31,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:55:31,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2019-12-27 20:55:31,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 955. [2019-12-27 20:55:31,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 955 states. [2019-12-27 20:55:31,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 2121 transitions. [2019-12-27 20:55:31,711 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 2121 transitions. Word has length 26 [2019-12-27 20:55:31,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:31,711 INFO L462 AbstractCegarLoop]: Abstraction has 955 states and 2121 transitions. [2019-12-27 20:55:31,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:55:31,711 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 2121 transitions. [2019-12-27 20:55:31,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 20:55:31,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:31,714 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] [2019-12-27 20:55:31,715 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:31,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:31,715 INFO L82 PathProgramCache]: Analyzing trace with hash 15300526, now seen corresponding path program 1 times [2019-12-27 20:55:31,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:31,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697192623] [2019-12-27 20:55:31,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:31,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:31,807 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 20:55:31,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697192623] [2019-12-27 20:55:31,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:31,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:55:31,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [908115141] [2019-12-27 20:55:31,808 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:31,824 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:31,873 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 99 states and 145 transitions. [2019-12-27 20:55:31,873 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:31,875 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:55:31,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:55:31,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:31,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:55:31,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:55:31,876 INFO L87 Difference]: Start difference. First operand 955 states and 2121 transitions. Second operand 7 states. [2019-12-27 20:55:32,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:32,205 INFO L93 Difference]: Finished difference Result 2800 states and 6130 transitions. [2019-12-27 20:55:32,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 20:55:32,205 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-27 20:55:32,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:32,210 INFO L225 Difference]: With dead ends: 2800 [2019-12-27 20:55:32,211 INFO L226 Difference]: Without dead ends: 1901 [2019-12-27 20:55:32,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 20:55:32,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2019-12-27 20:55:32,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1056. [2019-12-27 20:55:32,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1056 states. [2019-12-27 20:55:32,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 2353 transitions. [2019-12-27 20:55:32,243 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 2353 transitions. Word has length 51 [2019-12-27 20:55:32,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:32,244 INFO L462 AbstractCegarLoop]: Abstraction has 1056 states and 2353 transitions. [2019-12-27 20:55:32,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:55:32,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 2353 transitions. [2019-12-27 20:55:32,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 20:55:32,247 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:32,248 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] [2019-12-27 20:55:32,248 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:32,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:32,248 INFO L82 PathProgramCache]: Analyzing trace with hash -671171562, now seen corresponding path program 2 times [2019-12-27 20:55:32,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:32,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766918936] [2019-12-27 20:55:32,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:32,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:32,323 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 20:55:32,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766918936] [2019-12-27 20:55:32,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:32,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:55:32,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1821265638] [2019-12-27 20:55:32,324 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:32,341 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:32,442 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 93 states and 133 transitions. [2019-12-27 20:55:32,443 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:32,464 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:55:32,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:55:32,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:32,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:55:32,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:55:32,465 INFO L87 Difference]: Start difference. First operand 1056 states and 2353 transitions. Second operand 6 states. [2019-12-27 20:55:32,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:32,578 INFO L93 Difference]: Finished difference Result 1843 states and 4120 transitions. [2019-12-27 20:55:32,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 20:55:32,579 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-27 20:55:32,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:32,581 INFO L225 Difference]: With dead ends: 1843 [2019-12-27 20:55:32,581 INFO L226 Difference]: Without dead ends: 789 [2019-12-27 20:55:32,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:55:32,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2019-12-27 20:55:32,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 622. [2019-12-27 20:55:32,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2019-12-27 20:55:32,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 1432 transitions. [2019-12-27 20:55:32,597 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 1432 transitions. Word has length 51 [2019-12-27 20:55:32,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:32,597 INFO L462 AbstractCegarLoop]: Abstraction has 622 states and 1432 transitions. [2019-12-27 20:55:32,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:55:32,598 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 1432 transitions. [2019-12-27 20:55:32,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 20:55:32,599 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:32,599 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] [2019-12-27 20:55:32,600 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:32,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:32,600 INFO L82 PathProgramCache]: Analyzing trace with hash 898082634, now seen corresponding path program 3 times [2019-12-27 20:55:32,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:32,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695429772] [2019-12-27 20:55:32,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:32,694 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 20:55:32,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695429772] [2019-12-27 20:55:32,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:32,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:55:32,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [374034321] [2019-12-27 20:55:32,695 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:32,711 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:32,756 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 123 transitions. [2019-12-27 20:55:32,756 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:32,798 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 20:55:32,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:55:32,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:32,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:55:32,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:55:32,800 INFO L87 Difference]: Start difference. First operand 622 states and 1432 transitions. Second operand 5 states. [2019-12-27 20:55:33,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:33,004 INFO L93 Difference]: Finished difference Result 743 states and 1651 transitions. [2019-12-27 20:55:33,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:55:33,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-27 20:55:33,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:33,007 INFO L225 Difference]: With dead ends: 743 [2019-12-27 20:55:33,007 INFO L226 Difference]: Without dead ends: 743 [2019-12-27 20:55:33,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 8 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:55:33,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2019-12-27 20:55:33,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 705. [2019-12-27 20:55:33,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2019-12-27 20:55:33,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1584 transitions. [2019-12-27 20:55:33,023 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1584 transitions. Word has length 51 [2019-12-27 20:55:33,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:33,024 INFO L462 AbstractCegarLoop]: Abstraction has 705 states and 1584 transitions. [2019-12-27 20:55:33,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:55:33,024 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1584 transitions. [2019-12-27 20:55:33,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 20:55:33,026 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:33,026 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] [2019-12-27 20:55:33,026 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:33,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:33,027 INFO L82 PathProgramCache]: Analyzing trace with hash 440616472, now seen corresponding path program 4 times [2019-12-27 20:55:33,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:33,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305703234] [2019-12-27 20:55:33,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:33,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:33,141 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 20:55:33,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305703234] [2019-12-27 20:55:33,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:33,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:55:33,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [866086099] [2019-12-27 20:55:33,143 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:33,205 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:33,240 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 75 states and 93 transitions. [2019-12-27 20:55:33,240 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:33,241 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:55:33,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:55:33,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:33,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:55:33,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:55:33,242 INFO L87 Difference]: Start difference. First operand 705 states and 1584 transitions. Second operand 3 states. [2019-12-27 20:55:33,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:33,253 INFO L93 Difference]: Finished difference Result 704 states and 1582 transitions. [2019-12-27 20:55:33,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:55:33,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 20:55:33,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:33,256 INFO L225 Difference]: With dead ends: 704 [2019-12-27 20:55:33,257 INFO L226 Difference]: Without dead ends: 704 [2019-12-27 20:55:33,257 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 20:55:33,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2019-12-27 20:55:33,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 631. [2019-12-27 20:55:33,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-12-27 20:55:33,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 1452 transitions. [2019-12-27 20:55:33,272 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 1452 transitions. Word has length 51 [2019-12-27 20:55:33,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:33,272 INFO L462 AbstractCegarLoop]: Abstraction has 631 states and 1452 transitions. [2019-12-27 20:55:33,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:55:33,272 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 1452 transitions. [2019-12-27 20:55:33,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 20:55:33,274 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:33,274 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] [2019-12-27 20:55:33,274 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:33,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:33,275 INFO L82 PathProgramCache]: Analyzing trace with hash 578834260, now seen corresponding path program 1 times [2019-12-27 20:55:33,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:33,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488926255] [2019-12-27 20:55:33,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:33,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:33,393 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 20:55:33,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488926255] [2019-12-27 20:55:33,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:33,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 20:55:33,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [964411981] [2019-12-27 20:55:33,394 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:33,411 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:33,455 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 124 transitions. [2019-12-27 20:55:33,456 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:33,486 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 20:55:33,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:55:33,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:33,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:55:33,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:55:33,487 INFO L87 Difference]: Start difference. First operand 631 states and 1452 transitions. Second operand 8 states. [2019-12-27 20:55:34,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:34,162 INFO L93 Difference]: Finished difference Result 1208 states and 2549 transitions. [2019-12-27 20:55:34,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 20:55:34,162 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-12-27 20:55:34,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:34,166 INFO L225 Difference]: With dead ends: 1208 [2019-12-27 20:55:34,166 INFO L226 Difference]: Without dead ends: 1208 [2019-12-27 20:55:34,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 7 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:55:34,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2019-12-27 20:55:34,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 746. [2019-12-27 20:55:34,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2019-12-27 20:55:34,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1598 transitions. [2019-12-27 20:55:34,185 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1598 transitions. Word has length 52 [2019-12-27 20:55:34,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:34,186 INFO L462 AbstractCegarLoop]: Abstraction has 746 states and 1598 transitions. [2019-12-27 20:55:34,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:55:34,186 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1598 transitions. [2019-12-27 20:55:34,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 20:55:34,188 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:34,188 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] [2019-12-27 20:55:34,188 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:34,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:34,188 INFO L82 PathProgramCache]: Analyzing trace with hash -717714874, now seen corresponding path program 2 times [2019-12-27 20:55:34,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:34,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870200095] [2019-12-27 20:55:34,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:34,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:34,312 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 20:55:34,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870200095] [2019-12-27 20:55:34,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:34,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:55:34,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2002167957] [2019-12-27 20:55:34,313 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:34,336 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:34,433 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 93 transitions. [2019-12-27 20:55:34,433 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:34,436 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:55:34,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:55:34,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:34,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:55:34,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:55:34,438 INFO L87 Difference]: Start difference. First operand 746 states and 1598 transitions. Second operand 4 states. [2019-12-27 20:55:34,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:34,518 INFO L93 Difference]: Finished difference Result 910 states and 1926 transitions. [2019-12-27 20:55:34,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:55:34,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-27 20:55:34,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:34,520 INFO L225 Difference]: With dead ends: 910 [2019-12-27 20:55:34,520 INFO L226 Difference]: Without dead ends: 910 [2019-12-27 20:55:34,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 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 20:55:34,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2019-12-27 20:55:34,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 760. [2019-12-27 20:55:34,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2019-12-27 20:55:34,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1629 transitions. [2019-12-27 20:55:34,538 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1629 transitions. Word has length 52 [2019-12-27 20:55:34,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:34,538 INFO L462 AbstractCegarLoop]: Abstraction has 760 states and 1629 transitions. [2019-12-27 20:55:34,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:55:34,538 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1629 transitions. [2019-12-27 20:55:34,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 20:55:34,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:34,540 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] [2019-12-27 20:55:34,540 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:34,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:34,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1517325742, now seen corresponding path program 1 times [2019-12-27 20:55:34,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:34,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052625331] [2019-12-27 20:55:34,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:34,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:34,617 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 20:55:34,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052625331] [2019-12-27 20:55:34,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:34,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:55:34,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1610202010] [2019-12-27 20:55:34,618 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:34,638 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:34,702 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 100 states and 145 transitions. [2019-12-27 20:55:34,702 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:34,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:55:34,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 20:55:34,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:55:34,916 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 20:55:34,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 20:55:34,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:34,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 20:55:34,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:55:34,918 INFO L87 Difference]: Start difference. First operand 760 states and 1629 transitions. Second operand 11 states. [2019-12-27 20:55:35,789 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-12-27 20:55:36,109 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-12-27 20:55:38,543 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2019-12-27 20:55:38,822 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-12-27 20:55:39,096 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2019-12-27 20:55:40,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:40,225 INFO L93 Difference]: Finished difference Result 4633 states and 9380 transitions. [2019-12-27 20:55:40,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-12-27 20:55:40,228 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 53 [2019-12-27 20:55:40,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:40,234 INFO L225 Difference]: With dead ends: 4633 [2019-12-27 20:55:40,235 INFO L226 Difference]: Without dead ends: 2622 [2019-12-27 20:55:40,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1544 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=869, Invalid=3553, Unknown=0, NotChecked=0, Total=4422 [2019-12-27 20:55:40,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2622 states. [2019-12-27 20:55:40,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2622 to 863. [2019-12-27 20:55:40,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2019-12-27 20:55:40,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1837 transitions. [2019-12-27 20:55:40,269 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1837 transitions. Word has length 53 [2019-12-27 20:55:40,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:40,269 INFO L462 AbstractCegarLoop]: Abstraction has 863 states and 1837 transitions. [2019-12-27 20:55:40,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 20:55:40,269 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1837 transitions. [2019-12-27 20:55:40,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 20:55:40,271 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:40,272 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] [2019-12-27 20:55:40,272 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:40,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:40,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1731920874, now seen corresponding path program 2 times [2019-12-27 20:55:40,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:40,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131575106] [2019-12-27 20:55:40,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:40,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:40,342 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 20:55:40,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131575106] [2019-12-27 20:55:40,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:40,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:55:40,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [406293101] [2019-12-27 20:55:40,346 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:40,363 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:40,441 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 133 transitions. [2019-12-27 20:55:40,441 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:40,503 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 20:55:40,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:55:40,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:40,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:55:40,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:55:40,504 INFO L87 Difference]: Start difference. First operand 863 states and 1837 transitions. Second operand 6 states. [2019-12-27 20:55:40,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:40,895 INFO L93 Difference]: Finished difference Result 1694 states and 3595 transitions. [2019-12-27 20:55:40,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 20:55:40,896 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-27 20:55:40,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:40,901 INFO L225 Difference]: With dead ends: 1694 [2019-12-27 20:55:40,901 INFO L226 Difference]: Without dead ends: 1694 [2019-12-27 20:55:40,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:55:40,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1694 states. [2019-12-27 20:55:40,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1694 to 978. [2019-12-27 20:55:40,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 978 states. [2019-12-27 20:55:40,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 2120 transitions. [2019-12-27 20:55:40,936 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 2120 transitions. Word has length 53 [2019-12-27 20:55:40,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:40,936 INFO L462 AbstractCegarLoop]: Abstraction has 978 states and 2120 transitions. [2019-12-27 20:55:40,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:55:40,937 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 2120 transitions. [2019-12-27 20:55:40,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 20:55:40,939 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:40,939 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] [2019-12-27 20:55:40,939 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:40,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:40,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1974989424, now seen corresponding path program 3 times [2019-12-27 20:55:40,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:40,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527943850] [2019-12-27 20:55:40,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:40,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:40,994 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 20:55:40,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527943850] [2019-12-27 20:55:40,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:40,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:55:40,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1812598238] [2019-12-27 20:55:40,995 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:41,009 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:41,120 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 109 transitions. [2019-12-27 20:55:41,121 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:41,121 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:55:41,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:55:41,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:41,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:55:41,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:55:41,123 INFO L87 Difference]: Start difference. First operand 978 states and 2120 transitions. Second operand 3 states. [2019-12-27 20:55:41,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:41,239 INFO L93 Difference]: Finished difference Result 1313 states and 2802 transitions. [2019-12-27 20:55:41,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:55:41,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 20:55:41,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:41,245 INFO L225 Difference]: With dead ends: 1313 [2019-12-27 20:55:41,245 INFO L226 Difference]: Without dead ends: 1313 [2019-12-27 20:55:41,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:55:41,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2019-12-27 20:55:41,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 946. [2019-12-27 20:55:41,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 946 states. [2019-12-27 20:55:41,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 2044 transitions. [2019-12-27 20:55:41,288 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 2044 transitions. Word has length 53 [2019-12-27 20:55:41,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:41,288 INFO L462 AbstractCegarLoop]: Abstraction has 946 states and 2044 transitions. [2019-12-27 20:55:41,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:55:41,289 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 2044 transitions. [2019-12-27 20:55:41,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 20:55:41,292 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:41,293 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] [2019-12-27 20:55:41,293 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:41,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:41,293 INFO L82 PathProgramCache]: Analyzing trace with hash 444800354, now seen corresponding path program 4 times [2019-12-27 20:55:41,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:41,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781194779] [2019-12-27 20:55:41,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:41,404 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 20:55:41,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781194779] [2019-12-27 20:55:41,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:41,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:55:41,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [591648189] [2019-12-27 20:55:41,408 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:41,431 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:41,509 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 90 states and 125 transitions. [2019-12-27 20:55:41,509 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:41,519 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 20:55:41,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:55:41,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:41,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:55:41,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:55:41,520 INFO L87 Difference]: Start difference. First operand 946 states and 2044 transitions. Second operand 5 states. [2019-12-27 20:55:41,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:41,741 INFO L93 Difference]: Finished difference Result 1297 states and 2765 transitions. [2019-12-27 20:55:41,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:55:41,742 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-27 20:55:41,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:41,744 INFO L225 Difference]: With dead ends: 1297 [2019-12-27 20:55:41,745 INFO L226 Difference]: Without dead ends: 1297 [2019-12-27 20:55:41,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 6 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:55:41,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2019-12-27 20:55:41,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 877. [2019-12-27 20:55:41,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 877 states. [2019-12-27 20:55:41,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1869 transitions. [2019-12-27 20:55:41,763 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1869 transitions. Word has length 53 [2019-12-27 20:55:41,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:41,764 INFO L462 AbstractCegarLoop]: Abstraction has 877 states and 1869 transitions. [2019-12-27 20:55:41,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:55:41,764 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1869 transitions. [2019-12-27 20:55:41,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 20:55:41,773 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:41,773 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] [2019-12-27 20:55:41,773 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:41,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:41,773 INFO L82 PathProgramCache]: Analyzing trace with hash 161095200, now seen corresponding path program 1 times [2019-12-27 20:55:41,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:41,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865701564] [2019-12-27 20:55:41,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:41,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:55:41,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:55:41,921 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:55:41,921 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:55:41,925 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] ULTIMATE.startENTRY-->L814: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= |v_#valid_54| (store .cse0 |v_ULTIMATE.start_main_~#t845~0.base_25| 1)) (= 0 v_~weak$$choice0~0_9) (= 0 v_~__unbuffered_p1_EAX~0_15) (= 0 v_~__unbuffered_p0_EAX~0_15) (= 0 v_~a$read_delayed_var~0.base_8) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t845~0.base_25| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t845~0.base_25|) |v_ULTIMATE.start_main_~#t845~0.offset_19| 0)) |v_#memory_int_17|) (= 0 v_~a$r_buff1_thd2~0_49) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t845~0.base_25|) (= 0 v_~a$read_delayed~0_7) (= 0 v_~a$w_buff0_used~0_103) (= (select .cse0 |v_ULTIMATE.start_main_~#t845~0.base_25|) 0) (< 0 |v_#StackHeapBarrier_16|) (= v_~__unbuffered_p0_EBX~0_13 0) (= 0 v_~x~0_9) (= 0 v_~weak$$choice2~0_34) (= |v_#NULL.offset_2| 0) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t845~0.base_25| 4) |v_#length_19|) (= v_~a$flush_delayed~0_13 0) (= 0 v_~a$r_buff1_thd1~0_18) (= 0 v_~a$w_buff0~0_29) (= 0 v_~a$w_buff1~0_28) (= v_~a$r_buff0_thd1~0_24 0) (= v_~a~0_24 0) (= v_~a$mem_tmp~0_10 0) (= v_~__unbuffered_p1_EBX~0_16 0) (= 0 v_~z~0_9) (= v_~a$r_buff0_thd2~0_76 0) (= v_~y~0_10 0) (= v_~main$tmp_guard0~0_11 0) (= v_~a$read_delayed_var~0.offset_8 0) (= 0 v_~__unbuffered_cnt~0_18) (= 0 v_~a$w_buff1_used~0_68) (= v_~a$r_buff0_thd0~0_19 0) (= 0 |v_ULTIMATE.start_main_~#t845~0.offset_19|) (= 0 |v_#NULL.base_2|) (= 0 v_~a$r_buff1_thd0~0_20))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_49, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_76, #NULL.offset=|v_#NULL.offset_2|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_19, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_21|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ~a$mem_tmp~0=v_~a$mem_tmp~0_10, ~a~0=v_~a~0_24, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~a$w_buff1~0=v_~a$w_buff1~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, #length=|v_#length_19|, ~y~0=v_~y~0_10, ULTIMATE.start_main_~#t845~0.offset=|v_ULTIMATE.start_main_~#t845~0.offset_19|, ULTIMATE.start_main_~#t846~0.base=|v_ULTIMATE.start_main_~#t846~0.base_21|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_16, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_13, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ULTIMATE.start_main_~#t845~0.base=|v_ULTIMATE.start_main_~#t845~0.base_25|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_103, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_24, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ULTIMATE.start_main_~#t846~0.offset=|v_ULTIMATE.start_main_~#t846~0.offset_16|, #NULL.base=|v_#NULL.base_2|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~a$w_buff0~0=v_~a$w_buff0~0_29, ~a$flush_delayed~0=v_~a$flush_delayed~0_13, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_9, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~x~0=v_~x~0_9, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8} AuxVars[] AssignedVars[~a$read_delayed~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, #NULL.offset, ~main$tmp_guard1~0, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~a$mem_tmp~0, ~a~0, ~__unbuffered_p0_EAX~0, ~a$w_buff1~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ULTIMATE.start_main_~#t845~0.offset, ULTIMATE.start_main_~#t846~0.base, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~a$r_buff1_thd1~0, ULTIMATE.start_main_~#t845~0.base, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t846~0.offset, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~a$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite40, ~a$w_buff0~0, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~x~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 20:55:41,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->L4-3: Formula: (and (= ~a$w_buff1_used~0_Out-259541582 ~a$w_buff0_used~0_In-259541582) (= |P0Thread1of1ForFork0_#in~arg.offset_In-259541582| P0Thread1of1ForFork0_~arg.offset_Out-259541582) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-259541582| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-259541582) (= P0Thread1of1ForFork0_~arg.base_Out-259541582 |P0Thread1of1ForFork0_#in~arg.base_In-259541582|) (= (mod ~a$w_buff1_used~0_Out-259541582 256) 0) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-259541582| 1) (= ~a$w_buff0_used~0_Out-259541582 1) (= ~a$w_buff0~0_Out-259541582 1) (= ~a$w_buff1~0_Out-259541582 ~a$w_buff0~0_In-259541582)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-259541582|, ~a$w_buff0~0=~a$w_buff0~0_In-259541582, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-259541582|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-259541582} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-259541582|, ~a$w_buff1~0=~a$w_buff1~0_Out-259541582, ~a$w_buff0~0=~a$w_buff0~0_Out-259541582, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-259541582, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-259541582|, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out-259541582, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out-259541582, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-259541582, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-259541582|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-259541582} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~a$w_buff0_used~0, ~a$w_buff1_used~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 20:55:41,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L814-1-->L816: Formula: (and (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t846~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t846~0.base_10|) |v_ULTIMATE.start_main_~#t846~0.offset_9| 1)) |v_#memory_int_7|) (= 0 (select |v_#valid_20| |v_ULTIMATE.start_main_~#t846~0.base_10|)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t846~0.base_10| 4)) (= |v_ULTIMATE.start_main_~#t846~0.offset_9| 0) (= (store |v_#valid_20| |v_ULTIMATE.start_main_~#t846~0.base_10| 1) |v_#valid_19|) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t846~0.base_10|) (not (= |v_ULTIMATE.start_main_~#t846~0.base_10| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|, ULTIMATE.start_main_~#t846~0.offset=|v_ULTIMATE.start_main_~#t846~0.offset_9|, ULTIMATE.start_main_~#t846~0.base=|v_ULTIMATE.start_main_~#t846~0.base_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t846~0.offset, ULTIMATE.start_main_~#t846~0.base] because there is no mapped edge [2019-12-27 20:55:41,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L783-->L783-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1514570807 256)))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite23_Out1514570807| |P1Thread1of1ForFork1_#t~ite24_Out1514570807|) (= |P1Thread1of1ForFork1_#t~ite23_Out1514570807| ~a$w_buff1_used~0_In1514570807) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In1514570807 256)))) (or (and (= (mod ~a$w_buff1_used~0_In1514570807 256) 0) .cse1) (and (= (mod ~a$r_buff1_thd2~0_In1514570807 256) 0) .cse1) (= 0 (mod ~a$w_buff0_used~0_In1514570807 256))))) (and (= |P1Thread1of1ForFork1_#t~ite24_Out1514570807| ~a$w_buff1_used~0_In1514570807) (= |P1Thread1of1ForFork1_#t~ite23_In1514570807| |P1Thread1of1ForFork1_#t~ite23_Out1514570807|) (not .cse0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1514570807, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1514570807, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In1514570807|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1514570807, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1514570807, ~weak$$choice2~0=~weak$$choice2~0_In1514570807} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1514570807, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out1514570807|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1514570807, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out1514570807|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1514570807, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1514570807, ~weak$$choice2~0=~weak$$choice2~0_In1514570807} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-12-27 20:55:41,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L784-->L785: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_26 256))) (= v_~a$r_buff0_thd2~0_68 v_~a$r_buff0_thd2~0_67)) InVars {~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_26} OutVars{~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_67, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_8|, ~weak$$choice2~0=v_~weak$$choice2~0_26, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_9|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_10|} AuxVars[] AssignedVars[~a$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 20:55:41,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L753-->L753-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In802692287 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In802692287 256)))) (or (and (= ~a$w_buff0_used~0_In802692287 |P0Thread1of1ForFork0_#t~ite5_Out802692287|) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out802692287|) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In802692287, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In802692287} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out802692287|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In802692287, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In802692287} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 20:55:41,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L754-->L754-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In-394533969 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In-394533969 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd1~0_In-394533969 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-394533969 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-394533969| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In-394533969 |P0Thread1of1ForFork0_#t~ite6_Out-394533969|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-394533969, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-394533969, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-394533969, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-394533969} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-394533969|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-394533969, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-394533969, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-394533969, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-394533969} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 20:55:41,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L755-->L756: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd1~0_In1808312671 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In1808312671 256) 0))) (or (and (= ~a$r_buff0_thd1~0_In1808312671 ~a$r_buff0_thd1~0_Out1808312671) (or .cse0 .cse1)) (and (not .cse0) (= 0 ~a$r_buff0_thd1~0_Out1808312671) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1808312671, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1808312671} OutVars{P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1808312671|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1808312671, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out1808312671} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 20:55:41,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L756-->L756-2: Formula: (let ((.cse2 (= (mod ~a$r_buff0_thd1~0_In358240131 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In358240131 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In358240131 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In358240131 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out358240131|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out358240131| ~a$r_buff1_thd1~0_In358240131) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In358240131, ~a$w_buff0_used~0=~a$w_buff0_used~0_In358240131, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In358240131, ~a$w_buff1_used~0=~a$w_buff1_used~0_In358240131} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In358240131, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out358240131|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In358240131, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In358240131, ~a$w_buff1_used~0=~a$w_buff1_used~0_In358240131} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 20:55:41,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L756-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~a$r_buff1_thd1~0_13) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_13, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 20:55:41,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L787-->L791: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a~0_18 v_~a$mem_tmp~0_5) (= v_~a$flush_delayed~0_7 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{~a~0=v_~a~0_18, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_7, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|} AuxVars[] AssignedVars[~a~0, ~a$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 20:55:41,944 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L791-2-->L791-5: Formula: (let ((.cse2 (= |P1Thread1of1ForFork1_#t~ite32_Out1070589220| |P1Thread1of1ForFork1_#t~ite33_Out1070589220|)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In1070589220 256))) (.cse1 (= (mod ~a$r_buff1_thd2~0_In1070589220 256) 0))) (or (and (= ~a~0_In1070589220 |P1Thread1of1ForFork1_#t~ite32_Out1070589220|) (or .cse0 .cse1) .cse2) (and (= ~a$w_buff1~0_In1070589220 |P1Thread1of1ForFork1_#t~ite32_Out1070589220|) .cse2 (not .cse0) (not .cse1)))) InVars {~a~0=~a~0_In1070589220, ~a$w_buff1~0=~a$w_buff1~0_In1070589220, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1070589220, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1070589220} OutVars{~a~0=~a~0_In1070589220, ~a$w_buff1~0=~a$w_buff1~0_In1070589220, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1070589220, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1070589220|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out1070589220|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1070589220} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 20:55:41,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L792-->L792-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In931374146 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd2~0_In931374146 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In931374146 |P1Thread1of1ForFork1_#t~ite34_Out931374146|)) (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out931374146|) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In931374146, ~a$w_buff0_used~0=~a$w_buff0_used~0_In931374146} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out931374146|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In931374146, ~a$w_buff0_used~0=~a$w_buff0_used~0_In931374146} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 20:55:41,946 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L793-->L793-2: Formula: (let ((.cse2 (= (mod ~a$r_buff1_thd2~0_In164568574 256) 0)) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In164568574 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In164568574 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In164568574 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out164568574|)) (and (= ~a$w_buff1_used~0_In164568574 |P1Thread1of1ForFork1_#t~ite35_Out164568574|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In164568574, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In164568574, ~a$w_buff0_used~0=~a$w_buff0_used~0_In164568574, ~a$w_buff1_used~0=~a$w_buff1_used~0_In164568574} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In164568574, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In164568574, ~a$w_buff0_used~0=~a$w_buff0_used~0_In164568574, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out164568574|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In164568574} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 20:55:41,946 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L794-->L794-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-2110659221 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-2110659221 256)))) (or (and (= ~a$r_buff0_thd2~0_In-2110659221 |P1Thread1of1ForFork1_#t~ite36_Out-2110659221|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-2110659221|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2110659221, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2110659221} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2110659221, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2110659221, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-2110659221|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 20:55:41,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L795-->L795-2: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd2~0_In-366010785 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-366010785 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In-366010785 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In-366010785 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out-366010785| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite37_Out-366010785| ~a$r_buff1_thd2~0_In-366010785)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-366010785, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-366010785, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-366010785, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-366010785} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-366010785, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-366010785, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-366010785, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-366010785, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-366010785|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 20:55:41,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L795-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~a$r_buff1_thd2~0_42 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_42, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 20:55:41,948 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L816-1-->L822: Formula: (and (= v_~main$tmp_guard0~0_5 1) (= v_~__unbuffered_cnt~0_7 2)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_3|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 20:55:41,948 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L822-2-->L822-4: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In-404295030 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In-404295030 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-404295030| ~a$w_buff1~0_In-404295030) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-404295030| ~a~0_In-404295030)))) InVars {~a~0=~a~0_In-404295030, ~a$w_buff1~0=~a$w_buff1~0_In-404295030, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-404295030, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-404295030} OutVars{~a~0=~a~0_In-404295030, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-404295030|, ~a$w_buff1~0=~a$w_buff1~0_In-404295030, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-404295030, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-404295030} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 20:55:41,949 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L822-4-->L823: Formula: (= v_~a~0_16 |v_ULTIMATE.start_main_#t~ite40_7|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|} OutVars{~a~0=v_~a~0_16, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 20:55:41,949 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In2124480080 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In2124480080 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out2124480080| 0)) (and (= |ULTIMATE.start_main_#t~ite42_Out2124480080| ~a$w_buff0_used~0_In2124480080) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In2124480080, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2124480080} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In2124480080, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2124480080, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out2124480080|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 20:55:41,950 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L824-->L824-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff0_thd0~0_In641034699 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In641034699 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In641034699 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In641034699 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out641034699| ~a$w_buff1_used~0_In641034699) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite43_Out641034699|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In641034699, ~a$w_buff0_used~0=~a$w_buff0_used~0_In641034699, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In641034699, ~a$w_buff1_used~0=~a$w_buff1_used~0_In641034699} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In641034699, ~a$w_buff0_used~0=~a$w_buff0_used~0_In641034699, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In641034699, ~a$w_buff1_used~0=~a$w_buff1_used~0_In641034699, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out641034699|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 20:55:41,951 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L825-->L825-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In1735119190 256))) (.cse0 (= (mod ~a$r_buff0_thd0~0_In1735119190 256) 0))) (or (and (= ~a$r_buff0_thd0~0_In1735119190 |ULTIMATE.start_main_#t~ite44_Out1735119190|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out1735119190|) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1735119190, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1735119190} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1735119190, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1735119190, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1735119190|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 20:55:41,951 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L826-->L826-2: Formula: (let ((.cse2 (= (mod ~a$w_buff0_used~0_In-1602943824 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In-1602943824 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In-1602943824 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1602943824 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-1602943824|)) (and (= |ULTIMATE.start_main_#t~ite45_Out-1602943824| ~a$r_buff1_thd0~0_In-1602943824) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1602943824, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1602943824, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1602943824, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1602943824} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1602943824, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1602943824, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1602943824, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1602943824, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1602943824|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 20:55:41,952 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L826-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= 1 v_~__unbuffered_p1_EAX~0_8) (= v_~main$tmp_guard1~0_10 0) (= |v_ULTIMATE.start_main_#t~ite45_11| v_~a$r_buff1_thd0~0_13) (= v_~__unbuffered_p0_EBX~0_6 0) (= v_~__unbuffered_p0_EAX~0_8 1) (= 0 v_~__unbuffered_p1_EBX~0_9)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_13, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:55:42,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:55:42 BasicIcfg [2019-12-27 20:55:42,045 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:55:42,049 INFO L168 Benchmark]: Toolchain (without parser) took 20279.45 ms. Allocated memory was 144.7 MB in the beginning and 604.5 MB in the end (delta: 459.8 MB). Free memory was 100.7 MB in the beginning and 244.3 MB in the end (delta: -143.6 MB). Peak memory consumption was 316.2 MB. Max. memory is 7.1 GB. [2019-12-27 20:55:42,049 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 20:55:42,051 INFO L168 Benchmark]: CACSL2BoogieTranslator took 741.43 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 100.3 MB in the beginning and 154.3 MB in the end (delta: -54.0 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-27 20:55:42,051 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.32 ms. Allocated memory is still 201.9 MB. Free memory was 154.3 MB in the beginning and 151.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 20:55:42,052 INFO L168 Benchmark]: Boogie Preprocessor took 41.68 ms. Allocated memory is still 201.9 MB. Free memory was 151.6 MB in the beginning and 149.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 20:55:42,053 INFO L168 Benchmark]: RCFGBuilder took 814.02 ms. Allocated memory is still 201.9 MB. Free memory was 149.5 MB in the beginning and 104.2 MB in the end (delta: 45.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 7.1 GB. [2019-12-27 20:55:42,053 INFO L168 Benchmark]: TraceAbstraction took 18611.24 ms. Allocated memory was 201.9 MB in the beginning and 604.5 MB in the end (delta: 402.7 MB). Free memory was 103.5 MB in the beginning and 244.3 MB in the end (delta: -140.8 MB). Peak memory consumption was 261.8 MB. Max. memory is 7.1 GB. [2019-12-27 20:55:42,059 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 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 741.43 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 100.3 MB in the beginning and 154.3 MB in the end (delta: -54.0 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.32 ms. Allocated memory is still 201.9 MB. Free memory was 154.3 MB in the beginning and 151.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.68 ms. Allocated memory is still 201.9 MB. Free memory was 151.6 MB in the beginning and 149.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 814.02 ms. Allocated memory is still 201.9 MB. Free memory was 149.5 MB in the beginning and 104.2 MB in the end (delta: 45.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18611.24 ms. Allocated memory was 201.9 MB in the beginning and 604.5 MB in the end (delta: 402.7 MB). Free memory was 103.5 MB in the beginning and 244.3 MB in the end (delta: -140.8 MB). Peak memory consumption was 261.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 151 ProgramPointsBefore, 78 ProgramPointsAfterwards, 185 TransitionsBefore, 90 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 25 ChoiceCompositions, 5025 VarBasedMoverChecksPositive, 194 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 56825 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L814] FCALL, FORK 0 pthread_create(&t845, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t846, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L737] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L738] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L739] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L740] 1 a$r_buff0_thd1 = (_Bool)1 [L743] 1 x = 1 [L746] 1 __unbuffered_p0_EAX = x [L749] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L766] 2 y = 1 [L769] 2 z = 1 [L772] 2 __unbuffered_p1_EAX = z [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 a$flush_delayed = weak$$choice2 [L778] 2 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L779] EXPR 2 !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L779] 2 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L780] EXPR 2 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L780] 2 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L752] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L781] EXPR 2 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L781] 2 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L782] EXPR 2 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used))=1, x=1, y=1, z=1] [L782] 2 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L783] 2 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 2 weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L785] 2 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L752] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L753] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L754] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L791] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L794] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L822] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L823] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L824] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L825] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 145 locations, 2 error locations. Result: UNSAFE, OverallTime: 18.3s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2230 SDtfs, 3273 SDslu, 4117 SDs, 0 SdLazy, 3459 SolverSat, 251 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 225 GetRequests, 54 SyntacticMatches, 32 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1593 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8850occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 6422 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 706 NumberOfCodeBlocks, 706 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 635 ConstructedInterpolants, 0 QuantifiedInterpolants, 97080 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...