/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/mix017_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:12:25,706 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:12:25,709 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:12:25,720 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:12:25,721 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:12:25,722 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:12:25,723 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:12:25,725 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:12:25,726 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:12:25,727 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:12:25,728 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:12:25,729 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:12:25,730 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:12:25,731 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:12:25,731 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:12:25,733 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:12:25,733 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:12:25,734 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:12:25,736 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:12:25,738 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:12:25,739 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:12:25,740 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:12:25,742 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:12:25,742 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:12:25,745 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:12:25,745 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:12:25,745 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:12:25,746 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:12:25,746 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:12:25,747 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:12:25,747 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:12:25,748 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:12:25,749 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:12:25,749 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:12:25,750 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:12:25,751 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:12:25,751 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:12:25,752 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:12:25,752 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:12:25,753 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:12:25,753 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:12:25,754 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:12:25,768 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:12:25,769 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:12:25,770 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:12:25,770 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:12:25,770 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:12:25,770 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:12:25,771 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:12:25,771 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:12:25,771 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:12:25,771 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:12:25,771 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:12:25,771 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:12:25,772 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:12:25,772 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:12:25,772 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:12:25,772 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:12:25,772 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:12:25,773 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:12:25,773 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:12:25,773 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:12:25,773 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:12:25,773 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:12:25,773 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:12:25,774 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:12:25,774 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:12:25,774 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:12:25,774 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:12:25,774 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:12:25,775 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:12:25,775 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:12:25,775 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:12:25,775 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:12:26,033 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:12:26,052 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:12:26,055 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:12:26,056 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:12:26,057 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:12:26,057 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix017_power.opt.i [2019-12-27 20:12:26,123 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5319f922/30effa5356704d11a4e56cf5beac7d3f/FLAG1115932eb [2019-12-27 20:12:26,650 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:12:26,650 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017_power.opt.i [2019-12-27 20:12:26,670 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5319f922/30effa5356704d11a4e56cf5beac7d3f/FLAG1115932eb [2019-12-27 20:12:26,896 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5319f922/30effa5356704d11a4e56cf5beac7d3f [2019-12-27 20:12:26,906 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:12:26,908 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:12:26,911 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:12:26,911 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:12:26,914 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:12:26,915 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:12:26" (1/1) ... [2019-12-27 20:12:26,919 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1511a0f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:12:26, skipping insertion in model container [2019-12-27 20:12:26,919 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:12:26" (1/1) ... [2019-12-27 20:12:26,927 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:12:26,980 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:12:27,485 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:12:27,507 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:12:27,576 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:12:27,654 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:12:27,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:12:27 WrapperNode [2019-12-27 20:12:27,655 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:12:27,656 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:12:27,656 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:12:27,657 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:12:27,666 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:12:27" (1/1) ... [2019-12-27 20:12:27,689 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:12:27" (1/1) ... [2019-12-27 20:12:27,735 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:12:27,735 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:12:27,735 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:12:27,735 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:12:27,745 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:12:27" (1/1) ... [2019-12-27 20:12:27,745 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:12:27" (1/1) ... [2019-12-27 20:12:27,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:12:27" (1/1) ... [2019-12-27 20:12:27,752 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:12:27" (1/1) ... [2019-12-27 20:12:27,762 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:12:27" (1/1) ... [2019-12-27 20:12:27,766 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:12:27" (1/1) ... [2019-12-27 20:12:27,770 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:12:27" (1/1) ... [2019-12-27 20:12:27,775 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:12:27,776 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:12:27,776 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:12:27,776 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:12:27,777 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:12:27" (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:12:27,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:12:27,857 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:12:27,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:12:27,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:12:27,858 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:12:27,858 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:12:27,858 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:12:27,858 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:12:27,858 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 20:12:27,859 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 20:12:27,859 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 20:12:27,859 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 20:12:27,859 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:12:27,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:12:27,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:12:27,862 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:12:28,580 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:12:28,580 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:12:28,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:12:28 BoogieIcfgContainer [2019-12-27 20:12:28,582 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:12:28,583 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:12:28,583 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:12:28,586 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:12:28,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:12:26" (1/3) ... [2019-12-27 20:12:28,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e5543d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:12:28, skipping insertion in model container [2019-12-27 20:12:28,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:12:27" (2/3) ... [2019-12-27 20:12:28,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e5543d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:12:28, skipping insertion in model container [2019-12-27 20:12:28,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:12:28" (3/3) ... [2019-12-27 20:12:28,590 INFO L109 eAbstractionObserver]: Analyzing ICFG mix017_power.opt.i [2019-12-27 20:12:28,601 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:12:28,601 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:12:28,609 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:12:28,610 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:12:28,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,659 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,659 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,663 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,665 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,703 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,703 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,704 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,704 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,704 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,710 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,710 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,710 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,711 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,711 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,711 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,711 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,711 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,712 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,712 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,712 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,712 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,712 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,713 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,713 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,713 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,713 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,714 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,714 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,714 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,714 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,714 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,715 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,715 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,715 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,715 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,715 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,716 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,716 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,716 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,719 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,720 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,720 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,720 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,720 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,721 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,721 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,721 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,721 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,721 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,730 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,730 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,733 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,736 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,739 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,740 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,740 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:28,756 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 20:12:28,779 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:12:28,780 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:12:28,780 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:12:28,780 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:12:28,780 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:12:28,780 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:12:28,780 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:12:28,781 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:12:28,807 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 210 transitions [2019-12-27 20:12:28,809 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-27 20:12:28,929 INFO L132 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-27 20:12:28,929 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:12:28,945 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 440 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 20:12:28,971 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-27 20:12:29,024 INFO L132 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-27 20:12:29,025 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:12:29,033 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 440 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 20:12:29,054 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-27 20:12:29,055 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:12:33,005 WARN L192 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-27 20:12:33,147 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-27 20:12:33,168 INFO L206 etLargeBlockEncoding]: Checked pairs total: 74863 [2019-12-27 20:12:33,168 INFO L214 etLargeBlockEncoding]: Total number of compositions: 122 [2019-12-27 20:12:33,171 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 89 places, 94 transitions [2019-12-27 20:13:07,004 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 165606 states. [2019-12-27 20:13:07,006 INFO L276 IsEmpty]: Start isEmpty. Operand 165606 states. [2019-12-27 20:13:07,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 20:13:07,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:13:07,013 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:13:07,014 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:13:07,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:13:07,020 INFO L82 PathProgramCache]: Analyzing trace with hash -285837663, now seen corresponding path program 1 times [2019-12-27 20:13:07,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:13:07,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521592429] [2019-12-27 20:13:07,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:13:07,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:13:07,293 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:13:07,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521592429] [2019-12-27 20:13:07,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:13:07,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:13:07,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1866082243] [2019-12-27 20:13:07,297 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:13:07,302 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:13:07,317 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 20:13:07,318 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:13:07,322 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:13:07,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:13:07,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:13:07,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:13:07,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:13:07,340 INFO L87 Difference]: Start difference. First operand 165606 states. Second operand 3 states. [2019-12-27 20:13:13,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:13:13,667 INFO L93 Difference]: Finished difference Result 163626 states and 782690 transitions. [2019-12-27 20:13:13,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:13:13,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 20:13:13,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:13:14,557 INFO L225 Difference]: With dead ends: 163626 [2019-12-27 20:13:14,557 INFO L226 Difference]: Without dead ends: 154266 [2019-12-27 20:13:14,559 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:13:20,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154266 states. [2019-12-27 20:13:26,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154266 to 154266. [2019-12-27 20:13:26,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154266 states. [2019-12-27 20:13:27,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154266 states to 154266 states and 736982 transitions. [2019-12-27 20:13:27,045 INFO L78 Accepts]: Start accepts. Automaton has 154266 states and 736982 transitions. Word has length 7 [2019-12-27 20:13:27,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:13:27,046 INFO L462 AbstractCegarLoop]: Abstraction has 154266 states and 736982 transitions. [2019-12-27 20:13:27,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:13:27,046 INFO L276 IsEmpty]: Start isEmpty. Operand 154266 states and 736982 transitions. [2019-12-27 20:13:27,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 20:13:27,057 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:13:27,057 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:13:27,057 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:13:27,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:13:27,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1421349496, now seen corresponding path program 1 times [2019-12-27 20:13:27,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:13:27,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760224227] [2019-12-27 20:13:27,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:13:27,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:13:27,184 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:13:27,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760224227] [2019-12-27 20:13:27,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:13:27,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:13:27,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1165998751] [2019-12-27 20:13:27,185 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:13:27,187 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:13:27,194 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 20:13:27,194 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:13:27,194 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:13:27,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:13:27,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:13:27,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:13:27,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:13:27,197 INFO L87 Difference]: Start difference. First operand 154266 states and 736982 transitions. Second operand 4 states. [2019-12-27 20:13:34,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:13:34,861 INFO L93 Difference]: Finished difference Result 243762 states and 1119228 transitions. [2019-12-27 20:13:34,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:13:34,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 20:13:34,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:13:35,757 INFO L225 Difference]: With dead ends: 243762 [2019-12-27 20:13:35,757 INFO L226 Difference]: Without dead ends: 243552 [2019-12-27 20:13:35,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:13:49,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243552 states. [2019-12-27 20:13:54,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243552 to 227200. [2019-12-27 20:13:54,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227200 states. [2019-12-27 20:14:05,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227200 states to 227200 states and 1051313 transitions. [2019-12-27 20:14:05,533 INFO L78 Accepts]: Start accepts. Automaton has 227200 states and 1051313 transitions. Word has length 15 [2019-12-27 20:14:05,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:14:05,534 INFO L462 AbstractCegarLoop]: Abstraction has 227200 states and 1051313 transitions. [2019-12-27 20:14:05,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:14:05,534 INFO L276 IsEmpty]: Start isEmpty. Operand 227200 states and 1051313 transitions. [2019-12-27 20:14:05,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 20:14:05,538 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:14:05,539 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:14:05,539 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:14:05,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:14:05,539 INFO L82 PathProgramCache]: Analyzing trace with hash 965433143, now seen corresponding path program 1 times [2019-12-27 20:14:05,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:14:05,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441314520] [2019-12-27 20:14:05,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:14:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:14:05,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:14:05,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441314520] [2019-12-27 20:14:05,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:14:05,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:14:05,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [490426076] [2019-12-27 20:14:05,610 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:14:05,611 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:14:05,613 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 20:14:05,614 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:14:05,614 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:14:05,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:14:05,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:14:05,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:14:05,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:14:05,615 INFO L87 Difference]: Start difference. First operand 227200 states and 1051313 transitions. Second operand 3 states. [2019-12-27 20:14:06,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:14:06,342 INFO L93 Difference]: Finished difference Result 141525 states and 590029 transitions. [2019-12-27 20:14:06,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:14:06,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 20:14:06,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:14:08,783 INFO L225 Difference]: With dead ends: 141525 [2019-12-27 20:14:08,784 INFO L226 Difference]: Without dead ends: 141525 [2019-12-27 20:14:08,784 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:14:13,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141525 states. [2019-12-27 20:14:23,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141525 to 141525. [2019-12-27 20:14:23,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141525 states. [2019-12-27 20:14:23,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141525 states to 141525 states and 590029 transitions. [2019-12-27 20:14:23,719 INFO L78 Accepts]: Start accepts. Automaton has 141525 states and 590029 transitions. Word has length 15 [2019-12-27 20:14:23,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:14:23,720 INFO L462 AbstractCegarLoop]: Abstraction has 141525 states and 590029 transitions. [2019-12-27 20:14:23,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:14:23,720 INFO L276 IsEmpty]: Start isEmpty. Operand 141525 states and 590029 transitions. [2019-12-27 20:14:23,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:14:23,724 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:14:23,724 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:14:23,724 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:14:23,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:14:23,724 INFO L82 PathProgramCache]: Analyzing trace with hash 353132370, now seen corresponding path program 1 times [2019-12-27 20:14:23,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:14:23,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631193116] [2019-12-27 20:14:23,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:14:23,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:14:23,793 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:14:23,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631193116] [2019-12-27 20:14:23,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:14:23,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:14:23,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1360156350] [2019-12-27 20:14:23,795 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:14:23,796 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:14:23,799 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 28 transitions. [2019-12-27 20:14:23,799 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:14:23,800 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:14:23,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:14:23,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:14:23,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:14:23,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:14:23,802 INFO L87 Difference]: Start difference. First operand 141525 states and 590029 transitions. Second operand 4 states. [2019-12-27 20:14:23,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:14:23,987 INFO L93 Difference]: Finished difference Result 38307 states and 135561 transitions. [2019-12-27 20:14:23,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:14:23,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 20:14:23,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:14:24,087 INFO L225 Difference]: With dead ends: 38307 [2019-12-27 20:14:24,087 INFO L226 Difference]: Without dead ends: 38307 [2019-12-27 20:14:24,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:14:24,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38307 states. [2019-12-27 20:14:29,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38307 to 38307. [2019-12-27 20:14:29,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38307 states. [2019-12-27 20:14:29,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38307 states to 38307 states and 135561 transitions. [2019-12-27 20:14:29,303 INFO L78 Accepts]: Start accepts. Automaton has 38307 states and 135561 transitions. Word has length 16 [2019-12-27 20:14:29,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:14:29,303 INFO L462 AbstractCegarLoop]: Abstraction has 38307 states and 135561 transitions. [2019-12-27 20:14:29,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:14:29,303 INFO L276 IsEmpty]: Start isEmpty. Operand 38307 states and 135561 transitions. [2019-12-27 20:14:29,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:14:29,306 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:14:29,306 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:14:29,306 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:14:29,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:14:29,306 INFO L82 PathProgramCache]: Analyzing trace with hash 155833959, now seen corresponding path program 1 times [2019-12-27 20:14:29,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:14:29,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256363313] [2019-12-27 20:14:29,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:14:29,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:14:29,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:14:29,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256363313] [2019-12-27 20:14:29,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:14:29,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:14:29,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1909192438] [2019-12-27 20:14:29,387 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:14:29,390 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:14:29,396 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 52 transitions. [2019-12-27 20:14:29,397 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:14:29,452 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:14:29,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:14:29,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:14:29,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:14:29,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:14:29,453 INFO L87 Difference]: Start difference. First operand 38307 states and 135561 transitions. Second operand 5 states. [2019-12-27 20:14:29,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:14:29,938 INFO L93 Difference]: Finished difference Result 48375 states and 169656 transitions. [2019-12-27 20:14:29,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:14:29,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 20:14:29,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:14:30,042 INFO L225 Difference]: With dead ends: 48375 [2019-12-27 20:14:30,042 INFO L226 Difference]: Without dead ends: 48364 [2019-12-27 20:14:30,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:14:30,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48364 states. [2019-12-27 20:14:31,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48364 to 42700. [2019-12-27 20:14:31,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42700 states. [2019-12-27 20:14:31,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42700 states to 42700 states and 150756 transitions. [2019-12-27 20:14:31,358 INFO L78 Accepts]: Start accepts. Automaton has 42700 states and 150756 transitions. Word has length 16 [2019-12-27 20:14:31,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:14:31,358 INFO L462 AbstractCegarLoop]: Abstraction has 42700 states and 150756 transitions. [2019-12-27 20:14:31,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:14:31,359 INFO L276 IsEmpty]: Start isEmpty. Operand 42700 states and 150756 transitions. [2019-12-27 20:14:31,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 20:14:31,375 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:14:31,375 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] [2019-12-27 20:14:31,375 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:14:31,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:14:31,376 INFO L82 PathProgramCache]: Analyzing trace with hash -2135022272, now seen corresponding path program 1 times [2019-12-27 20:14:31,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:14:31,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289715600] [2019-12-27 20:14:31,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:14:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:14:31,475 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:14:31,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289715600] [2019-12-27 20:14:31,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:14:31,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:14:31,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1459994098] [2019-12-27 20:14:31,476 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:14:31,481 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:14:31,493 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 74 transitions. [2019-12-27 20:14:31,493 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:14:31,494 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:14:31,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:14:31,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:14:31,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:14:31,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:14:31,496 INFO L87 Difference]: Start difference. First operand 42700 states and 150756 transitions. Second operand 5 states. [2019-12-27 20:14:32,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:14:32,214 INFO L93 Difference]: Finished difference Result 53510 states and 186118 transitions. [2019-12-27 20:14:32,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 20:14:32,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-27 20:14:32,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:14:32,331 INFO L225 Difference]: With dead ends: 53510 [2019-12-27 20:14:32,331 INFO L226 Difference]: Without dead ends: 53487 [2019-12-27 20:14:32,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:14:32,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53487 states. [2019-12-27 20:14:33,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53487 to 42005. [2019-12-27 20:14:33,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42005 states. [2019-12-27 20:14:33,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42005 states to 42005 states and 148074 transitions. [2019-12-27 20:14:33,825 INFO L78 Accepts]: Start accepts. Automaton has 42005 states and 148074 transitions. Word has length 24 [2019-12-27 20:14:33,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:14:33,825 INFO L462 AbstractCegarLoop]: Abstraction has 42005 states and 148074 transitions. [2019-12-27 20:14:33,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:14:33,825 INFO L276 IsEmpty]: Start isEmpty. Operand 42005 states and 148074 transitions. [2019-12-27 20:14:33,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 20:14:33,845 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:14:33,845 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] [2019-12-27 20:14:33,845 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:14:33,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:14:33,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1706816570, now seen corresponding path program 1 times [2019-12-27 20:14:33,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:14:33,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366467547] [2019-12-27 20:14:33,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:14:33,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:14:33,939 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:14:33,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366467547] [2019-12-27 20:14:33,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:14:33,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:14:33,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [27416778] [2019-12-27 20:14:33,940 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:14:33,945 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:14:33,953 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 40 transitions. [2019-12-27 20:14:33,953 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:14:33,953 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:14:33,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:14:33,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:14:33,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:14:33,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:14:33,954 INFO L87 Difference]: Start difference. First operand 42005 states and 148074 transitions. Second operand 5 states. [2019-12-27 20:14:34,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:14:34,080 INFO L93 Difference]: Finished difference Result 21498 states and 76764 transitions. [2019-12-27 20:14:34,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:14:34,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 20:14:34,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:14:34,118 INFO L225 Difference]: With dead ends: 21498 [2019-12-27 20:14:34,119 INFO L226 Difference]: Without dead ends: 21498 [2019-12-27 20:14:34,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:14:34,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21498 states. [2019-12-27 20:14:34,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21498 to 21306. [2019-12-27 20:14:34,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21306 states. [2019-12-27 20:14:34,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21306 states to 21306 states and 76108 transitions. [2019-12-27 20:14:34,480 INFO L78 Accepts]: Start accepts. Automaton has 21306 states and 76108 transitions. Word has length 28 [2019-12-27 20:14:34,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:14:34,480 INFO L462 AbstractCegarLoop]: Abstraction has 21306 states and 76108 transitions. [2019-12-27 20:14:34,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:14:34,481 INFO L276 IsEmpty]: Start isEmpty. Operand 21306 states and 76108 transitions. [2019-12-27 20:14:34,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 20:14:34,514 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:14:34,514 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] [2019-12-27 20:14:34,514 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:14:34,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:14:34,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1629751536, now seen corresponding path program 1 times [2019-12-27 20:14:34,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:14:34,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309177785] [2019-12-27 20:14:34,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:14:34,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:14:34,598 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:14:34,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309177785] [2019-12-27 20:14:34,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:14:34,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:14:34,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1054336562] [2019-12-27 20:14:34,599 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:14:34,608 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:14:34,639 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 80 states and 118 transitions. [2019-12-27 20:14:34,640 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:14:34,640 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:14:34,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:14:34,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:14:34,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:14:34,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:14:34,641 INFO L87 Difference]: Start difference. First operand 21306 states and 76108 transitions. Second operand 4 states. [2019-12-27 20:14:34,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:14:34,757 INFO L93 Difference]: Finished difference Result 30881 states and 105340 transitions. [2019-12-27 20:14:34,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:14:34,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-27 20:14:34,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:14:34,808 INFO L225 Difference]: With dead ends: 30881 [2019-12-27 20:14:34,809 INFO L226 Difference]: Without dead ends: 21608 [2019-12-27 20:14:34,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:14:34,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21608 states. [2019-12-27 20:14:35,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21608 to 21512. [2019-12-27 20:14:35,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21512 states. [2019-12-27 20:14:35,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21512 states to 21512 states and 75947 transitions. [2019-12-27 20:14:35,461 INFO L78 Accepts]: Start accepts. Automaton has 21512 states and 75947 transitions. Word has length 42 [2019-12-27 20:14:35,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:14:35,461 INFO L462 AbstractCegarLoop]: Abstraction has 21512 states and 75947 transitions. [2019-12-27 20:14:35,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:14:35,461 INFO L276 IsEmpty]: Start isEmpty. Operand 21512 states and 75947 transitions. [2019-12-27 20:14:35,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 20:14:35,495 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:14:35,495 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] [2019-12-27 20:14:35,495 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:14:35,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:14:35,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1940145770, now seen corresponding path program 2 times [2019-12-27 20:14:35,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:14:35,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789486157] [2019-12-27 20:14:35,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:14:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:14:35,577 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:14:35,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789486157] [2019-12-27 20:14:35,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:14:35,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:14:35,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [767901844] [2019-12-27 20:14:35,578 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:14:35,589 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:14:35,643 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 107 states and 187 transitions. [2019-12-27 20:14:35,643 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:14:35,646 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:14:35,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:14:35,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:14:35,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:14:35,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:14:35,648 INFO L87 Difference]: Start difference. First operand 21512 states and 75947 transitions. Second operand 4 states. [2019-12-27 20:14:35,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:14:35,870 INFO L93 Difference]: Finished difference Result 34397 states and 122371 transitions. [2019-12-27 20:14:35,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:14:35,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-27 20:14:35,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:14:35,915 INFO L225 Difference]: With dead ends: 34397 [2019-12-27 20:14:35,916 INFO L226 Difference]: Without dead ends: 18368 [2019-12-27 20:14:35,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:14:36,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18368 states. [2019-12-27 20:14:36,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18368 to 18290. [2019-12-27 20:14:36,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18290 states. [2019-12-27 20:14:36,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18290 states to 18290 states and 63856 transitions. [2019-12-27 20:14:36,276 INFO L78 Accepts]: Start accepts. Automaton has 18290 states and 63856 transitions. Word has length 42 [2019-12-27 20:14:36,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:14:36,276 INFO L462 AbstractCegarLoop]: Abstraction has 18290 states and 63856 transitions. [2019-12-27 20:14:36,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:14:36,277 INFO L276 IsEmpty]: Start isEmpty. Operand 18290 states and 63856 transitions. [2019-12-27 20:14:36,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 20:14:36,301 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:14:36,301 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] [2019-12-27 20:14:36,301 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:14:36,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:14:36,301 INFO L82 PathProgramCache]: Analyzing trace with hash -254857110, now seen corresponding path program 3 times [2019-12-27 20:14:36,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:14:36,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376345939] [2019-12-27 20:14:36,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:14:36,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:14:36,396 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:14:36,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376345939] [2019-12-27 20:14:36,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:14:36,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:14:36,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1813109418] [2019-12-27 20:14:36,398 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:14:36,407 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:14:36,459 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 111 states and 193 transitions. [2019-12-27 20:14:36,459 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:14:36,483 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:14:36,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:14:36,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:14:36,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:14:36,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:14:36,485 INFO L87 Difference]: Start difference. First operand 18290 states and 63856 transitions. Second operand 7 states. [2019-12-27 20:14:36,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:14:36,850 INFO L93 Difference]: Finished difference Result 17652 states and 62159 transitions. [2019-12-27 20:14:36,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 20:14:36,851 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-12-27 20:14:36,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:14:36,889 INFO L225 Difference]: With dead ends: 17652 [2019-12-27 20:14:36,889 INFO L226 Difference]: Without dead ends: 14006 [2019-12-27 20:14:36,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:14:37,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14006 states. [2019-12-27 20:14:37,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14006 to 13050. [2019-12-27 20:14:37,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13050 states. [2019-12-27 20:14:37,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13050 states to 13050 states and 47484 transitions. [2019-12-27 20:14:37,187 INFO L78 Accepts]: Start accepts. Automaton has 13050 states and 47484 transitions. Word has length 42 [2019-12-27 20:14:37,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:14:37,187 INFO L462 AbstractCegarLoop]: Abstraction has 13050 states and 47484 transitions. [2019-12-27 20:14:37,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:14:37,188 INFO L276 IsEmpty]: Start isEmpty. Operand 13050 states and 47484 transitions. [2019-12-27 20:14:37,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:14:37,205 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:14:37,205 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:14:37,205 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:14:37,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:14:37,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1833036015, now seen corresponding path program 1 times [2019-12-27 20:14:37,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:14:37,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807431285] [2019-12-27 20:14:37,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:14:37,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:14:37,349 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:14:37,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807431285] [2019-12-27 20:14:37,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:14:37,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:14:37,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [532692998] [2019-12-27 20:14:37,350 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:14:37,370 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:14:37,583 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 275 states and 591 transitions. [2019-12-27 20:14:37,583 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:14:37,619 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 20:14:37,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:14:37,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:14:37,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:14:37,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:14:37,620 INFO L87 Difference]: Start difference. First operand 13050 states and 47484 transitions. Second operand 6 states. [2019-12-27 20:14:37,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:14:37,980 INFO L93 Difference]: Finished difference Result 23318 states and 83390 transitions. [2019-12-27 20:14:37,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:14:37,980 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-27 20:14:37,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:14:37,993 INFO L225 Difference]: With dead ends: 23318 [2019-12-27 20:14:37,994 INFO L226 Difference]: Without dead ends: 6768 [2019-12-27 20:14:37,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:14:38,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6768 states. [2019-12-27 20:14:38,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6768 to 4163. [2019-12-27 20:14:38,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4163 states. [2019-12-27 20:14:38,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4163 states to 4163 states and 13587 transitions. [2019-12-27 20:14:38,085 INFO L78 Accepts]: Start accepts. Automaton has 4163 states and 13587 transitions. Word has length 57 [2019-12-27 20:14:38,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:14:38,086 INFO L462 AbstractCegarLoop]: Abstraction has 4163 states and 13587 transitions. [2019-12-27 20:14:38,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:14:38,086 INFO L276 IsEmpty]: Start isEmpty. Operand 4163 states and 13587 transitions. [2019-12-27 20:14:38,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:14:38,090 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:14:38,091 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:14:38,091 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:14:38,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:14:38,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1816371613, now seen corresponding path program 2 times [2019-12-27 20:14:38,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:14:38,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611579358] [2019-12-27 20:14:38,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:14:38,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:14:38,188 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:14:38,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611579358] [2019-12-27 20:14:38,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:14:38,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:14:38,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1930098369] [2019-12-27 20:14:38,190 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:14:38,213 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:14:38,393 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 189 states and 353 transitions. [2019-12-27 20:14:38,393 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:14:38,449 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 20:14:38,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:14:38,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:14:38,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:14:38,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:14:38,450 INFO L87 Difference]: Start difference. First operand 4163 states and 13587 transitions. Second operand 9 states. [2019-12-27 20:14:39,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:14:39,482 INFO L93 Difference]: Finished difference Result 12936 states and 40727 transitions. [2019-12-27 20:14:39,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 20:14:39,483 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-27 20:14:39,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:14:39,497 INFO L225 Difference]: With dead ends: 12936 [2019-12-27 20:14:39,498 INFO L226 Difference]: Without dead ends: 9480 [2019-12-27 20:14:39,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2019-12-27 20:14:39,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9480 states. [2019-12-27 20:14:39,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9480 to 5378. [2019-12-27 20:14:39,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5378 states. [2019-12-27 20:14:39,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5378 states to 5378 states and 17440 transitions. [2019-12-27 20:14:39,618 INFO L78 Accepts]: Start accepts. Automaton has 5378 states and 17440 transitions. Word has length 57 [2019-12-27 20:14:39,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:14:39,618 INFO L462 AbstractCegarLoop]: Abstraction has 5378 states and 17440 transitions. [2019-12-27 20:14:39,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:14:39,618 INFO L276 IsEmpty]: Start isEmpty. Operand 5378 states and 17440 transitions. [2019-12-27 20:14:39,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:14:39,625 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:14:39,626 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:14:39,626 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:14:39,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:14:39,626 INFO L82 PathProgramCache]: Analyzing trace with hash 952900063, now seen corresponding path program 3 times [2019-12-27 20:14:39,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:14:39,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701015131] [2019-12-27 20:14:39,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:14:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:14:39,720 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:14:39,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701015131] [2019-12-27 20:14:39,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:14:39,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:14:39,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1994670617] [2019-12-27 20:14:39,721 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:14:39,757 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:14:39,994 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 221 states and 408 transitions. [2019-12-27 20:14:39,995 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:14:40,062 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 20:14:40,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 20:14:40,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:14:40,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 20:14:40,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:14:40,063 INFO L87 Difference]: Start difference. First operand 5378 states and 17440 transitions. Second operand 10 states. [2019-12-27 20:14:40,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:14:40,366 INFO L93 Difference]: Finished difference Result 9966 states and 31598 transitions. [2019-12-27 20:14:40,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 20:14:40,367 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2019-12-27 20:14:40,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:14:40,380 INFO L225 Difference]: With dead ends: 9966 [2019-12-27 20:14:40,380 INFO L226 Difference]: Without dead ends: 7295 [2019-12-27 20:14:40,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-27 20:14:40,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7295 states. [2019-12-27 20:14:40,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7295 to 6431. [2019-12-27 20:14:40,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6431 states. [2019-12-27 20:14:40,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6431 states to 6431 states and 20643 transitions. [2019-12-27 20:14:40,493 INFO L78 Accepts]: Start accepts. Automaton has 6431 states and 20643 transitions. Word has length 57 [2019-12-27 20:14:40,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:14:40,493 INFO L462 AbstractCegarLoop]: Abstraction has 6431 states and 20643 transitions. [2019-12-27 20:14:40,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 20:14:40,493 INFO L276 IsEmpty]: Start isEmpty. Operand 6431 states and 20643 transitions. [2019-12-27 20:14:40,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:14:40,503 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:14:40,503 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:14:40,504 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:14:40,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:14:40,504 INFO L82 PathProgramCache]: Analyzing trace with hash -282768913, now seen corresponding path program 4 times [2019-12-27 20:14:40,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:14:40,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779117970] [2019-12-27 20:14:40,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:14:40,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:14:40,626 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:14:40,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779117970] [2019-12-27 20:14:40,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:14:40,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:14:40,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2054325166] [2019-12-27 20:14:40,627 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:14:40,645 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:14:40,876 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 175 states and 318 transitions. [2019-12-27 20:14:40,877 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:14:40,901 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 20:14:40,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 20:14:40,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:14:40,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 20:14:40,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:14:40,903 INFO L87 Difference]: Start difference. First operand 6431 states and 20643 transitions. Second operand 10 states. [2019-12-27 20:14:42,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:14:42,736 INFO L93 Difference]: Finished difference Result 42264 states and 136685 transitions. [2019-12-27 20:14:42,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 20:14:42,736 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2019-12-27 20:14:42,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:14:42,791 INFO L225 Difference]: With dead ends: 42264 [2019-12-27 20:14:42,792 INFO L226 Difference]: Without dead ends: 33828 [2019-12-27 20:14:42,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=474, Invalid=1688, Unknown=0, NotChecked=0, Total=2162 [2019-12-27 20:14:42,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33828 states. [2019-12-27 20:14:43,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33828 to 9147. [2019-12-27 20:14:43,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9147 states. [2019-12-27 20:14:43,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9147 states to 9147 states and 29781 transitions. [2019-12-27 20:14:43,128 INFO L78 Accepts]: Start accepts. Automaton has 9147 states and 29781 transitions. Word has length 57 [2019-12-27 20:14:43,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:14:43,128 INFO L462 AbstractCegarLoop]: Abstraction has 9147 states and 29781 transitions. [2019-12-27 20:14:43,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 20:14:43,128 INFO L276 IsEmpty]: Start isEmpty. Operand 9147 states and 29781 transitions. [2019-12-27 20:14:43,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:14:43,142 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:14:43,142 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:14:43,142 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:14:43,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:14:43,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1223483339, now seen corresponding path program 5 times [2019-12-27 20:14:43,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:14:43,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205030914] [2019-12-27 20:14:43,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:14:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:14:43,258 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:14:43,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205030914] [2019-12-27 20:14:43,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:14:43,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:14:43,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1780136116] [2019-12-27 20:14:43,259 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:14:43,276 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:14:43,426 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 188 states and 351 transitions. [2019-12-27 20:14:43,426 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:14:43,631 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 20:14:43,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 20:14:43,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:14:43,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 20:14:43,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 20:14:43,633 INFO L87 Difference]: Start difference. First operand 9147 states and 29781 transitions. Second operand 12 states. [2019-12-27 20:14:47,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:14:47,485 INFO L93 Difference]: Finished difference Result 50253 states and 158958 transitions. [2019-12-27 20:14:47,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-12-27 20:14:47,485 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-12-27 20:14:47,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:14:47,553 INFO L225 Difference]: With dead ends: 50253 [2019-12-27 20:14:47,553 INFO L226 Difference]: Without dead ends: 41727 [2019-12-27 20:14:47,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1478 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=892, Invalid=3530, Unknown=0, NotChecked=0, Total=4422 [2019-12-27 20:14:47,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41727 states. [2019-12-27 20:14:47,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41727 to 10096. [2019-12-27 20:14:47,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10096 states. [2019-12-27 20:14:47,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10096 states to 10096 states and 32767 transitions. [2019-12-27 20:14:47,966 INFO L78 Accepts]: Start accepts. Automaton has 10096 states and 32767 transitions. Word has length 57 [2019-12-27 20:14:47,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:14:47,967 INFO L462 AbstractCegarLoop]: Abstraction has 10096 states and 32767 transitions. [2019-12-27 20:14:47,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 20:14:47,967 INFO L276 IsEmpty]: Start isEmpty. Operand 10096 states and 32767 transitions. [2019-12-27 20:14:47,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:14:47,979 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:14:47,979 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:14:47,979 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:14:47,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:14:47,979 INFO L82 PathProgramCache]: Analyzing trace with hash 417709041, now seen corresponding path program 6 times [2019-12-27 20:14:47,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:14:47,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431136259] [2019-12-27 20:14:47,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:14:48,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:14:48,053 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:14:48,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431136259] [2019-12-27 20:14:48,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:14:48,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:14:48,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [834828275] [2019-12-27 20:14:48,054 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:14:48,072 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:14:48,344 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 203 states and 371 transitions. [2019-12-27 20:14:48,344 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:14:48,345 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:14:48,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:14:48,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:14:48,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:14:48,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:14:48,346 INFO L87 Difference]: Start difference. First operand 10096 states and 32767 transitions. Second operand 3 states. [2019-12-27 20:14:48,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:14:48,384 INFO L93 Difference]: Finished difference Result 10094 states and 32762 transitions. [2019-12-27 20:14:48,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:14:48,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-27 20:14:48,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:14:48,402 INFO L225 Difference]: With dead ends: 10094 [2019-12-27 20:14:48,402 INFO L226 Difference]: Without dead ends: 10094 [2019-12-27 20:14:48,403 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:14:48,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10094 states. [2019-12-27 20:14:48,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10094 to 10094. [2019-12-27 20:14:48,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10094 states. [2019-12-27 20:14:48,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10094 states to 10094 states and 32762 transitions. [2019-12-27 20:14:48,564 INFO L78 Accepts]: Start accepts. Automaton has 10094 states and 32762 transitions. Word has length 57 [2019-12-27 20:14:48,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:14:48,565 INFO L462 AbstractCegarLoop]: Abstraction has 10094 states and 32762 transitions. [2019-12-27 20:14:48,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:14:48,565 INFO L276 IsEmpty]: Start isEmpty. Operand 10094 states and 32762 transitions. [2019-12-27 20:14:48,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 20:14:48,577 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:14:48,577 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:14:48,577 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:14:48,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:14:48,577 INFO L82 PathProgramCache]: Analyzing trace with hash -105178676, now seen corresponding path program 1 times [2019-12-27 20:14:48,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:14:48,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986905910] [2019-12-27 20:14:48,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:14:48,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:14:48,645 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:14:48,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986905910] [2019-12-27 20:14:48,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:14:48,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:14:48,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [991860044] [2019-12-27 20:14:48,646 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:14:48,671 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:14:48,896 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 204 states and 372 transitions. [2019-12-27 20:14:48,896 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:14:48,905 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:14:48,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:14:48,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:14:48,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:14:48,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:14:48,906 INFO L87 Difference]: Start difference. First operand 10094 states and 32762 transitions. Second operand 4 states. [2019-12-27 20:14:49,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:14:49,130 INFO L93 Difference]: Finished difference Result 13466 states and 42260 transitions. [2019-12-27 20:14:49,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:14:49,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-12-27 20:14:49,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:14:49,152 INFO L225 Difference]: With dead ends: 13466 [2019-12-27 20:14:49,152 INFO L226 Difference]: Without dead ends: 13466 [2019-12-27 20:14:49,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:14:49,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13466 states. [2019-12-27 20:14:49,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13466 to 8977. [2019-12-27 20:14:49,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8977 states. [2019-12-27 20:14:49,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8977 states to 8977 states and 28317 transitions. [2019-12-27 20:14:49,339 INFO L78 Accepts]: Start accepts. Automaton has 8977 states and 28317 transitions. Word has length 58 [2019-12-27 20:14:49,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:14:49,340 INFO L462 AbstractCegarLoop]: Abstraction has 8977 states and 28317 transitions. [2019-12-27 20:14:49,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:14:49,340 INFO L276 IsEmpty]: Start isEmpty. Operand 8977 states and 28317 transitions. [2019-12-27 20:14:49,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 20:14:49,350 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:14:49,350 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:14:49,351 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:14:49,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:14:49,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1032412649, now seen corresponding path program 1 times [2019-12-27 20:14:49,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:14:49,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129030434] [2019-12-27 20:14:49,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:14:49,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:14:49,524 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:14:49,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129030434] [2019-12-27 20:14:49,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:14:49,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:14:49,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [908915239] [2019-12-27 20:14:49,526 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:14:49,567 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:14:49,839 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 192 states and 361 transitions. [2019-12-27 20:14:49,839 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:14:50,061 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 20:14:50,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 20:14:50,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:14:50,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 20:14:50,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-27 20:14:50,062 INFO L87 Difference]: Start difference. First operand 8977 states and 28317 transitions. Second operand 12 states. [2019-12-27 20:14:51,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:14:51,316 INFO L93 Difference]: Finished difference Result 14591 states and 45365 transitions. [2019-12-27 20:14:51,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 20:14:51,317 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-12-27 20:14:51,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:14:51,346 INFO L225 Difference]: With dead ends: 14591 [2019-12-27 20:14:51,346 INFO L226 Difference]: Without dead ends: 10553 [2019-12-27 20:14:51,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2019-12-27 20:14:51,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10553 states. [2019-12-27 20:14:51,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10553 to 9291. [2019-12-27 20:14:51,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9291 states. [2019-12-27 20:14:51,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9291 states to 9291 states and 29062 transitions. [2019-12-27 20:14:51,749 INFO L78 Accepts]: Start accepts. Automaton has 9291 states and 29062 transitions. Word has length 59 [2019-12-27 20:14:51,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:14:51,750 INFO L462 AbstractCegarLoop]: Abstraction has 9291 states and 29062 transitions. [2019-12-27 20:14:51,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 20:14:51,750 INFO L276 IsEmpty]: Start isEmpty. Operand 9291 states and 29062 transitions. [2019-12-27 20:14:51,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 20:14:51,763 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:14:51,763 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:14:51,763 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:14:51,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:14:51,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1070518011, now seen corresponding path program 2 times [2019-12-27 20:14:51,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:14:51,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125830649] [2019-12-27 20:14:51,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:14:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:14:52,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:14:52,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125830649] [2019-12-27 20:14:52,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:14:52,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 20:14:52,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [277709544] [2019-12-27 20:14:52,314 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:14:52,332 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:14:52,682 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 194 states and 362 transitions. [2019-12-27 20:14:52,682 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:14:53,097 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 20:14:53,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-27 20:14:53,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:14:53,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-27 20:14:53,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2019-12-27 20:14:53,099 INFO L87 Difference]: Start difference. First operand 9291 states and 29062 transitions. Second operand 25 states. [2019-12-27 20:15:01,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:15:01,213 INFO L93 Difference]: Finished difference Result 30836 states and 95148 transitions. [2019-12-27 20:15:01,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-12-27 20:15:01,214 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 59 [2019-12-27 20:15:01,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:15:01,264 INFO L225 Difference]: With dead ends: 30836 [2019-12-27 20:15:01,264 INFO L226 Difference]: Without dead ends: 26728 [2019-12-27 20:15:01,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2104 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1077, Invalid=6579, Unknown=0, NotChecked=0, Total=7656 [2019-12-27 20:15:01,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26728 states. [2019-12-27 20:15:01,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26728 to 9435. [2019-12-27 20:15:01,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9435 states. [2019-12-27 20:15:01,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9435 states to 9435 states and 29529 transitions. [2019-12-27 20:15:01,544 INFO L78 Accepts]: Start accepts. Automaton has 9435 states and 29529 transitions. Word has length 59 [2019-12-27 20:15:01,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:15:01,545 INFO L462 AbstractCegarLoop]: Abstraction has 9435 states and 29529 transitions. [2019-12-27 20:15:01,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-27 20:15:01,545 INFO L276 IsEmpty]: Start isEmpty. Operand 9435 states and 29529 transitions. [2019-12-27 20:15:01,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 20:15:01,555 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:15:01,556 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:15:01,556 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:15:01,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:15:01,556 INFO L82 PathProgramCache]: Analyzing trace with hash 912465139, now seen corresponding path program 3 times [2019-12-27 20:15:01,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:15:01,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786408987] [2019-12-27 20:15:01,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:15:01,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:15:01,733 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:15:01,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786408987] [2019-12-27 20:15:01,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:15:01,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 20:15:01,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1119879254] [2019-12-27 20:15:01,735 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:15:01,751 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:15:02,030 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 200 states and 385 transitions. [2019-12-27 20:15:02,031 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:15:02,235 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 20:15:02,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 20:15:02,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:15:02,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 20:15:02,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 20:15:02,236 INFO L87 Difference]: Start difference. First operand 9435 states and 29529 transitions. Second operand 15 states. [2019-12-27 20:15:03,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:15:03,589 INFO L93 Difference]: Finished difference Result 13123 states and 40378 transitions. [2019-12-27 20:15:03,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 20:15:03,590 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2019-12-27 20:15:03,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:15:03,608 INFO L225 Difference]: With dead ends: 13123 [2019-12-27 20:15:03,608 INFO L226 Difference]: Without dead ends: 10157 [2019-12-27 20:15:03,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 20:15:03,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10157 states. [2019-12-27 20:15:03,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10157 to 9051. [2019-12-27 20:15:03,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9051 states. [2019-12-27 20:15:03,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9051 states to 9051 states and 28261 transitions. [2019-12-27 20:15:03,755 INFO L78 Accepts]: Start accepts. Automaton has 9051 states and 28261 transitions. Word has length 59 [2019-12-27 20:15:03,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:15:03,755 INFO L462 AbstractCegarLoop]: Abstraction has 9051 states and 28261 transitions. [2019-12-27 20:15:03,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 20:15:03,755 INFO L276 IsEmpty]: Start isEmpty. Operand 9051 states and 28261 transitions. [2019-12-27 20:15:03,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 20:15:03,764 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:15:03,765 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:15:03,765 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:15:03,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:15:03,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1628182047, now seen corresponding path program 4 times [2019-12-27 20:15:03,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:15:03,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672878101] [2019-12-27 20:15:03,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:15:03,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:15:03,939 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:15:03,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672878101] [2019-12-27 20:15:03,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:15:03,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 20:15:03,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1830812812] [2019-12-27 20:15:03,940 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:15:03,956 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:15:04,102 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 198 states and 371 transitions. [2019-12-27 20:15:04,103 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:15:04,367 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 25 times. [2019-12-27 20:15:04,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 20:15:04,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:15:04,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 20:15:04,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-27 20:15:04,369 INFO L87 Difference]: Start difference. First operand 9051 states and 28261 transitions. Second operand 16 states. [2019-12-27 20:15:05,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:15:05,336 INFO L93 Difference]: Finished difference Result 10103 states and 31077 transitions. [2019-12-27 20:15:05,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 20:15:05,337 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2019-12-27 20:15:05,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:15:05,352 INFO L225 Difference]: With dead ends: 10103 [2019-12-27 20:15:05,352 INFO L226 Difference]: Without dead ends: 9921 [2019-12-27 20:15:05,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 14 SyntacticMatches, 8 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=170, Invalid=760, Unknown=0, NotChecked=0, Total=930 [2019-12-27 20:15:05,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9921 states. [2019-12-27 20:15:05,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9921 to 8911. [2019-12-27 20:15:05,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8911 states. [2019-12-27 20:15:05,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8911 states to 8911 states and 27876 transitions. [2019-12-27 20:15:05,500 INFO L78 Accepts]: Start accepts. Automaton has 8911 states and 27876 transitions. Word has length 59 [2019-12-27 20:15:05,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:15:05,501 INFO L462 AbstractCegarLoop]: Abstraction has 8911 states and 27876 transitions. [2019-12-27 20:15:05,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 20:15:05,501 INFO L276 IsEmpty]: Start isEmpty. Operand 8911 states and 27876 transitions. [2019-12-27 20:15:05,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 20:15:05,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:15:05,513 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:15:05,514 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:15:05,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:15:05,514 INFO L82 PathProgramCache]: Analyzing trace with hash 317629459, now seen corresponding path program 5 times [2019-12-27 20:15:05,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:15:05,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717163709] [2019-12-27 20:15:05,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:15:05,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:15:05,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:15:05,615 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:15:05,615 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:15:05,619 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [855] [855] ULTIMATE.startENTRY-->L845: Formula: (let ((.cse0 (store |v_#valid_79| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~y$r_buff0_thd1~0_7 0) (= 0 v_~__unbuffered_p1_EAX~0_13) (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 v_~__unbuffered_p3_EAX~0_15) (= 0 v_~y$w_buff1~0_26) (= v_~y~0_25 0) (= |v_#valid_77| (store .cse0 |v_ULTIMATE.start_main_~#t437~0.base_22| 1)) (= 0 v_~__unbuffered_p0_EAX~0_15) (= v_~main$tmp_guard0~0_9 0) (= v_~y$r_buff0_thd3~0_24 0) (= |v_#NULL.offset_6| 0) (= |v_ULTIMATE.start_main_~#t437~0.offset_17| 0) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff0_thd2~0_66 0) (= 0 v_~y$flush_delayed~0_14) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t437~0.base_22| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t437~0.base_22|) |v_ULTIMATE.start_main_~#t437~0.offset_17| 0)) |v_#memory_int_21|) (= 0 v_~__unbuffered_cnt~0_26) (= v_~y$r_buff1_thd1~0_8 0) (= v_~y$r_buff0_thd0~0_19 0) (= (store |v_#length_32| |v_ULTIMATE.start_main_~#t437~0.base_22| 4) |v_#length_31|) (= 0 v_~__unbuffered_p2_EAX~0_15) (= 0 |v_#NULL.base_6|) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t437~0.base_22|) (= 0 v_~y$r_buff1_thd0~0_21) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_p3_EBX~0_15) (< 0 |v_#StackHeapBarrier_20|) (= 0 v_~weak$$choice2~0_35) (= 0 v_~y$w_buff0~0_27) (= v_~y$w_buff0_used~0_105 0) (= 0 v_~z~0_9) (= 0 v_~y$r_buff1_thd3~0_18) (= v_~a~0_12 0) (= v_~y$mem_tmp~0_10 0) (= v_~y$r_buff0_thd4~0_19 0) (= v_~x~0_12 0) (= v_~y$w_buff1_used~0_69 0) (= 0 v_~y$r_buff1_thd2~0_42) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t437~0.base_22|)) (= 0 v_~y$r_buff1_thd4~0_18))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_79|, #memory_int=|v_#memory_int_22|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_~#t438~0.offset=|v_ULTIMATE.start_main_~#t438~0.offset_17|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_22|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_13|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_12, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_13, ULTIMATE.start_main_~#t440~0.offset=|v_ULTIMATE.start_main_~#t440~0.offset_17|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_15, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_15, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_9|, ULTIMATE.start_main_~#t439~0.base=|v_ULTIMATE.start_main_~#t439~0.base_20|, ULTIMATE.start_main_~#t438~0.base=|v_ULTIMATE.start_main_~#t438~0.base_22|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_18, ~y$w_buff1~0=v_~y$w_buff1~0_26, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t437~0.offset=|v_ULTIMATE.start_main_~#t437~0.offset_17|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_66, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_21, ~x~0=v_~x~0_12, ULTIMATE.start_main_~#t440~0.base=|v_ULTIMATE.start_main_~#t440~0.base_21|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ULTIMATE.start_main_~#t439~0.offset=|v_ULTIMATE.start_main_~#t439~0.offset_16|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_8, ~y$w_buff0~0=v_~y$w_buff0~0_27, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ~y~0=v_~y~0_25, ULTIMATE.start_main_~#t437~0.base=|v_ULTIMATE.start_main_~#t437~0.base_22|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_15, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_42, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_19, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_19, #valid=|v_#valid_77|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_69} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t438~0.offset, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t440~0.offset, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t439~0.base, ULTIMATE.start_main_~#t438~0.base, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t437~0.offset, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t440~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t439~0.offset, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t437~0.base, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 20:15:05,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] L845-1-->L847: Formula: (and (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t438~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t438~0.base_11|) |v_ULTIMATE.start_main_~#t438~0.offset_10| 1)) |v_#memory_int_17|) (= 0 (select |v_#valid_44| |v_ULTIMATE.start_main_~#t438~0.base_11|)) (= (store |v_#valid_44| |v_ULTIMATE.start_main_~#t438~0.base_11| 1) |v_#valid_43|) (not (= 0 |v_ULTIMATE.start_main_~#t438~0.base_11|)) (= |v_ULTIMATE.start_main_~#t438~0.offset_10| 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t438~0.base_11| 4)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t438~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t438~0.base=|v_ULTIMATE.start_main_~#t438~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t438~0.offset=|v_ULTIMATE.start_main_~#t438~0.offset_10|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t438~0.base, ULTIMATE.start_main_~#t438~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 20:15:05,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L847-1-->L849: Formula: (and (not (= |v_ULTIMATE.start_main_~#t439~0.base_10| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t439~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t439~0.base_10|) |v_ULTIMATE.start_main_~#t439~0.offset_9| 2)) |v_#memory_int_13|) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t439~0.base_10|)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t439~0.base_10| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t439~0.base_10|) (= |v_ULTIMATE.start_main_~#t439~0.offset_9| 0) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t439~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t439~0.offset=|v_ULTIMATE.start_main_~#t439~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t439~0.base=|v_ULTIMATE.start_main_~#t439~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t439~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t439~0.base] because there is no mapped edge [2019-12-27 20:15:05,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [809] [809] L849-1-->L851: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t440~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t440~0.base_13|) |v_ULTIMATE.start_main_~#t440~0.offset_11| 3)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t440~0.base_13|) (= 0 |v_ULTIMATE.start_main_~#t440~0.offset_11|) (not (= |v_ULTIMATE.start_main_~#t440~0.base_13| 0)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t440~0.base_13| 4) |v_#length_21|) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t440~0.base_13| 1)) (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t440~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t440~0.base=|v_ULTIMATE.start_main_~#t440~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_6|, ULTIMATE.start_main_~#t440~0.offset=|v_ULTIMATE.start_main_~#t440~0.offset_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t440~0.base, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t440~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 20:15:05,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] P2ENTRY-->L4-3: Formula: (and (= P2Thread1of1ForFork3_~arg.offset_Out-1894851109 |P2Thread1of1ForFork3_#in~arg.offset_In-1894851109|) (= P2Thread1of1ForFork3___VERIFIER_assert_~expression_Out-1894851109 |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression_Out-1894851109|) (= |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression_Out-1894851109| 1) (= 1 ~y$w_buff0_used~0_Out-1894851109) (= 0 (mod ~y$w_buff1_used~0_Out-1894851109 256)) (= |P2Thread1of1ForFork3_#in~arg.base_In-1894851109| P2Thread1of1ForFork3_~arg.base_Out-1894851109) (= ~y$w_buff0_used~0_In-1894851109 ~y$w_buff1_used~0_Out-1894851109) (= ~y$w_buff0~0_Out-1894851109 1) (= ~y$w_buff1~0_Out-1894851109 ~y$w_buff0~0_In-1894851109)) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1894851109, ~y$w_buff0~0=~y$w_buff0~0_In-1894851109, P2Thread1of1ForFork3_#in~arg.base=|P2Thread1of1ForFork3_#in~arg.base_In-1894851109|, P2Thread1of1ForFork3_#in~arg.offset=|P2Thread1of1ForFork3_#in~arg.offset_In-1894851109|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-1894851109, ~y$w_buff1~0=~y$w_buff1~0_Out-1894851109, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression=|P2Thread1of1ForFork3___VERIFIER_assert_#in~expression_Out-1894851109|, ~y$w_buff0~0=~y$w_buff0~0_Out-1894851109, P2Thread1of1ForFork3_~arg.base=P2Thread1of1ForFork3_~arg.base_Out-1894851109, P2Thread1of1ForFork3___VERIFIER_assert_~expression=P2Thread1of1ForFork3___VERIFIER_assert_~expression_Out-1894851109, P2Thread1of1ForFork3_#in~arg.base=|P2Thread1of1ForFork3_#in~arg.base_In-1894851109|, P2Thread1of1ForFork3_~arg.offset=P2Thread1of1ForFork3_~arg.offset_Out-1894851109, P2Thread1of1ForFork3_#in~arg.offset=|P2Thread1of1ForFork3_#in~arg.offset_In-1894851109|, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-1894851109} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression, ~y$w_buff0~0, P2Thread1of1ForFork3_~arg.base, P2Thread1of1ForFork3___VERIFIER_assert_~expression, P2Thread1of1ForFork3_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 20:15:05,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_23 1) v_~__unbuffered_cnt~0_22) (= 1 v_~a~0_7) (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= v_~__unbuffered_p0_EAX~0_7 v_~x~0_7) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_7} OutVars{~a~0=v_~a~0_7, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_7, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 20:15:05,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L822-2-->L822-5: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd4~0_In1457273009 256))) (.cse2 (= |P3Thread1of1ForFork0_#t~ite32_Out1457273009| |P3Thread1of1ForFork0_#t~ite33_Out1457273009|)) (.cse0 (= (mod ~y$w_buff1_used~0_In1457273009 256) 0))) (or (and (or .cse0 .cse1) (= ~y~0_In1457273009 |P3Thread1of1ForFork0_#t~ite32_Out1457273009|) .cse2) (and (not .cse1) (= |P3Thread1of1ForFork0_#t~ite32_Out1457273009| ~y$w_buff1~0_In1457273009) .cse2 (not .cse0)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1457273009, ~y$w_buff1~0=~y$w_buff1~0_In1457273009, ~y~0=~y~0_In1457273009, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1457273009} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1457273009, ~y$w_buff1~0=~y$w_buff1~0_In1457273009, ~y~0=~y~0_In1457273009, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out1457273009|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out1457273009|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1457273009} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-27 20:15:05,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-934813367 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-934813367 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-934813367 |P2Thread1of1ForFork3_#t~ite28_Out-934813367|)) (and (= |P2Thread1of1ForFork3_#t~ite28_Out-934813367| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-934813367, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-934813367} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-934813367, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-934813367, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out-934813367|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-27 20:15:05,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd4~0_In1142014905 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1142014905 256)))) (or (and (= |P3Thread1of1ForFork0_#t~ite34_Out1142014905| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P3Thread1of1ForFork0_#t~ite34_Out1142014905| ~y$w_buff0_used~0_In1142014905)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1142014905, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1142014905} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1142014905, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1142014905, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out1142014905|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-27 20:15:05,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L801-->L801-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd3~0_In499649104 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In499649104 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In499649104 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In499649104 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork3_#t~ite29_Out499649104| 0)) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork3_#t~ite29_Out499649104| ~y$w_buff1_used~0_In499649104) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In499649104, ~y$w_buff0_used~0=~y$w_buff0_used~0_In499649104, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In499649104, ~y$w_buff1_used~0=~y$w_buff1_used~0_In499649104} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In499649104, ~y$w_buff0_used~0=~y$w_buff0_used~0_In499649104, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In499649104, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out499649104|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In499649104} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-27 20:15:05,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L763-->L763-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-2142766493 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite8_Out-2142766493| ~y$w_buff0~0_In-2142766493) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-2142766493 256)))) (or (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-2142766493 256))) (and (= (mod ~y$r_buff1_thd2~0_In-2142766493 256) 0) .cse0) (= 0 (mod ~y$w_buff0_used~0_In-2142766493 256)))) .cse1 (= |P1Thread1of1ForFork2_#t~ite9_Out-2142766493| |P1Thread1of1ForFork2_#t~ite8_Out-2142766493|)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out-2142766493| ~y$w_buff0~0_In-2142766493) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite8_In-2142766493| |P1Thread1of1ForFork2_#t~ite8_Out-2142766493|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2142766493, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2142766493, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_In-2142766493|, ~y$w_buff0~0=~y$w_buff0~0_In-2142766493, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2142766493, ~weak$$choice2~0=~weak$$choice2~0_In-2142766493, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2142766493} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2142766493, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-2142766493|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2142766493, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-2142766493|, ~y$w_buff0~0=~y$w_buff0~0_In-2142766493, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2142766493, ~weak$$choice2~0=~weak$$choice2~0_In-2142766493, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2142766493} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 20:15:05,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-503121986 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out-503121986| ~y$w_buff1~0_In-503121986) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite11_In-503121986| |P1Thread1of1ForFork2_#t~ite11_Out-503121986|)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out-503121986| |P1Thread1of1ForFork2_#t~ite12_Out-503121986|) .cse0 (= |P1Thread1of1ForFork2_#t~ite11_Out-503121986| ~y$w_buff1~0_In-503121986) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-503121986 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-503121986 256)) (and .cse1 (= (mod ~y$w_buff1_used~0_In-503121986 256) 0)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-503121986 256) 0))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-503121986, ~y$w_buff1~0=~y$w_buff1~0_In-503121986, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-503121986, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-503121986, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In-503121986|, ~weak$$choice2~0=~weak$$choice2~0_In-503121986, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-503121986} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-503121986, ~y$w_buff1~0=~y$w_buff1~0_In-503121986, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-503121986, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-503121986, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-503121986|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-503121986|, ~weak$$choice2~0=~weak$$choice2~0_In-503121986, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-503121986} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 20:15:05,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L802-->L803: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-479459137 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-479459137 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd3~0_Out-479459137)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd3~0_Out-479459137 ~y$r_buff0_thd3~0_In-479459137)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-479459137, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-479459137} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out-479459137|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-479459137, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-479459137} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 20:15:05,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In208375794 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd3~0_In208375794 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In208375794 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In208375794 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork3_#t~ite31_Out208375794| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork3_#t~ite31_Out208375794| ~y$r_buff1_thd3~0_In208375794) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In208375794, ~y$w_buff0_used~0=~y$w_buff0_used~0_In208375794, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In208375794, ~y$w_buff1_used~0=~y$w_buff1_used~0_In208375794} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In208375794, ~y$w_buff0_used~0=~y$w_buff0_used~0_In208375794, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In208375794, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out208375794|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In208375794} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-27 20:15:05,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#res.offset_5| 0) (= |v_P2Thread1of1ForFork3_#t~ite31_8| v_~y$r_buff1_thd3~0_13) (= 0 |v_P2Thread1of1ForFork3_#res.base_5|) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_13, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_5|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-27 20:15:05,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L824-->L824-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd4~0_In-313554401 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-313554401 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In-313554401 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-313554401 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork0_#t~ite35_Out-313554401|)) (and (= ~y$w_buff1_used~0_In-313554401 |P3Thread1of1ForFork0_#t~ite35_Out-313554401|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-313554401, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-313554401, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-313554401, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-313554401} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-313554401, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-313554401, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-313554401, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out-313554401|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-313554401} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-27 20:15:05,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L825-->L825-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In-1587375237 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1587375237 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd4~0_In-1587375237 |P3Thread1of1ForFork0_#t~ite36_Out-1587375237|)) (and (= 0 |P3Thread1of1ForFork0_#t~ite36_Out-1587375237|) (not .cse0) (not .cse1)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1587375237, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1587375237} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1587375237, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1587375237, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out-1587375237|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-27 20:15:05,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L826-->L826-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1390051935 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In1390051935 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In1390051935 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd4~0_In1390051935 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd4~0_In1390051935 |P3Thread1of1ForFork0_#t~ite37_Out1390051935|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P3Thread1of1ForFork0_#t~ite37_Out1390051935|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1390051935, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1390051935, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1390051935, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1390051935} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1390051935, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1390051935, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1390051935, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out1390051935|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1390051935} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-27 20:15:05,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L826-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#res.base_5| 0) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= 0 |v_P3Thread1of1ForFork0_#res.offset_5|) (= |v_P3Thread1of1ForFork0_#t~ite37_8| v_~y$r_buff1_thd4~0_13)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_13, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_5|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_7|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 20:15:05,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In929841767 256) 0))) (or (and (= ~y$w_buff0_used~0_In929841767 |P1Thread1of1ForFork2_#t~ite15_Out929841767|) (= |P1Thread1of1ForFork2_#t~ite14_In929841767| |P1Thread1of1ForFork2_#t~ite14_Out929841767|) (not .cse0)) (and (= ~y$w_buff0_used~0_In929841767 |P1Thread1of1ForFork2_#t~ite14_Out929841767|) (= |P1Thread1of1ForFork2_#t~ite15_Out929841767| |P1Thread1of1ForFork2_#t~ite14_Out929841767|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In929841767 256) 0))) (or (and (= (mod ~y$r_buff1_thd2~0_In929841767 256) 0) .cse1) (and .cse1 (= (mod ~y$w_buff1_used~0_In929841767 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In929841767 256))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In929841767, ~y$w_buff0_used~0=~y$w_buff0_used~0_In929841767, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In929841767, ~weak$$choice2~0=~weak$$choice2~0_In929841767, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In929841767|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In929841767} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In929841767, ~y$w_buff0_used~0=~y$w_buff0_used~0_In929841767, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In929841767, ~weak$$choice2~0=~weak$$choice2~0_In929841767, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out929841767|, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out929841767|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In929841767} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 20:15:05,637 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L767-->L768: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~y$r_buff0_thd2~0_53 v_~y$r_buff0_thd2~0_52)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_8|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_52, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_9|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_8|, ~weak$$choice2~0=v_~weak$$choice2~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 20:15:05,637 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L768-->L768-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1496486627 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1496486627 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In1496486627 256)) (and .cse0 (= (mod ~y$w_buff1_used~0_In1496486627 256) 0)) (and (= (mod ~y$r_buff1_thd2~0_In1496486627 256) 0) .cse0))) (= |P1Thread1of1ForFork2_#t~ite23_Out1496486627| |P1Thread1of1ForFork2_#t~ite24_Out1496486627|) .cse1 (= ~y$r_buff1_thd2~0_In1496486627 |P1Thread1of1ForFork2_#t~ite23_Out1496486627|)) (and (= |P1Thread1of1ForFork2_#t~ite23_In1496486627| |P1Thread1of1ForFork2_#t~ite23_Out1496486627|) (not .cse1) (= ~y$r_buff1_thd2~0_In1496486627 |P1Thread1of1ForFork2_#t~ite24_Out1496486627|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1496486627, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1496486627, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1496486627, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In1496486627|, ~weak$$choice2~0=~weak$$choice2~0_In1496486627, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1496486627} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1496486627, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1496486627, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1496486627, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out1496486627|, ~weak$$choice2~0=~weak$$choice2~0_In1496486627, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out1496486627|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1496486627} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-27 20:15:05,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L770-->L778: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= v_~y~0_16 v_~y$mem_tmp~0_4)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~y~0=v_~y~0_16, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-27 20:15:05,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L851-1-->L857: Formula: (and (= 4 v_~__unbuffered_cnt~0_12) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 20:15:05,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L857-2-->L857-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In664400692 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In664400692 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out664400692| ~y$w_buff1~0_In664400692)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite42_Out664400692| ~y~0_In664400692)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In664400692, ~y~0=~y~0_In664400692, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In664400692, ~y$w_buff1_used~0=~y$w_buff1_used~0_In664400692} OutVars{~y$w_buff1~0=~y$w_buff1~0_In664400692, ~y~0=~y~0_In664400692, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out664400692|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In664400692, ~y$w_buff1_used~0=~y$w_buff1_used~0_In664400692} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 20:15:05,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L857-4-->L858: Formula: (= v_~y~0_18 |v_ULTIMATE.start_main_#t~ite42_8|) InVars {ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} OutVars{ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_7|, ~y~0=v_~y~0_18, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 20:15:05,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L858-->L858-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In2032828973 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In2032828973 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out2032828973| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out2032828973| ~y$w_buff0_used~0_In2032828973)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2032828973, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2032828973} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2032828973, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2032828973, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out2032828973|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 20:15:05,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L859-->L859-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-795503551 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-795503551 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-795503551 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-795503551 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-795503551 |ULTIMATE.start_main_#t~ite45_Out-795503551|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-795503551|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-795503551, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-795503551, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-795503551, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-795503551} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-795503551, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-795503551, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-795503551, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-795503551|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-795503551} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 20:15:05,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L860-->L860-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1457358738 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1457358738 256)))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-1457358738| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd0~0_In-1457358738 |ULTIMATE.start_main_#t~ite46_Out-1457358738|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1457358738, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1457358738} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1457358738, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1457358738, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1457358738|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 20:15:05,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L861-->L861-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-1096762235 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-1096762235 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1096762235 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1096762235 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite47_Out-1096762235| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite47_Out-1096762235| ~y$r_buff1_thd0~0_In-1096762235)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1096762235, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1096762235, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1096762235, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1096762235} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1096762235, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1096762235, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1096762235|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1096762235, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1096762235} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 20:15:05,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L861-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= 0 v_~__unbuffered_p2_EAX~0_11) (= |v_ULTIMATE.start_main_#t~ite47_17| v_~y$r_buff1_thd0~0_16) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~main$tmp_guard1~0_12 0) (= 0 v_~__unbuffered_p3_EBX~0_11) (= 0 v_~__unbuffered_p1_EAX~0_10) (= 0 v_~__unbuffered_p0_EAX~0_12) (= 1 v_~__unbuffered_p3_EAX~0_11)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_11, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_17|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_11, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_11} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_11, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_16|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_11, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_11, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:15:05,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:15:05 BasicIcfg [2019-12-27 20:15:05,738 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:15:05,739 INFO L168 Benchmark]: Toolchain (without parser) took 158832.39 ms. Allocated memory was 138.4 MB in the beginning and 3.0 GB in the end (delta: 2.9 GB). Free memory was 101.4 MB in the beginning and 807.2 MB in the end (delta: -705.8 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-27 20:15:05,740 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.4 MB. Free memory is still 121.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 20:15:05,740 INFO L168 Benchmark]: CACSL2BoogieTranslator took 744.30 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 101.0 MB in the beginning and 154.0 MB in the end (delta: -53.1 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2019-12-27 20:15:05,741 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.28 ms. Allocated memory is still 202.4 MB. Free memory was 153.1 MB in the beginning and 151.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 20:15:05,741 INFO L168 Benchmark]: Boogie Preprocessor took 40.32 ms. Allocated memory is still 202.4 MB. Free memory was 151.1 MB in the beginning and 148.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 20:15:05,742 INFO L168 Benchmark]: RCFGBuilder took 806.10 ms. Allocated memory is still 202.4 MB. Free memory was 148.2 MB in the beginning and 98.8 MB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. [2019-12-27 20:15:05,743 INFO L168 Benchmark]: TraceAbstraction took 157154.85 ms. Allocated memory was 202.4 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 98.8 MB in the beginning and 807.2 MB in the end (delta: -708.4 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-27 20:15:05,746 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 138.4 MB. Free memory is still 121.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 744.30 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 101.0 MB in the beginning and 154.0 MB in the end (delta: -53.1 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 79.28 ms. Allocated memory is still 202.4 MB. Free memory was 153.1 MB in the beginning and 151.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.32 ms. Allocated memory is still 202.4 MB. Free memory was 151.1 MB in the beginning and 148.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 806.10 ms. Allocated memory is still 202.4 MB. Free memory was 148.2 MB in the beginning and 98.8 MB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 157154.85 ms. Allocated memory was 202.4 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 98.8 MB in the beginning and 807.2 MB in the end (delta: -708.4 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.3s, 182 ProgramPointsBefore, 89 ProgramPointsAfterwards, 210 TransitionsBefore, 94 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 28 ChoiceCompositions, 7202 VarBasedMoverChecksPositive, 204 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 74863 CheckedPairsTotal, 122 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L845] FCALL, FORK 0 pthread_create(&t437, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L847] FCALL, FORK 0 pthread_create(&t438, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L849] FCALL, FORK 0 pthread_create(&t439, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L851] FCALL, FORK 0 pthread_create(&t440, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L789] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L790] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L791] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L792] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L793] 3 y$r_buff0_thd3 = (_Bool)1 [L796] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L799] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 4 z = 1 [L816] 4 __unbuffered_p3_EAX = z [L819] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L755] 2 x = 1 [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L762] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L763] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L764] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L823] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L824] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L825] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L765] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L857] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 156.8s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 41.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3800 SDtfs, 10102 SDslu, 15058 SDs, 0 SdLazy, 8742 SolverSat, 827 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 498 GetRequests, 117 SyntacticMatches, 28 SemanticMatches, 353 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4693 ImplicationChecksByTransitivity, 10.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=227200occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 69.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 123863 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 942 NumberOfCodeBlocks, 942 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 862 ConstructedInterpolants, 0 QuantifiedInterpolants, 185514 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...