/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/mix046_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:21:11,630 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:21:11,632 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:21:11,652 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:21:11,652 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:21:11,655 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:21:11,657 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:21:11,667 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:21:11,671 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:21:11,674 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:21:11,677 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:21:11,679 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:21:11,679 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:21:11,681 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:21:11,683 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:21:11,684 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:21:11,685 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:21:11,688 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:21:11,690 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:21:11,694 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:21:11,698 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:21:11,702 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:21:11,703 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:21:11,704 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:21:11,707 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:21:11,707 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:21:11,707 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:21:11,709 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:21:11,710 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:21:11,711 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:21:11,712 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:21:11,713 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:21:11,714 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:21:11,715 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:21:11,716 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:21:11,716 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:21:11,717 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:21:11,717 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:21:11,717 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:21:11,718 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:21:11,719 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:21:11,720 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 21:21:11,752 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:21:11,753 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:21:11,758 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:21:11,758 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:21:11,759 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:21:11,759 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:21:11,759 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:21:11,759 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:21:11,759 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:21:11,760 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:21:11,760 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:21:11,760 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:21:11,760 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:21:11,760 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:21:11,760 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:21:11,761 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:21:11,761 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:21:11,761 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:21:11,761 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:21:11,761 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:21:11,762 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:21:11,762 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:21:11,762 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:21:11,762 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:21:11,762 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:21:11,763 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:21:11,763 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:21:11,763 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:21:11,763 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:21:11,763 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:21:11,764 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:21:11,764 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:21:12,067 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:21:12,080 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:21:12,085 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:21:12,087 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:21:12,088 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:21:12,088 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046_pso.opt.i [2019-12-27 21:21:12,155 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8cc1a872/318d15ba8f3542688a9b1e12b557b72c/FLAG54c742c3e [2019-12-27 21:21:12,696 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:21:12,697 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046_pso.opt.i [2019-12-27 21:21:12,727 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8cc1a872/318d15ba8f3542688a9b1e12b557b72c/FLAG54c742c3e [2019-12-27 21:21:12,974 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8cc1a872/318d15ba8f3542688a9b1e12b557b72c [2019-12-27 21:21:12,985 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:21:12,987 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:21:12,988 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:21:12,988 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:21:12,992 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:21:12,993 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:21:12" (1/1) ... [2019-12-27 21:21:12,996 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@775bc81a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:21:12, skipping insertion in model container [2019-12-27 21:21:12,996 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:21:12" (1/1) ... [2019-12-27 21:21:13,004 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:21:13,074 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:21:13,545 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:21:13,559 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:21:13,639 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:21:13,743 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:21:13,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:21:13 WrapperNode [2019-12-27 21:21:13,743 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:21:13,744 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:21:13,744 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:21:13,744 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:21:13,754 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:21:13" (1/1) ... [2019-12-27 21:21:13,778 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:21:13" (1/1) ... [2019-12-27 21:21:13,816 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:21:13,816 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:21:13,816 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:21:13,816 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:21:13,824 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:21:13" (1/1) ... [2019-12-27 21:21:13,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:21:13" (1/1) ... [2019-12-27 21:21:13,829 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:21:13" (1/1) ... [2019-12-27 21:21:13,830 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:21:13" (1/1) ... [2019-12-27 21:21:13,840 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:21:13" (1/1) ... [2019-12-27 21:21:13,844 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:21:13" (1/1) ... [2019-12-27 21:21:13,848 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:21:13" (1/1) ... [2019-12-27 21:21:13,853 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:21:13,854 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:21:13,854 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:21:13,854 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:21:13,855 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:21:13" (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 21:21:13,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:21:13,924 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:21:13,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:21:13,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:21:13,925 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:21:13,925 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:21:13,925 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:21:13,925 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:21:13,926 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 21:21:13,926 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 21:21:13,926 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 21:21:13,926 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 21:21:13,926 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:21:13,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:21:13,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:21:13,929 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 21:21:14,716 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:21:14,717 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:21:14,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:21:14 BoogieIcfgContainer [2019-12-27 21:21:14,718 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:21:14,720 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:21:14,720 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:21:14,723 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:21:14,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:21:12" (1/3) ... [2019-12-27 21:21:14,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6639df41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:21:14, skipping insertion in model container [2019-12-27 21:21:14,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:21:13" (2/3) ... [2019-12-27 21:21:14,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6639df41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:21:14, skipping insertion in model container [2019-12-27 21:21:14,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:21:14" (3/3) ... [2019-12-27 21:21:14,727 INFO L109 eAbstractionObserver]: Analyzing ICFG mix046_pso.opt.i [2019-12-27 21:21:14,738 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:21:14,738 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:21:14,746 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:21:14,747 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:21:14,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,785 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,786 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,788 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,789 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,793 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,793 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,820 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,823 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,824 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,824 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,824 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,824 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,824 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,825 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,825 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,825 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,826 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,826 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,826 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,829 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,830 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,830 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,830 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,830 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,831 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,831 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,831 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,831 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,831 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,832 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,832 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,832 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,832 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,832 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,833 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,833 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,833 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,833 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,833 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,834 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,834 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,838 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,838 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,841 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,841 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,845 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,845 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,848 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,848 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,849 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,849 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,849 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,849 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,850 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,850 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,850 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,850 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,850 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,851 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:21:14,865 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 21:21:14,882 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:21:14,882 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:21:14,882 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:21:14,882 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:21:14,883 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:21:14,883 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:21:14,883 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:21:14,883 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:21:14,900 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-27 21:21:14,902 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-27 21:21:15,007 INFO L132 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-27 21:21:15,007 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:21:15,025 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 21:21:15,046 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-27 21:21:15,099 INFO L132 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-27 21:21:15,099 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:21:15,106 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 21:21:15,122 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-27 21:21:15,123 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:21:18,987 WARN L192 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-27 21:21:19,187 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-27 21:21:19,207 INFO L206 etLargeBlockEncoding]: Checked pairs total: 54567 [2019-12-27 21:21:19,207 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-27 21:21:19,211 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 100 transitions [2019-12-27 21:21:22,208 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 39550 states. [2019-12-27 21:21:22,210 INFO L276 IsEmpty]: Start isEmpty. Operand 39550 states. [2019-12-27 21:21:22,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 21:21:22,217 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:21:22,218 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:21:22,219 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:21:22,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:21:22,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1832018812, now seen corresponding path program 1 times [2019-12-27 21:21:22,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:21:22,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514976204] [2019-12-27 21:21:22,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:21:22,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:21:22,510 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 21:21:22,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514976204] [2019-12-27 21:21:22,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:21:22,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:21:22,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1210233682] [2019-12-27 21:21:22,513 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:21:22,518 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:21:22,536 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 21:21:22,536 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:21:22,540 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:21:22,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:21:22,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:21:22,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:21:22,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:21:22,557 INFO L87 Difference]: Start difference. First operand 39550 states. Second operand 3 states. [2019-12-27 21:21:23,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:21:23,435 INFO L93 Difference]: Finished difference Result 36830 states and 156304 transitions. [2019-12-27 21:21:23,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:21:23,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 21:21:23,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:21:23,797 INFO L225 Difference]: With dead ends: 36830 [2019-12-27 21:21:23,797 INFO L226 Difference]: Without dead ends: 36102 [2019-12-27 21:21:23,801 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 21:21:24,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36102 states. [2019-12-27 21:21:26,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36102 to 36102. [2019-12-27 21:21:26,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36102 states. [2019-12-27 21:21:27,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36102 states to 36102 states and 153336 transitions. [2019-12-27 21:21:27,134 INFO L78 Accepts]: Start accepts. Automaton has 36102 states and 153336 transitions. Word has length 9 [2019-12-27 21:21:27,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:21:27,136 INFO L462 AbstractCegarLoop]: Abstraction has 36102 states and 153336 transitions. [2019-12-27 21:21:27,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:21:27,136 INFO L276 IsEmpty]: Start isEmpty. Operand 36102 states and 153336 transitions. [2019-12-27 21:21:27,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 21:21:27,149 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:21:27,149 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:21:27,150 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:21:27,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:21:27,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1657144856, now seen corresponding path program 1 times [2019-12-27 21:21:27,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:21:27,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114009570] [2019-12-27 21:21:27,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:21:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:21:27,316 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 21:21:27,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114009570] [2019-12-27 21:21:27,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:21:27,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:21:27,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1922406536] [2019-12-27 21:21:27,319 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:21:27,321 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:21:27,331 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 39 transitions. [2019-12-27 21:21:27,331 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:21:27,372 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:21:27,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:21:27,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:21:27,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:21:27,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:21:27,375 INFO L87 Difference]: Start difference. First operand 36102 states and 153336 transitions. Second operand 5 states. [2019-12-27 21:21:28,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:21:28,803 INFO L93 Difference]: Finished difference Result 56134 states and 230968 transitions. [2019-12-27 21:21:28,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:21:28,803 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-12-27 21:21:28,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:21:29,102 INFO L225 Difference]: With dead ends: 56134 [2019-12-27 21:21:29,103 INFO L226 Difference]: Without dead ends: 56106 [2019-12-27 21:21:29,104 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 21:21:29,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56106 states. [2019-12-27 21:21:32,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56106 to 50070. [2019-12-27 21:21:32,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50070 states. [2019-12-27 21:21:33,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50070 states to 50070 states and 208456 transitions. [2019-12-27 21:21:33,069 INFO L78 Accepts]: Start accepts. Automaton has 50070 states and 208456 transitions. Word has length 15 [2019-12-27 21:21:33,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:21:33,070 INFO L462 AbstractCegarLoop]: Abstraction has 50070 states and 208456 transitions. [2019-12-27 21:21:33,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:21:33,070 INFO L276 IsEmpty]: Start isEmpty. Operand 50070 states and 208456 transitions. [2019-12-27 21:21:33,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 21:21:33,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:21:33,073 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:21:33,073 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:21:33,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:21:33,074 INFO L82 PathProgramCache]: Analyzing trace with hash -311678002, now seen corresponding path program 1 times [2019-12-27 21:21:33,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:21:33,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156115890] [2019-12-27 21:21:33,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:21:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:21:33,118 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 21:21:33,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156115890] [2019-12-27 21:21:33,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:21:33,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:21:33,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [676604314] [2019-12-27 21:21:33,119 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:21:33,121 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:21:33,123 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 21:21:33,123 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:21:33,123 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:21:33,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:21:33,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:21:33,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:21:33,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:21:33,125 INFO L87 Difference]: Start difference. First operand 50070 states and 208456 transitions. Second operand 3 states. [2019-12-27 21:21:33,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:21:33,321 INFO L93 Difference]: Finished difference Result 39280 states and 151115 transitions. [2019-12-27 21:21:33,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:21:33,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 21:21:33,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:21:33,535 INFO L225 Difference]: With dead ends: 39280 [2019-12-27 21:21:33,536 INFO L226 Difference]: Without dead ends: 39280 [2019-12-27 21:21:33,536 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 21:21:35,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39280 states. [2019-12-27 21:21:36,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39280 to 39280. [2019-12-27 21:21:36,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39280 states. [2019-12-27 21:21:36,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39280 states to 39280 states and 151115 transitions. [2019-12-27 21:21:36,787 INFO L78 Accepts]: Start accepts. Automaton has 39280 states and 151115 transitions. Word has length 15 [2019-12-27 21:21:36,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:21:36,788 INFO L462 AbstractCegarLoop]: Abstraction has 39280 states and 151115 transitions. [2019-12-27 21:21:36,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:21:36,788 INFO L276 IsEmpty]: Start isEmpty. Operand 39280 states and 151115 transitions. [2019-12-27 21:21:36,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:21:36,791 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:21:36,791 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:21:36,791 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:21:36,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:21:36,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1094107821, now seen corresponding path program 1 times [2019-12-27 21:21:36,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:21:36,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900771717] [2019-12-27 21:21:36,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:21:36,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:21:36,841 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 21:21:36,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900771717] [2019-12-27 21:21:36,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:21:36,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:21:36,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1317456122] [2019-12-27 21:21:36,842 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:21:36,844 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:21:36,847 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 28 transitions. [2019-12-27 21:21:36,847 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:21:36,847 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:21:36,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:21:36,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:21:36,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:21:36,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:21:36,848 INFO L87 Difference]: Start difference. First operand 39280 states and 151115 transitions. Second operand 4 states. [2019-12-27 21:21:36,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:21:36,921 INFO L93 Difference]: Finished difference Result 16344 states and 52151 transitions. [2019-12-27 21:21:36,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:21:36,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 21:21:36,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:21:36,951 INFO L225 Difference]: With dead ends: 16344 [2019-12-27 21:21:36,952 INFO L226 Difference]: Without dead ends: 16344 [2019-12-27 21:21:36,952 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 21:21:37,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16344 states. [2019-12-27 21:21:37,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16344 to 16344. [2019-12-27 21:21:37,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16344 states. [2019-12-27 21:21:37,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16344 states to 16344 states and 52151 transitions. [2019-12-27 21:21:37,277 INFO L78 Accepts]: Start accepts. Automaton has 16344 states and 52151 transitions. Word has length 16 [2019-12-27 21:21:37,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:21:37,277 INFO L462 AbstractCegarLoop]: Abstraction has 16344 states and 52151 transitions. [2019-12-27 21:21:37,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:21:37,277 INFO L276 IsEmpty]: Start isEmpty. Operand 16344 states and 52151 transitions. [2019-12-27 21:21:37,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 21:21:37,280 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:21:37,280 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:21:37,280 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:21:37,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:21:37,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1111128464, now seen corresponding path program 1 times [2019-12-27 21:21:37,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:21:37,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803796124] [2019-12-27 21:21:37,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:21:37,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:21:37,335 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 21:21:37,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803796124] [2019-12-27 21:21:37,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:21:37,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:21:37,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1738169888] [2019-12-27 21:21:37,337 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:21:37,338 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:21:37,342 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 37 transitions. [2019-12-27 21:21:37,342 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:21:37,358 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:21:37,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:21:37,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:21:37,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:21:37,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:21:37,360 INFO L87 Difference]: Start difference. First operand 16344 states and 52151 transitions. Second operand 6 states. [2019-12-27 21:21:37,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:21:37,416 INFO L93 Difference]: Finished difference Result 2799 states and 7236 transitions. [2019-12-27 21:21:37,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:21:37,417 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-27 21:21:37,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:21:37,422 INFO L225 Difference]: With dead ends: 2799 [2019-12-27 21:21:37,423 INFO L226 Difference]: Without dead ends: 2799 [2019-12-27 21:21:37,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:21:37,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2799 states. [2019-12-27 21:21:37,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2799 to 2799. [2019-12-27 21:21:37,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2799 states. [2019-12-27 21:21:37,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2799 states to 2799 states and 7236 transitions. [2019-12-27 21:21:37,465 INFO L78 Accepts]: Start accepts. Automaton has 2799 states and 7236 transitions. Word has length 17 [2019-12-27 21:21:37,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:21:37,466 INFO L462 AbstractCegarLoop]: Abstraction has 2799 states and 7236 transitions. [2019-12-27 21:21:37,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:21:37,466 INFO L276 IsEmpty]: Start isEmpty. Operand 2799 states and 7236 transitions. [2019-12-27 21:21:37,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 21:21:37,471 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:21:37,471 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] [2019-12-27 21:21:37,471 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:21:37,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:21:37,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1318629020, now seen corresponding path program 1 times [2019-12-27 21:21:37,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:21:37,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743697444] [2019-12-27 21:21:37,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:21:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:21:37,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:21:37,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743697444] [2019-12-27 21:21:37,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:21:37,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:21:37,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2095325817] [2019-12-27 21:21:37,540 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:21:37,544 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:21:37,576 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 273 transitions. [2019-12-27 21:21:37,577 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:21:37,626 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:21:37,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:21:37,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:21:37,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:21:37,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:21:37,627 INFO L87 Difference]: Start difference. First operand 2799 states and 7236 transitions. Second operand 8 states. [2019-12-27 21:21:37,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:21:37,691 INFO L93 Difference]: Finished difference Result 1357 states and 3888 transitions. [2019-12-27 21:21:37,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:21:37,692 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-12-27 21:21:37,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:21:37,697 INFO L225 Difference]: With dead ends: 1357 [2019-12-27 21:21:37,697 INFO L226 Difference]: Without dead ends: 1357 [2019-12-27 21:21:37,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:21:37,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2019-12-27 21:21:37,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1217. [2019-12-27 21:21:37,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-12-27 21:21:37,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 3488 transitions. [2019-12-27 21:21:37,719 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 3488 transitions. Word has length 29 [2019-12-27 21:21:37,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:21:37,719 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 3488 transitions. [2019-12-27 21:21:37,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:21:37,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 3488 transitions. [2019-12-27 21:21:37,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:21:37,726 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:21:37,726 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 21:21:37,727 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:21:37,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:21:37,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1789262397, now seen corresponding path program 1 times [2019-12-27 21:21:37,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:21:37,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817379783] [2019-12-27 21:21:37,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:21:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:21:37,872 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 21:21:37,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817379783] [2019-12-27 21:21:37,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:21:37,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:21:37,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [733412658] [2019-12-27 21:21:37,873 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:21:37,892 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:21:38,239 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 210 transitions. [2019-12-27 21:21:38,240 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:21:38,242 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:21:38,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:21:38,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:21:38,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:21:38,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:21:38,244 INFO L87 Difference]: Start difference. First operand 1217 states and 3488 transitions. Second operand 3 states. [2019-12-27 21:21:38,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:21:38,298 INFO L93 Difference]: Finished difference Result 1228 states and 3503 transitions. [2019-12-27 21:21:38,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:21:38,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 21:21:38,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:21:38,300 INFO L225 Difference]: With dead ends: 1228 [2019-12-27 21:21:38,300 INFO L226 Difference]: Without dead ends: 1228 [2019-12-27 21:21:38,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:21:38,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-12-27 21:21:38,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1222. [2019-12-27 21:21:38,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-12-27 21:21:38,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 3497 transitions. [2019-12-27 21:21:38,314 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 3497 transitions. Word has length 58 [2019-12-27 21:21:38,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:21:38,315 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 3497 transitions. [2019-12-27 21:21:38,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:21:38,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 3497 transitions. [2019-12-27 21:21:38,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:21:38,318 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:21:38,319 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 21:21:38,319 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:21:38,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:21:38,319 INFO L82 PathProgramCache]: Analyzing trace with hash -2131195958, now seen corresponding path program 1 times [2019-12-27 21:21:38,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:21:38,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98776463] [2019-12-27 21:21:38,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:21:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:21:38,431 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 21:21:38,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98776463] [2019-12-27 21:21:38,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:21:38,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:21:38,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1138524164] [2019-12-27 21:21:38,432 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:21:38,449 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:21:38,536 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 210 transitions. [2019-12-27 21:21:38,536 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:21:38,540 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:21:38,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:21:38,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:21:38,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:21:38,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:21:38,542 INFO L87 Difference]: Start difference. First operand 1222 states and 3497 transitions. Second operand 5 states. [2019-12-27 21:21:38,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:21:38,781 INFO L93 Difference]: Finished difference Result 1763 states and 5019 transitions. [2019-12-27 21:21:38,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:21:38,781 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-27 21:21:38,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:21:38,785 INFO L225 Difference]: With dead ends: 1763 [2019-12-27 21:21:38,785 INFO L226 Difference]: Without dead ends: 1763 [2019-12-27 21:21:38,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:21:38,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2019-12-27 21:21:38,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1418. [2019-12-27 21:21:38,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1418 states. [2019-12-27 21:21:38,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 4073 transitions. [2019-12-27 21:21:38,808 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 4073 transitions. Word has length 58 [2019-12-27 21:21:38,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:21:38,809 INFO L462 AbstractCegarLoop]: Abstraction has 1418 states and 4073 transitions. [2019-12-27 21:21:38,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:21:38,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 4073 transitions. [2019-12-27 21:21:38,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:21:38,812 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:21:38,812 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 21:21:38,812 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:21:38,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:21:38,812 INFO L82 PathProgramCache]: Analyzing trace with hash 831744802, now seen corresponding path program 2 times [2019-12-27 21:21:38,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:21:38,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467828048] [2019-12-27 21:21:38,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:21:38,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:21:38,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:21:38,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467828048] [2019-12-27 21:21:38,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:21:38,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:21:38,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [273246204] [2019-12-27 21:21:38,920 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:21:38,937 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:21:39,034 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 158 states and 242 transitions. [2019-12-27 21:21:39,034 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:21:39,133 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 21:21:39,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:21:39,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:21:39,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:21:39,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:21:39,134 INFO L87 Difference]: Start difference. First operand 1418 states and 4073 transitions. Second operand 10 states. [2019-12-27 21:21:41,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:21:41,075 INFO L93 Difference]: Finished difference Result 3066 states and 8447 transitions. [2019-12-27 21:21:41,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 21:21:41,077 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-12-27 21:21:41,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:21:41,082 INFO L225 Difference]: With dead ends: 3066 [2019-12-27 21:21:41,082 INFO L226 Difference]: Without dead ends: 3066 [2019-12-27 21:21:41,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2019-12-27 21:21:41,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3066 states. [2019-12-27 21:21:41,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3066 to 1502. [2019-12-27 21:21:41,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1502 states. [2019-12-27 21:21:41,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 4321 transitions. [2019-12-27 21:21:41,116 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 4321 transitions. Word has length 58 [2019-12-27 21:21:41,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:21:41,116 INFO L462 AbstractCegarLoop]: Abstraction has 1502 states and 4321 transitions. [2019-12-27 21:21:41,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:21:41,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 4321 transitions. [2019-12-27 21:21:41,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:21:41,120 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:21:41,121 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 21:21:41,121 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:21:41,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:21:41,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1828606006, now seen corresponding path program 3 times [2019-12-27 21:21:41,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:21:41,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884750334] [2019-12-27 21:21:41,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:21:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:21:41,228 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 21:21:41,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884750334] [2019-12-27 21:21:41,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:21:41,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:21:41,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1099682871] [2019-12-27 21:21:41,230 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:21:41,247 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:21:41,328 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 152 states and 232 transitions. [2019-12-27 21:21:41,328 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:21:41,400 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 21:21:41,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:21:41,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:21:41,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:21:41,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:21:41,401 INFO L87 Difference]: Start difference. First operand 1502 states and 4321 transitions. Second operand 6 states. [2019-12-27 21:21:41,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:21:41,765 INFO L93 Difference]: Finished difference Result 2376 states and 6757 transitions. [2019-12-27 21:21:41,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 21:21:41,765 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-27 21:21:41,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:21:41,769 INFO L225 Difference]: With dead ends: 2376 [2019-12-27 21:21:41,769 INFO L226 Difference]: Without dead ends: 2376 [2019-12-27 21:21:41,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:21:41,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2376 states. [2019-12-27 21:21:41,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2376 to 1690. [2019-12-27 21:21:41,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1690 states. [2019-12-27 21:21:41,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 4865 transitions. [2019-12-27 21:21:41,793 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 4865 transitions. Word has length 58 [2019-12-27 21:21:41,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:21:41,793 INFO L462 AbstractCegarLoop]: Abstraction has 1690 states and 4865 transitions. [2019-12-27 21:21:41,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:21:41,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 4865 transitions. [2019-12-27 21:21:41,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:21:41,797 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:21:41,798 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 21:21:41,798 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:21:41,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:21:41,798 INFO L82 PathProgramCache]: Analyzing trace with hash 361631606, now seen corresponding path program 4 times [2019-12-27 21:21:41,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:21:41,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111956820] [2019-12-27 21:21:41,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:21:41,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:21:41,935 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 21:21:41,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111956820] [2019-12-27 21:21:41,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:21:41,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:21:41,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [78162536] [2019-12-27 21:21:41,936 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:21:41,958 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:21:42,090 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 156 states and 239 transitions. [2019-12-27 21:21:42,090 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:21:42,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:21:42,229 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 21:21:42,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 21:21:42,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:21:42,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 21:21:42,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:21:42,231 INFO L87 Difference]: Start difference. First operand 1690 states and 4865 transitions. Second operand 13 states. [2019-12-27 21:21:44,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:21:44,195 INFO L93 Difference]: Finished difference Result 2256 states and 6059 transitions. [2019-12-27 21:21:44,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 21:21:44,201 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 58 [2019-12-27 21:21:44,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:21:44,204 INFO L225 Difference]: With dead ends: 2256 [2019-12-27 21:21:44,204 INFO L226 Difference]: Without dead ends: 2256 [2019-12-27 21:21:44,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=180, Invalid=522, Unknown=0, NotChecked=0, Total=702 [2019-12-27 21:21:44,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2256 states. [2019-12-27 21:21:44,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2256 to 1374. [2019-12-27 21:21:44,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1374 states. [2019-12-27 21:21:44,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 3861 transitions. [2019-12-27 21:21:44,223 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 3861 transitions. Word has length 58 [2019-12-27 21:21:44,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:21:44,224 INFO L462 AbstractCegarLoop]: Abstraction has 1374 states and 3861 transitions. [2019-12-27 21:21:44,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 21:21:44,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 3861 transitions. [2019-12-27 21:21:44,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 21:21:44,226 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:21:44,226 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 21:21:44,227 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:21:44,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:21:44,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1130563328, now seen corresponding path program 1 times [2019-12-27 21:21:44,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:21:44,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286235925] [2019-12-27 21:21:44,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:21:44,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:21:44,527 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 21:21:44,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286235925] [2019-12-27 21:21:44,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:21:44,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:21:44,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1341171658] [2019-12-27 21:21:44,528 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:21:44,592 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:21:44,724 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 163 states and 251 transitions. [2019-12-27 21:21:44,725 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:21:44,748 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:21:44,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 21:21:44,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:21:44,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 21:21:44,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:21:44,750 INFO L87 Difference]: Start difference. First operand 1374 states and 3861 transitions. Second operand 11 states. [2019-12-27 21:21:45,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:21:45,140 INFO L93 Difference]: Finished difference Result 2687 states and 7002 transitions. [2019-12-27 21:21:45,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 21:21:45,141 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-27 21:21:45,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:21:45,144 INFO L225 Difference]: With dead ends: 2687 [2019-12-27 21:21:45,145 INFO L226 Difference]: Without dead ends: 1885 [2019-12-27 21:21:45,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2019-12-27 21:21:45,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1885 states. [2019-12-27 21:21:45,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1885 to 1230. [2019-12-27 21:21:45,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1230 states. [2019-12-27 21:21:45,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 3374 transitions. [2019-12-27 21:21:45,161 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 3374 transitions. Word has length 59 [2019-12-27 21:21:45,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:21:45,161 INFO L462 AbstractCegarLoop]: Abstraction has 1230 states and 3374 transitions. [2019-12-27 21:21:45,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 21:21:45,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 3374 transitions. [2019-12-27 21:21:45,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 21:21:45,163 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:21:45,163 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 21:21:45,163 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:21:45,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:21:45,164 INFO L82 PathProgramCache]: Analyzing trace with hash -2124049444, now seen corresponding path program 2 times [2019-12-27 21:21:45,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:21:45,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270816786] [2019-12-27 21:21:45,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:21:45,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:21:45,227 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 21:21:45,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270816786] [2019-12-27 21:21:45,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:21:45,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:21:45,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [708623657] [2019-12-27 21:21:45,229 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:21:45,246 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:21:45,356 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 174 states and 279 transitions. [2019-12-27 21:21:45,356 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:21:45,357 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:21:45,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:21:45,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:21:45,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:21:45,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:21:45,358 INFO L87 Difference]: Start difference. First operand 1230 states and 3374 transitions. Second operand 3 states. [2019-12-27 21:21:45,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:21:45,616 INFO L93 Difference]: Finished difference Result 1229 states and 3372 transitions. [2019-12-27 21:21:45,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:21:45,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-27 21:21:45,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:21:45,619 INFO L225 Difference]: With dead ends: 1229 [2019-12-27 21:21:45,619 INFO L226 Difference]: Without dead ends: 1229 [2019-12-27 21:21:45,620 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 21:21:45,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2019-12-27 21:21:45,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 872. [2019-12-27 21:21:45,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2019-12-27 21:21:45,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 2378 transitions. [2019-12-27 21:21:45,633 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 2378 transitions. Word has length 59 [2019-12-27 21:21:45,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:21:45,634 INFO L462 AbstractCegarLoop]: Abstraction has 872 states and 2378 transitions. [2019-12-27 21:21:45,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:21:45,634 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 2378 transitions. [2019-12-27 21:21:45,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 21:21:45,635 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:21:45,635 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 21:21:45,635 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:21:45,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:21:45,635 INFO L82 PathProgramCache]: Analyzing trace with hash -916388173, now seen corresponding path program 1 times [2019-12-27 21:21:45,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:21:45,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482485390] [2019-12-27 21:21:45,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:21:45,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:21:45,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:21:45,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482485390] [2019-12-27 21:21:45,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:21:45,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:21:45,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [96163969] [2019-12-27 21:21:45,796 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:21:45,812 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:21:45,922 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 160 states and 248 transitions. [2019-12-27 21:21:45,923 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:21:45,944 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:21:45,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:21:45,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:21:45,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:21:45,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:21:45,948 INFO L87 Difference]: Start difference. First operand 872 states and 2378 transitions. Second operand 7 states. [2019-12-27 21:21:46,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:21:46,007 INFO L93 Difference]: Finished difference Result 1087 states and 2761 transitions. [2019-12-27 21:21:46,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:21:46,007 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-12-27 21:21:46,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:21:46,009 INFO L225 Difference]: With dead ends: 1087 [2019-12-27 21:21:46,009 INFO L226 Difference]: Without dead ends: 631 [2019-12-27 21:21:46,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:21:46,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-12-27 21:21:46,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 631. [2019-12-27 21:21:46,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-12-27 21:21:46,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 1509 transitions. [2019-12-27 21:21:46,017 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 1509 transitions. Word has length 59 [2019-12-27 21:21:46,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:21:46,017 INFO L462 AbstractCegarLoop]: Abstraction has 631 states and 1509 transitions. [2019-12-27 21:21:46,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:21:46,017 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 1509 transitions. [2019-12-27 21:21:46,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 21:21:46,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:21:46,018 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 21:21:46,018 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:21:46,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:21:46,018 INFO L82 PathProgramCache]: Analyzing trace with hash -983573057, now seen corresponding path program 2 times [2019-12-27 21:21:46,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:21:46,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492372773] [2019-12-27 21:21:46,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:21:46,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:21:46,150 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 21:21:46,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492372773] [2019-12-27 21:21:46,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:21:46,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:21:46,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1838202377] [2019-12-27 21:21:46,152 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:21:46,167 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:21:46,281 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 147 states and 246 transitions. [2019-12-27 21:21:46,282 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:21:46,311 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:21:46,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:21:46,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:21:46,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:21:46,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:21:46,313 INFO L87 Difference]: Start difference. First operand 631 states and 1509 transitions. Second operand 7 states. [2019-12-27 21:21:46,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:21:46,575 INFO L93 Difference]: Finished difference Result 1105 states and 2541 transitions. [2019-12-27 21:21:46,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 21:21:46,575 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-12-27 21:21:46,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:21:46,576 INFO L225 Difference]: With dead ends: 1105 [2019-12-27 21:21:46,576 INFO L226 Difference]: Without dead ends: 326 [2019-12-27 21:21:46,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:21:46,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-12-27 21:21:46,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 239. [2019-12-27 21:21:46,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-12-27 21:21:46,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 419 transitions. [2019-12-27 21:21:46,584 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 419 transitions. Word has length 59 [2019-12-27 21:21:46,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:21:46,584 INFO L462 AbstractCegarLoop]: Abstraction has 239 states and 419 transitions. [2019-12-27 21:21:46,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:21:46,585 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 419 transitions. [2019-12-27 21:21:46,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 21:21:46,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:21:46,586 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 21:21:46,586 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:21:46,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:21:46,586 INFO L82 PathProgramCache]: Analyzing trace with hash 851087049, now seen corresponding path program 3 times [2019-12-27 21:21:46,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:21:46,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631492977] [2019-12-27 21:21:46,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:21:46,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:21:46,679 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 21:21:46,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631492977] [2019-12-27 21:21:46,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:21:46,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:21:46,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [102159772] [2019-12-27 21:21:46,680 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:21:46,699 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:21:46,804 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 147 states and 222 transitions. [2019-12-27 21:21:46,804 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:21:46,818 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:21:46,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:21:46,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:21:46,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:21:46,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:21:46,819 INFO L87 Difference]: Start difference. First operand 239 states and 419 transitions. Second operand 4 states. [2019-12-27 21:21:46,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:21:46,933 INFO L93 Difference]: Finished difference Result 260 states and 443 transitions. [2019-12-27 21:21:46,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:21:46,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-27 21:21:46,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:21:46,934 INFO L225 Difference]: With dead ends: 260 [2019-12-27 21:21:46,934 INFO L226 Difference]: Without dead ends: 260 [2019-12-27 21:21:46,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 21:21:46,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-12-27 21:21:46,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 220. [2019-12-27 21:21:46,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-12-27 21:21:46,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 379 transitions. [2019-12-27 21:21:46,938 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 379 transitions. Word has length 59 [2019-12-27 21:21:46,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:21:46,939 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 379 transitions. [2019-12-27 21:21:46,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:21:46,939 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 379 transitions. [2019-12-27 21:21:46,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 21:21:46,940 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:21:46,940 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:21:46,940 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:21:46,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:21:46,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1833326427, now seen corresponding path program 1 times [2019-12-27 21:21:46,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:21:46,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646546369] [2019-12-27 21:21:46,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:21:46,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:21:47,224 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 21:21:47,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646546369] [2019-12-27 21:21:47,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:21:47,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 21:21:47,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1887349434] [2019-12-27 21:21:47,225 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:21:47,247 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:21:47,645 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 181 states and 298 transitions. [2019-12-27 21:21:47,645 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:21:47,756 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 21:21:47,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 21:21:47,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:21:47,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 21:21:47,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-27 21:21:47,757 INFO L87 Difference]: Start difference. First operand 220 states and 379 transitions. Second operand 14 states. [2019-12-27 21:21:49,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:21:49,071 INFO L93 Difference]: Finished difference Result 449 states and 750 transitions. [2019-12-27 21:21:49,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 21:21:49,072 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-12-27 21:21:49,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:21:49,072 INFO L225 Difference]: With dead ends: 449 [2019-12-27 21:21:49,073 INFO L226 Difference]: Without dead ends: 418 [2019-12-27 21:21:49,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=199, Invalid=857, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 21:21:49,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-12-27 21:21:49,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 328. [2019-12-27 21:21:49,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-27 21:21:49,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 564 transitions. [2019-12-27 21:21:49,078 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 564 transitions. Word has length 60 [2019-12-27 21:21:49,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:21:49,079 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 564 transitions. [2019-12-27 21:21:49,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 21:21:49,079 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 564 transitions. [2019-12-27 21:21:49,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 21:21:49,079 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:21:49,079 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:21:49,080 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:21:49,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:21:49,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1060183003, now seen corresponding path program 2 times [2019-12-27 21:21:49,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:21:49,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483407048] [2019-12-27 21:21:49,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:21:49,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:21:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:21:49,197 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:21:49,198 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:21:49,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] ULTIMATE.startENTRY-->L833: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 v_~z$r_buff1_thd0~0_47) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t1229~0.base_19| 4)) (= 0 v_~a~0_9) (= v_~x~0_11 0) (= 0 v_~__unbuffered_p3_EAX~0_10) (= |v_#NULL.offset_7| 0) (= v_~z$r_buff0_thd3~0_20 0) (= v_~z$mem_tmp~0_11 0) (= v_~z$r_buff0_thd1~0_8 0) (= v_~z$r_buff1_thd1~0_8 0) (< 0 |v_#StackHeapBarrier_21|) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1229~0.base_19| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1229~0.base_19|) |v_ULTIMATE.start_main_~#t1229~0.offset_16| 0)) |v_#memory_int_25|) (= 0 v_~z$r_buff1_thd4~0_16) (= v_~z$r_buff1_thd2~0_9 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1229~0.base_19| 1) |v_#valid_70|) (= |v_ULTIMATE.start_main_~#t1229~0.offset_16| 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~b~0_11 0) (= 0 v_~z$w_buff1~0_22) (= 0 v_~z$flush_delayed~0_16) (= v_~z$w_buff0_used~0_105 0) (= 0 v_~z$w_buff1_used~0_62) (= v_~z$r_buff0_thd4~0_24 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1229~0.base_19|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~weak$$choice0~0_7) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~__unbuffered_cnt~0_27) (= 0 v_~__unbuffered_p0_EAX~0_11) (= 0 |v_#NULL.base_7|) (= v_~z~0_27 0) (= v_~z$r_buff0_thd0~0_80 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1229~0.base_19|) 0) (= v_~z$r_buff0_thd2~0_9 0) (= v_~y~0_10 0) (= 0 v_~z$w_buff0~0_25) (= v_~main$tmp_guard1~0_12 0) (= 0 v_~z$r_buff1_thd3~0_17) (= 0 v_~__unbuffered_p3_EBX~0_10))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_26|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_12|, ULTIMATE.start_main_~#t1230~0.offset=|v_ULTIMATE.start_main_~#t1230~0.offset_17|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_9, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_10|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_15|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_12|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_16|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_16|, ~a~0=v_~a~0_9, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_80, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ULTIMATE.start_main_~#t1231~0.base=|v_ULTIMATE.start_main_~#t1231~0.base_21|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_24, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, #length=|v_#length_29|, ~z$mem_tmp~0=v_~z$mem_tmp~0_11, ULTIMATE.start_main_~#t1229~0.base=|v_ULTIMATE.start_main_~#t1229~0.base_19|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_15|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_62, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_12|, ~z$flush_delayed~0=v_~z$flush_delayed~0_16, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_12|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_15|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_8, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_20, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, ~x~0=v_~x~0_11, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_16, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_13|, ULTIMATE.start_main_~#t1230~0.base=|v_ULTIMATE.start_main_~#t1230~0.base_22|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_14|, ~z$w_buff1~0=v_~z$w_buff1~0_22, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_12|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_17|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_10|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_14|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_15|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_47, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_8|, ~y~0=v_~y~0_10, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_9, ULTIMATE.start_main_~#t1229~0.offset=|v_ULTIMATE.start_main_~#t1229~0.offset_16|, ULTIMATE.start_main_~#t1232~0.base=|v_ULTIMATE.start_main_~#t1232~0.base_22|, ULTIMATE.start_main_~#t1232~0.offset=|v_ULTIMATE.start_main_~#t1232~0.offset_17|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_105, ~z$w_buff0~0=v_~z$w_buff0~0_25, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_12|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_17, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_13|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ULTIMATE.start_main_~#t1231~0.offset=|v_ULTIMATE.start_main_~#t1231~0.offset_16|, ~b~0=v_~b~0_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_14|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_8|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1230~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1231~0.base, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_~#t1229~0.base, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t1230~0.base, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1229~0.offset, ULTIMATE.start_main_~#t1232~0.base, ULTIMATE.start_main_~#t1232~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1231~0.offset, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:21:49,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L833-1-->L835: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1230~0.offset_11|) (not (= |v_ULTIMATE.start_main_~#t1230~0.base_13| 0)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1230~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1230~0.base_13|) |v_ULTIMATE.start_main_~#t1230~0.offset_11| 1)) |v_#memory_int_19|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1230~0.base_13| 4)) (= (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1230~0.base_13| 1) |v_#valid_48|) (= (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1230~0.base_13|) 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1230~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t1230~0.offset=|v_ULTIMATE.start_main_~#t1230~0.offset_11|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t1230~0.base=|v_ULTIMATE.start_main_~#t1230~0.base_13|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1230~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1230~0.base, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-27 21:21:49,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L835-1-->L837: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1231~0.base_12|)) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1231~0.base_12|) 0) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1231~0.base_12| 1) |v_#valid_46|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1231~0.base_12| 4)) (= 0 |v_ULTIMATE.start_main_~#t1231~0.offset_10|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1231~0.base_12|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1231~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1231~0.base_12|) |v_ULTIMATE.start_main_~#t1231~0.offset_10| 2)) |v_#memory_int_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1231~0.base=|v_ULTIMATE.start_main_~#t1231~0.base_12|, ULTIMATE.start_main_~#t1231~0.offset=|v_ULTIMATE.start_main_~#t1231~0.offset_10|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1231~0.base, ULTIMATE.start_main_~#t1231~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-27 21:21:49,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L837-1-->L839: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1232~0.base_12| 4)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t1232~0.base_12|)) (= (store |v_#valid_40| |v_ULTIMATE.start_main_~#t1232~0.base_12| 1) |v_#valid_39|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1232~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1232~0.base_12|) |v_ULTIMATE.start_main_~#t1232~0.offset_10| 3)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t1232~0.offset_10|) (not (= 0 |v_ULTIMATE.start_main_~#t1232~0.base_12|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1232~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1232~0.base=|v_ULTIMATE.start_main_~#t1232~0.base_12|, ULTIMATE.start_main_~#t1232~0.offset=|v_ULTIMATE.start_main_~#t1232~0.offset_10|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1232~0.base, ULTIMATE.start_main_~#t1232~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-27 21:21:49,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L4-->L810: Formula: (and (= v_~__unbuffered_p3_EBX~0_4 v_~b~0_4) (not (= 0 v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8)) (= v_~__unbuffered_p3_EAX~0_4 v_~a~0_3) (= v_~z$r_buff1_thd1~0_3 v_~z$r_buff0_thd1~0_3) (= v_~z$r_buff1_thd2~0_4 v_~z$r_buff0_thd2~0_4) (= 1 v_~a~0_3) (= v_~z$r_buff0_thd4~0_15 1) (= v_~z$r_buff0_thd4~0_16 v_~z$r_buff1_thd4~0_10) (= v_~z$r_buff0_thd3~0_15 v_~z$r_buff1_thd3~0_11) (= v_~z$r_buff0_thd0~0_46 v_~z$r_buff1_thd0~0_26)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_46, ~b~0=v_~b~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_16, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_15, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_10, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_11, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_4, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_4, ~a~0=v_~a~0_3, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_46, ~b~0=v_~b~0_4, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_26, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_15, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-27 21:21:49,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= 1 v_~b~0_7) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_p0_EAX~0_7 v_~x~0_6) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_6} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~b~0=v_~b~0_7, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, ~x~0=v_~x~0_6, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 21:21:49,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] P1ENTRY-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_23 1) v_~__unbuffered_cnt~0_22) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= 1 v_~y~0_6) (= 1 v_~x~0_7) (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y~0=v_~y~0_6, ~x~0=v_~x~0_7, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~y~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 21:21:49,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In888594691 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In888594691 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In888594691 |P3Thread1of1ForFork3_#t~ite11_Out888594691|)) (and (not .cse1) (not .cse0) (= 0 |P3Thread1of1ForFork3_#t~ite11_Out888594691|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In888594691, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In888594691} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In888594691, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In888594691, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out888594691|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-27 21:21:49,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L774-2-->L774-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In1462405451 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1462405451 256)))) (or (and (or .cse0 .cse1) (= ~z~0_In1462405451 |P2Thread1of1ForFork2_#t~ite3_Out1462405451|)) (and (not .cse0) (= ~z$w_buff1~0_In1462405451 |P2Thread1of1ForFork2_#t~ite3_Out1462405451|) (not .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1462405451, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1462405451, ~z$w_buff1~0=~z$w_buff1~0_In1462405451, ~z~0=~z~0_In1462405451} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out1462405451|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1462405451, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1462405451, ~z$w_buff1~0=~z$w_buff1~0_In1462405451, ~z~0=~z~0_In1462405451} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 21:21:49,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L812-->L812-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1694259280 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1694259280 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1694259280 256))) (.cse2 (= (mod ~z$r_buff1_thd4~0_In1694259280 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1694259280 |P3Thread1of1ForFork3_#t~ite12_Out1694259280|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P3Thread1of1ForFork3_#t~ite12_Out1694259280|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1694259280, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1694259280, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1694259280, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1694259280} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1694259280, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1694259280, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1694259280, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1694259280, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out1694259280|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-27 21:21:49,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L813-->L814: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In831070320 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In831070320 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out831070320 ~z$r_buff0_thd4~0_In831070320)) (and (not .cse1) (= ~z$r_buff0_thd4~0_Out831070320 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In831070320, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In831070320} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In831070320, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out831070320, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out831070320|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-27 21:21:49,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L814-->L814-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-735295765 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-735295765 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-735295765 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-735295765 256) 0))) (or (and (= |P3Thread1of1ForFork3_#t~ite14_Out-735295765| ~z$r_buff1_thd4~0_In-735295765) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P3Thread1of1ForFork3_#t~ite14_Out-735295765| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-735295765, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-735295765, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-735295765, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-735295765} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-735295765, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-735295765, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out-735295765|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-735295765, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-735295765} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-27 21:21:49,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L814-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#t~ite14_8| v_~z$r_buff1_thd4~0_11) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_11, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_7|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-27 21:21:49,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L774-4-->L775: Formula: (= v_~z~0_20 |v_P2Thread1of1ForFork2_#t~ite3_8|) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_8|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_7|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_7|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-27 21:21:49,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1013789311 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-1013789311 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite5_Out-1013789311| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite5_Out-1013789311| ~z$w_buff0_used~0_In-1013789311)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1013789311, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1013789311} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out-1013789311|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1013789311, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1013789311} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 21:21:49,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L776-->L776-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In1982539865 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1982539865 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1982539865 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In1982539865 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite6_Out1982539865| 0)) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite6_Out1982539865| ~z$w_buff1_used~0_In1982539865) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1982539865, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1982539865, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1982539865, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1982539865} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out1982539865|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1982539865, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1982539865, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1982539865, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1982539865} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 21:21:49,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In2008321092 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In2008321092 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite7_Out2008321092| ~z$r_buff0_thd3~0_In2008321092) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite7_Out2008321092| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2008321092, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2008321092} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2008321092, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2008321092, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out2008321092|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 21:21:49,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In2004957988 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In2004957988 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In2004957988 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In2004957988 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite8_Out2004957988| ~z$r_buff1_thd3~0_In2004957988) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork2_#t~ite8_Out2004957988| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2004957988, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2004957988, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2004957988, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2004957988} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2004957988, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2004957988, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2004957988, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2004957988, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out2004957988|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 21:21:49,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L778-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= v_~z$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork2_#t~ite8_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_8|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_12, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_7|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 21:21:49,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L839-1-->L845: Formula: (and (= 4 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_4|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-27 21:21:49,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L845-2-->L845-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In288131985 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In288131985 256)))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In288131985 |ULTIMATE.start_main_#t~ite19_Out288131985|)) (and (or .cse1 .cse0) (= ~z~0_In288131985 |ULTIMATE.start_main_#t~ite19_Out288131985|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In288131985, ~z$w_buff1_used~0=~z$w_buff1_used~0_In288131985, ~z$w_buff1~0=~z$w_buff1~0_In288131985, ~z~0=~z~0_In288131985} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out288131985|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In288131985, ~z$w_buff1_used~0=~z$w_buff1_used~0_In288131985, ~z$w_buff1~0=~z$w_buff1~0_In288131985, ~z~0=~z~0_In288131985} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 21:21:49,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L845-4-->L846: Formula: (= v_~z~0_16 |v_ULTIMATE.start_main_#t~ite19_7|) InVars {ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_7|} OutVars{ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_6|, ~z~0=v_~z~0_16, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ~z~0, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 21:21:49,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L846-->L846-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1562016169 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1562016169 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-1562016169| ~z$w_buff0_used~0_In-1562016169)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-1562016169| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1562016169, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1562016169} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1562016169, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1562016169, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1562016169|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 21:21:49,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L847-->L847-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In989283393 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In989283393 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In989283393 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In989283393 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In989283393 |ULTIMATE.start_main_#t~ite22_Out989283393|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite22_Out989283393|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In989283393, ~z$w_buff0_used~0=~z$w_buff0_used~0_In989283393, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In989283393, ~z$w_buff1_used~0=~z$w_buff1_used~0_In989283393} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In989283393, ~z$w_buff0_used~0=~z$w_buff0_used~0_In989283393, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In989283393, ~z$w_buff1_used~0=~z$w_buff1_used~0_In989283393, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out989283393|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 21:21:49,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L848-->L848-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1801649078 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1801649078 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite23_Out-1801649078| 0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-1801649078 |ULTIMATE.start_main_#t~ite23_Out-1801649078|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1801649078, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1801649078} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1801649078, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1801649078, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1801649078|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 21:21:49,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L849-->L849-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd0~0_In-651154372 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-651154372 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-651154372 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-651154372 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite24_Out-651154372|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In-651154372 |ULTIMATE.start_main_#t~ite24_Out-651154372|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-651154372, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-651154372, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-651154372, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-651154372} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-651154372, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-651154372, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-651154372, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-651154372|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-651154372} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-27 21:21:49,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L860-->L860-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-192142972 256)))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out-192142972| ~z$w_buff1_used~0_In-192142972) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-192142972 256) 0))) (or (= (mod ~z$w_buff0_used~0_In-192142972 256) 0) (and (= 0 (mod ~z$r_buff1_thd0~0_In-192142972 256)) .cse1) (and (= (mod ~z$w_buff1_used~0_In-192142972 256) 0) .cse1))) (= |ULTIMATE.start_main_#t~ite39_Out-192142972| |ULTIMATE.start_main_#t~ite40_Out-192142972|)) (and (= ~z$w_buff1_used~0_In-192142972 |ULTIMATE.start_main_#t~ite40_Out-192142972|) (= |ULTIMATE.start_main_#t~ite39_In-192142972| |ULTIMATE.start_main_#t~ite39_Out-192142972|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-192142972, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-192142972, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In-192142972|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-192142972, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-192142972, ~weak$$choice2~0=~weak$$choice2~0_In-192142972} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-192142972, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-192142972|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-192142972|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-192142972, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-192142972, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-192142972, ~weak$$choice2~0=~weak$$choice2~0_In-192142972} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 21:21:49,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L861-->L862: Formula: (and (= v_~z$r_buff0_thd0~0_59 v_~z$r_buff0_thd0~0_60) (not (= (mod v_~weak$$choice2~0_18 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_18} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_59, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_8|, ~weak$$choice2~0=v_~weak$$choice2~0_18, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 21:21:49,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L862-->L862-8: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite46_Out315174509| |ULTIMATE.start_main_#t~ite45_Out315174509|)) (.cse4 (= 0 (mod ~z$w_buff0_used~0_In315174509 256))) (.cse0 (= 0 (mod ~weak$$choice2~0_In315174509 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In315174509 256))) (.cse5 (= 0 (mod ~z$w_buff1_used~0_In315174509 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In315174509 256)))) (or (and (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite46_Out315174509| ~z$r_buff1_thd0~0_In315174509) (= |ULTIMATE.start_main_#t~ite45_Out315174509| |ULTIMATE.start_main_#t~ite45_In315174509|)) (and .cse1 (or (and .cse2 .cse3) .cse4 (and .cse2 .cse5)) .cse0 (= |ULTIMATE.start_main_#t~ite45_Out315174509| ~z$r_buff1_thd0~0_In315174509))) (= |ULTIMATE.start_main_#t~ite44_In315174509| |ULTIMATE.start_main_#t~ite44_Out315174509|)) (let ((.cse6 (not .cse2))) (and (= |ULTIMATE.start_main_#t~ite44_Out315174509| 0) .cse1 (not .cse4) .cse0 (= |ULTIMATE.start_main_#t~ite45_Out315174509| |ULTIMATE.start_main_#t~ite44_Out315174509|) (or (not .cse3) .cse6) (or (not .cse5) .cse6))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In315174509, ~z$w_buff0_used~0=~z$w_buff0_used~0_In315174509, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In315174509, ~z$w_buff1_used~0=~z$w_buff1_used~0_In315174509, ~weak$$choice2~0=~weak$$choice2~0_In315174509, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In315174509|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In315174509|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In315174509, ~z$w_buff0_used~0=~z$w_buff0_used~0_In315174509, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In315174509, ~z$w_buff1_used~0=~z$w_buff1_used~0_In315174509, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out315174509|, ~weak$$choice2~0=~weak$$choice2~0_In315174509, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out315174509|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out315174509|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 21:21:49,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L864-->L4: Formula: (and (= 0 v_~z$flush_delayed~0_11) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (not (= 0 (mod v_~z$flush_delayed~0_12 256))) (= v_~z~0_23 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_12} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_11, ~z~0=v_~z~0_23, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:21:49,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 21:21:49,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:21:49 BasicIcfg [2019-12-27 21:21:49,322 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:21:49,324 INFO L168 Benchmark]: Toolchain (without parser) took 36337.58 ms. Allocated memory was 139.5 MB in the beginning and 1.7 GB in the end (delta: 1.6 GB). Free memory was 103.1 MB in the beginning and 728.2 MB in the end (delta: -625.1 MB). Peak memory consumption was 941.0 MB. Max. memory is 7.1 GB. [2019-12-27 21:21:49,325 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 21:21:49,326 INFO L168 Benchmark]: CACSL2BoogieTranslator took 755.54 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 102.7 MB in the beginning and 155.7 MB in the end (delta: -53.0 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-12-27 21:21:49,326 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.63 ms. Allocated memory is still 202.4 MB. Free memory was 155.7 MB in the beginning and 152.5 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-27 21:21:49,327 INFO L168 Benchmark]: Boogie Preprocessor took 37.69 ms. Allocated memory is still 202.4 MB. Free memory was 152.5 MB in the beginning and 149.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:21:49,328 INFO L168 Benchmark]: RCFGBuilder took 864.55 ms. Allocated memory is still 202.4 MB. Free memory was 149.9 MB in the beginning and 100.6 MB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. [2019-12-27 21:21:49,328 INFO L168 Benchmark]: TraceAbstraction took 34602.69 ms. Allocated memory was 202.4 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 100.6 MB in the beginning and 728.2 MB in the end (delta: -627.5 MB). Peak memory consumption was 875.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:21:49,332 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.22 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 755.54 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 102.7 MB in the beginning and 155.7 MB in the end (delta: -53.0 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.63 ms. Allocated memory is still 202.4 MB. Free memory was 155.7 MB in the beginning and 152.5 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.69 ms. Allocated memory is still 202.4 MB. Free memory was 152.5 MB in the beginning and 149.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 864.55 ms. Allocated memory is still 202.4 MB. Free memory was 149.9 MB in the beginning and 100.6 MB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 34602.69 ms. Allocated memory was 202.4 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 100.6 MB in the beginning and 728.2 MB in the end (delta: -627.5 MB). Peak memory consumption was 875.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.3s, 181 ProgramPointsBefore, 93 ProgramPointsAfterwards, 209 TransitionsBefore, 100 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 26 ChoiceCompositions, 4801 VarBasedMoverChecksPositive, 172 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 54567 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L833] FCALL, FORK 0 pthread_create(&t1229, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] FCALL, FORK 0 pthread_create(&t1230, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1231, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t1232, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L788] 4 z$w_buff1 = z$w_buff0 [L789] 4 z$w_buff0 = 2 [L790] 4 z$w_buff1_used = z$w_buff0_used [L791] 4 z$w_buff0_used = (_Bool)1 [L810] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 y = 2 [L771] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L774] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L812] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L775] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L776] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L777] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L845] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_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}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L847] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L848] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L849] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L852] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L853] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L854] 0 z$flush_delayed = weak$$choice2 [L855] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_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}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_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}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L857] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_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}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L858] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_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}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L859] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_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}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L859] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L860] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_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}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 34.3s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2070 SDtfs, 2873 SDslu, 6358 SDs, 0 SdLazy, 4292 SolverSat, 281 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 256 GetRequests, 88 SyntacticMatches, 23 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50070occurred 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: 11.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 10888 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 806 NumberOfCodeBlocks, 806 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 729 ConstructedInterpolants, 0 QuantifiedInterpolants, 142081 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...