/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-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-atomic/lamport.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 15:13:02,597 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 15:13:02,600 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 15:13:02,618 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 15:13:02,618 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 15:13:02,620 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 15:13:02,622 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 15:13:02,632 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 15:13:02,636 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 15:13:02,639 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 15:13:02,641 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 15:13:02,642 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 15:13:02,643 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 15:13:02,644 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 15:13:02,646 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 15:13:02,648 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 15:13:02,649 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 15:13:02,652 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 15:13:02,653 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 15:13:02,657 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 15:13:02,661 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 15:13:02,664 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 15:13:02,666 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 15:13:02,666 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 15:13:02,669 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 15:13:02,669 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 15:13:02,669 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 15:13:02,671 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 15:13:02,672 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 15:13:02,673 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 15:13:02,673 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 15:13:02,675 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 15:13:02,676 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 15:13:02,677 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 15:13:02,678 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 15:13:02,679 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 15:13:02,680 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 15:13:02,680 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 15:13:02,680 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 15:13:02,682 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 15:13:02,683 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 15:13:02,684 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-SemanticLbe-MCR.epf [2019-12-27 15:13:02,716 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 15:13:02,716 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 15:13:02,723 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 15:13:02,723 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 15:13:02,723 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 15:13:02,723 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 15:13:02,724 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 15:13:02,724 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 15:13:02,724 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 15:13:02,724 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 15:13:02,724 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 15:13:02,725 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 15:13:02,725 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 15:13:02,725 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 15:13:02,725 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 15:13:02,725 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 15:13:02,725 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 15:13:02,726 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 15:13:02,726 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 15:13:02,726 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 15:13:02,726 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 15:13:02,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 15:13:02,727 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 15:13:02,728 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 15:13:02,728 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 15:13:02,728 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 15:13:02,728 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 15:13:02,728 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 15:13:02,728 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 15:13:02,729 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 15:13:02,729 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 15:13:03,037 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 15:13:03,058 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 15:13:03,062 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 15:13:03,064 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 15:13:03,065 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 15:13:03,067 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/lamport.i [2019-12-27 15:13:03,149 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89ca1480d/702798df437647fa84fa0ecf295e7f85/FLAG21b3dc814 [2019-12-27 15:13:03,722 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 15:13:03,722 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/lamport.i [2019-12-27 15:13:03,736 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89ca1480d/702798df437647fa84fa0ecf295e7f85/FLAG21b3dc814 [2019-12-27 15:13:04,005 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89ca1480d/702798df437647fa84fa0ecf295e7f85 [2019-12-27 15:13:04,014 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 15:13:04,016 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 15:13:04,017 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 15:13:04,017 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 15:13:04,021 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 15:13:04,022 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:13:04" (1/1) ... [2019-12-27 15:13:04,027 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fe231b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:13:04, skipping insertion in model container [2019-12-27 15:13:04,027 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:13:04" (1/1) ... [2019-12-27 15:13:04,038 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 15:13:04,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 15:13:04,655 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:13:04,674 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 15:13:04,730 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:13:04,830 INFO L208 MainTranslator]: Completed translation [2019-12-27 15:13:04,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:13:04 WrapperNode [2019-12-27 15:13:04,831 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 15:13:04,832 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 15:13:04,832 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 15:13:04,832 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 15:13:04,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:13:04" (1/1) ... [2019-12-27 15:13:04,880 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:13:04" (1/1) ... [2019-12-27 15:13:04,905 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 15:13:04,905 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 15:13:04,905 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 15:13:04,905 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 15:13:04,915 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:13:04" (1/1) ... [2019-12-27 15:13:04,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:13:04" (1/1) ... [2019-12-27 15:13:04,926 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:13:04" (1/1) ... [2019-12-27 15:13:04,926 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:13:04" (1/1) ... [2019-12-27 15:13:04,946 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:13:04" (1/1) ... [2019-12-27 15:13:04,956 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:13:04" (1/1) ... [2019-12-27 15:13:04,963 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:13:04" (1/1) ... [2019-12-27 15:13:04,972 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 15:13:04,974 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 15:13:04,975 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 15:13:04,975 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 15:13:04,976 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:13:04" (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 15:13:05,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-27 15:13:05,043 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2019-12-27 15:13:05,043 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2019-12-27 15:13:05,043 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-12-27 15:13:05,043 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-12-27 15:13:05,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 15:13:05,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 15:13:05,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 15:13:05,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 15:13:05,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 15:13:05,046 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 15:13:05,492 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 15:13:05,493 INFO L287 CfgBuilder]: Removed 12 assume(true) statements. [2019-12-27 15:13:05,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:13:05 BoogieIcfgContainer [2019-12-27 15:13:05,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 15:13:05,497 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 15:13:05,497 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 15:13:05,500 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 15:13:05,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:13:04" (1/3) ... [2019-12-27 15:13:05,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48596975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:13:05, skipping insertion in model container [2019-12-27 15:13:05,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:13:04" (2/3) ... [2019-12-27 15:13:05,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48596975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:13:05, skipping insertion in model container [2019-12-27 15:13:05,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:13:05" (3/3) ... [2019-12-27 15:13:05,508 INFO L109 eAbstractionObserver]: Analyzing ICFG lamport.i [2019-12-27 15:13:05,516 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 15:13:05,516 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 15:13:05,527 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 15:13:05,528 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 15:13:05,563 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork1_#in~_.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:05,563 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork1_#in~_.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:05,564 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork1_~_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:05,564 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork1_~_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:05,565 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:05,565 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:05,566 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~_.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:05,566 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~_.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:05,566 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:05,567 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:05,567 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:05,567 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:05,571 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:05,572 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:05,572 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:05,572 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:05,578 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork1_~_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:05,579 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:05,579 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:05,579 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork1_~_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:13:05,599 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 15:13:05,618 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 15:13:05,618 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 15:13:05,618 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 15:13:05,618 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 15:13:05,619 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 15:13:05,619 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 15:13:05,619 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 15:13:05,619 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 15:13:05,635 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 103 transitions [2019-12-27 15:13:05,637 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 84 places, 103 transitions [2019-12-27 15:13:05,699 INFO L132 PetriNetUnfolder]: 25/103 cut-off events. [2019-12-27 15:13:05,700 INFO L133 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2019-12-27 15:13:05,711 INFO L76 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 103 events. 25/103 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 205 event pairs. 0/77 useless extension candidates. Maximal degree in co-relation 79. Up to 5 conditions per place. [2019-12-27 15:13:05,719 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 84 places, 103 transitions [2019-12-27 15:13:05,746 INFO L132 PetriNetUnfolder]: 25/103 cut-off events. [2019-12-27 15:13:05,746 INFO L133 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2019-12-27 15:13:05,749 INFO L76 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 103 events. 25/103 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 205 event pairs. 0/77 useless extension candidates. Maximal degree in co-relation 79. Up to 5 conditions per place. [2019-12-27 15:13:05,755 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 3196 [2019-12-27 15:13:05,757 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 15:13:07,208 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-12-27 15:13:07,306 INFO L206 etLargeBlockEncoding]: Checked pairs total: 9503 [2019-12-27 15:13:07,306 INFO L214 etLargeBlockEncoding]: Total number of compositions: 44 [2019-12-27 15:13:07,309 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 63 transitions [2019-12-27 15:13:07,366 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 719 states. [2019-12-27 15:13:07,368 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states. [2019-12-27 15:13:07,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-27 15:13:07,375 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:07,376 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-27 15:13:07,376 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:07,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:07,383 INFO L82 PathProgramCache]: Analyzing trace with hash 14012195, now seen corresponding path program 1 times [2019-12-27 15:13:07,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:07,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730451779] [2019-12-27 15:13:07,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:07,538 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 15:13:07,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730451779] [2019-12-27 15:13:07,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:13:07,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:13:07,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1433201157] [2019-12-27 15:13:07,542 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:07,547 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:07,559 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 5 states and 4 transitions. [2019-12-27 15:13:07,560 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:07,563 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:13:07,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-27 15:13:07,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:07,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-27 15:13:07,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-27 15:13:07,578 INFO L87 Difference]: Start difference. First operand 719 states. Second operand 2 states. [2019-12-27 15:13:07,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:07,617 INFO L93 Difference]: Finished difference Result 719 states and 2103 transitions. [2019-12-27 15:13:07,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-27 15:13:07,619 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 4 [2019-12-27 15:13:07,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:07,652 INFO L225 Difference]: With dead ends: 719 [2019-12-27 15:13:07,653 INFO L226 Difference]: Without dead ends: 680 [2019-12-27 15:13:07,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-27 15:13:07,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2019-12-27 15:13:07,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 680. [2019-12-27 15:13:07,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2019-12-27 15:13:07,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 2018 transitions. [2019-12-27 15:13:07,769 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 2018 transitions. Word has length 4 [2019-12-27 15:13:07,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:07,770 INFO L462 AbstractCegarLoop]: Abstraction has 680 states and 2018 transitions. [2019-12-27 15:13:07,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-27 15:13:07,772 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 2018 transitions. [2019-12-27 15:13:07,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 15:13:07,773 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:07,773 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:07,774 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:07,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:07,774 INFO L82 PathProgramCache]: Analyzing trace with hash -870713509, now seen corresponding path program 1 times [2019-12-27 15:13:07,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:07,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529439039] [2019-12-27 15:13:07,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:07,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:07,856 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 15:13:07,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529439039] [2019-12-27 15:13:07,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:13:07,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:13:07,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2114676563] [2019-12-27 15:13:07,857 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:07,858 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:07,859 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 15:13:07,859 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:07,859 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:13:07,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:13:07,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:07,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:13:07,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:13:07,862 INFO L87 Difference]: Start difference. First operand 680 states and 2018 transitions. Second operand 3 states. [2019-12-27 15:13:07,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:07,928 INFO L93 Difference]: Finished difference Result 685 states and 1989 transitions. [2019-12-27 15:13:07,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:13:07,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 15:13:07,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:07,936 INFO L225 Difference]: With dead ends: 685 [2019-12-27 15:13:07,936 INFO L226 Difference]: Without dead ends: 568 [2019-12-27 15:13:07,937 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 15:13:07,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-12-27 15:13:07,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 550. [2019-12-27 15:13:07,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2019-12-27 15:13:07,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1644 transitions. [2019-12-27 15:13:07,981 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 1644 transitions. Word has length 9 [2019-12-27 15:13:07,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:07,982 INFO L462 AbstractCegarLoop]: Abstraction has 550 states and 1644 transitions. [2019-12-27 15:13:07,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:13:07,982 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 1644 transitions. [2019-12-27 15:13:07,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 15:13:07,984 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:07,984 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:07,984 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:07,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:07,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1073713561, now seen corresponding path program 1 times [2019-12-27 15:13:07,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:07,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10080682] [2019-12-27 15:13:07,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:08,042 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 15:13:08,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10080682] [2019-12-27 15:13:08,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:13:08,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:13:08,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [130962694] [2019-12-27 15:13:08,043 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:08,045 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:08,046 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 15:13:08,046 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:08,047 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:13:08,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:13:08,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:08,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:13:08,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:13:08,048 INFO L87 Difference]: Start difference. First operand 550 states and 1644 transitions. Second operand 3 states. [2019-12-27 15:13:08,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:08,073 INFO L93 Difference]: Finished difference Result 531 states and 1570 transitions. [2019-12-27 15:13:08,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:13:08,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 15:13:08,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:08,077 INFO L225 Difference]: With dead ends: 531 [2019-12-27 15:13:08,078 INFO L226 Difference]: Without dead ends: 408 [2019-12-27 15:13:08,078 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 15:13:08,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-12-27 15:13:08,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2019-12-27 15:13:08,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-12-27 15:13:08,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 1242 transitions. [2019-12-27 15:13:08,093 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 1242 transitions. Word has length 11 [2019-12-27 15:13:08,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:08,094 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 1242 transitions. [2019-12-27 15:13:08,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:13:08,095 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 1242 transitions. [2019-12-27 15:13:08,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 15:13:08,098 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:08,098 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 15:13:08,098 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:08,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:08,099 INFO L82 PathProgramCache]: Analyzing trace with hash -783095282, now seen corresponding path program 1 times [2019-12-27 15:13:08,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:08,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589440786] [2019-12-27 15:13:08,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:08,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:08,175 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 15:13:08,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589440786] [2019-12-27 15:13:08,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:13:08,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:13:08,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [585964729] [2019-12-27 15:13:08,177 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:08,178 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:08,184 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 77 transitions. [2019-12-27 15:13:08,185 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:08,191 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 15:13:08,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:13:08,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:08,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:13:08,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:13:08,193 INFO L87 Difference]: Start difference. First operand 408 states and 1242 transitions. Second operand 3 states. [2019-12-27 15:13:08,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:08,248 INFO L93 Difference]: Finished difference Result 538 states and 1566 transitions. [2019-12-27 15:13:08,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:13:08,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-27 15:13:08,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:08,252 INFO L225 Difference]: With dead ends: 538 [2019-12-27 15:13:08,252 INFO L226 Difference]: Without dead ends: 424 [2019-12-27 15:13:08,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 15:13:08,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-12-27 15:13:08,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 398. [2019-12-27 15:13:08,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2019-12-27 15:13:08,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1161 transitions. [2019-12-27 15:13:08,267 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1161 transitions. Word has length 17 [2019-12-27 15:13:08,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:08,267 INFO L462 AbstractCegarLoop]: Abstraction has 398 states and 1161 transitions. [2019-12-27 15:13:08,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:13:08,268 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1161 transitions. [2019-12-27 15:13:08,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 15:13:08,270 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:08,270 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 15:13:08,270 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:08,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:08,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1243088422, now seen corresponding path program 1 times [2019-12-27 15:13:08,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:08,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708274004] [2019-12-27 15:13:08,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:08,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:08,319 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 15:13:08,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708274004] [2019-12-27 15:13:08,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:13:08,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:13:08,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [698780448] [2019-12-27 15:13:08,326 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:08,327 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:08,331 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 70 transitions. [2019-12-27 15:13:08,331 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:08,347 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 15:13:08,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:13:08,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:08,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:13:08,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:13:08,349 INFO L87 Difference]: Start difference. First operand 398 states and 1161 transitions. Second operand 5 states. [2019-12-27 15:13:08,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:08,469 INFO L93 Difference]: Finished difference Result 866 states and 2393 transitions. [2019-12-27 15:13:08,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 15:13:08,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 15:13:08,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:08,476 INFO L225 Difference]: With dead ends: 866 [2019-12-27 15:13:08,477 INFO L226 Difference]: Without dead ends: 866 [2019-12-27 15:13:08,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:13:08,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2019-12-27 15:13:08,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 448. [2019-12-27 15:13:08,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-12-27 15:13:08,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 1312 transitions. [2019-12-27 15:13:08,499 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 1312 transitions. Word has length 17 [2019-12-27 15:13:08,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:08,500 INFO L462 AbstractCegarLoop]: Abstraction has 448 states and 1312 transitions. [2019-12-27 15:13:08,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:13:08,500 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 1312 transitions. [2019-12-27 15:13:08,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 15:13:08,502 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:08,502 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 15:13:08,502 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:08,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:08,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1301572, now seen corresponding path program 2 times [2019-12-27 15:13:08,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:08,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536112826] [2019-12-27 15:13:08,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:08,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:08,544 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 15:13:08,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536112826] [2019-12-27 15:13:08,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:13:08,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:13:08,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1995256747] [2019-12-27 15:13:08,546 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:08,547 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:08,552 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 43 states and 65 transitions. [2019-12-27 15:13:08,552 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:08,554 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 15:13:08,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:13:08,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:08,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:13:08,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:13:08,555 INFO L87 Difference]: Start difference. First operand 448 states and 1312 transitions. Second operand 3 states. [2019-12-27 15:13:08,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:08,623 INFO L93 Difference]: Finished difference Result 402 states and 1063 transitions. [2019-12-27 15:13:08,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:13:08,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-27 15:13:08,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:08,626 INFO L225 Difference]: With dead ends: 402 [2019-12-27 15:13:08,626 INFO L226 Difference]: Without dead ends: 258 [2019-12-27 15:13:08,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 15:13:08,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-12-27 15:13:08,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 220. [2019-12-27 15:13:08,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-12-27 15:13:08,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 534 transitions. [2019-12-27 15:13:08,635 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 534 transitions. Word has length 17 [2019-12-27 15:13:08,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:08,636 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 534 transitions. [2019-12-27 15:13:08,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:13:08,636 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 534 transitions. [2019-12-27 15:13:08,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 15:13:08,637 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:08,637 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:08,637 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:08,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:08,638 INFO L82 PathProgramCache]: Analyzing trace with hash 567307087, now seen corresponding path program 1 times [2019-12-27 15:13:08,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:08,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333287865] [2019-12-27 15:13:08,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:08,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:08,693 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 15:13:08,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333287865] [2019-12-27 15:13:08,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:13:08,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:13:08,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [739914649] [2019-12-27 15:13:08,694 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:08,696 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:08,700 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 52 states and 78 transitions. [2019-12-27 15:13:08,700 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:08,736 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 15:13:08,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:13:08,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:08,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:13:08,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:13:08,737 INFO L87 Difference]: Start difference. First operand 220 states and 534 transitions. Second operand 6 states. [2019-12-27 15:13:08,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:08,854 INFO L93 Difference]: Finished difference Result 410 states and 1083 transitions. [2019-12-27 15:13:08,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 15:13:08,854 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-12-27 15:13:08,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:08,857 INFO L225 Difference]: With dead ends: 410 [2019-12-27 15:13:08,857 INFO L226 Difference]: Without dead ends: 390 [2019-12-27 15:13:08,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:13:08,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-12-27 15:13:08,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 208. [2019-12-27 15:13:08,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-12-27 15:13:08,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 500 transitions. [2019-12-27 15:13:08,867 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 500 transitions. Word has length 19 [2019-12-27 15:13:08,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:08,867 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 500 transitions. [2019-12-27 15:13:08,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:13:08,867 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 500 transitions. [2019-12-27 15:13:08,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 15:13:08,868 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:13:08,868 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:13:08,868 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:13:08,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:13:08,869 INFO L82 PathProgramCache]: Analyzing trace with hash 684902644, now seen corresponding path program 1 times [2019-12-27 15:13:08,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:13:08,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835168821] [2019-12-27 15:13:08,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:13:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:13:08,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 15:13:08,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835168821] [2019-12-27 15:13:08,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:13:08,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:13:08,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [180363347] [2019-12-27 15:13:08,919 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:13:08,921 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:13:08,926 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 52 states and 78 transitions. [2019-12-27 15:13:08,926 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:13:08,993 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 15:13:08,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:13:08,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:13:08,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:13:08,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:13:08,994 INFO L87 Difference]: Start difference. First operand 208 states and 500 transitions. Second operand 5 states. [2019-12-27 15:13:09,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:13:09,061 INFO L93 Difference]: Finished difference Result 220 states and 588 transitions. [2019-12-27 15:13:09,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 15:13:09,062 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 15:13:09,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:13:09,063 INFO L225 Difference]: With dead ends: 220 [2019-12-27 15:13:09,063 INFO L226 Difference]: Without dead ends: 0 [2019-12-27 15:13:09,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:13:09,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-27 15:13:09,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-27 15:13:09,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-27 15:13:09,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-27 15:13:09,064 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2019-12-27 15:13:09,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:13:09,065 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-27 15:13:09,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:13:09,066 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-27 15:13:09,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-27 15:13:09,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:13:09 BasicIcfg [2019-12-27 15:13:09,071 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 15:13:09,079 INFO L168 Benchmark]: Toolchain (without parser) took 5057.86 ms. Allocated memory was 137.4 MB in the beginning and 250.1 MB in the end (delta: 112.7 MB). Free memory was 100.6 MB in the beginning and 153.6 MB in the end (delta: -53.1 MB). Peak memory consumption was 59.6 MB. Max. memory is 7.1 GB. [2019-12-27 15:13:09,081 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 15:13:09,082 INFO L168 Benchmark]: CACSL2BoogieTranslator took 814.09 ms. Allocated memory was 137.4 MB in the beginning and 200.3 MB in the end (delta: 62.9 MB). Free memory was 100.4 MB in the beginning and 159.5 MB in the end (delta: -59.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. [2019-12-27 15:13:09,083 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.05 ms. Allocated memory is still 200.3 MB. Free memory was 159.5 MB in the beginning and 157.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 15:13:09,084 INFO L168 Benchmark]: Boogie Preprocessor took 68.86 ms. Allocated memory is still 200.3 MB. Free memory was 157.5 MB in the beginning and 156.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2019-12-27 15:13:09,087 INFO L168 Benchmark]: RCFGBuilder took 520.39 ms. Allocated memory is still 200.3 MB. Free memory was 156.1 MB in the beginning and 132.2 MB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 7.1 GB. [2019-12-27 15:13:09,087 INFO L168 Benchmark]: TraceAbstraction took 3574.70 ms. Allocated memory was 200.3 MB in the beginning and 250.1 MB in the end (delta: 49.8 MB). Free memory was 131.5 MB in the beginning and 153.6 MB in the end (delta: -22.2 MB). Peak memory consumption was 27.7 MB. Max. memory is 7.1 GB. [2019-12-27 15:13:09,097 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.30 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 814.09 ms. Allocated memory was 137.4 MB in the beginning and 200.3 MB in the end (delta: 62.9 MB). Free memory was 100.4 MB in the beginning and 159.5 MB in the end (delta: -59.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.05 ms. Allocated memory is still 200.3 MB. Free memory was 159.5 MB in the beginning and 157.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 68.86 ms. Allocated memory is still 200.3 MB. Free memory was 157.5 MB in the beginning and 156.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 520.39 ms. Allocated memory is still 200.3 MB. Free memory was 156.1 MB in the beginning and 132.2 MB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3574.70 ms. Allocated memory was 200.3 MB in the beginning and 250.1 MB in the end (delta: 49.8 MB). Free memory was 131.5 MB in the beginning and 153.6 MB in the end (delta: -22.2 MB). Peak memory consumption was 27.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.6s, 84 ProgramPointsBefore, 51 ProgramPointsAfterwards, 103 TransitionsBefore, 63 TransitionsAfterwards, 3196 CoEnabledTransitionPairs, 6 FixpointIterations, 18 TrivialSequentialCompositions, 22 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 8 ChoiceCompositions, 1170 VarBasedMoverChecksPositive, 91 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 63 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.4s, 0 MoverChecksTotal, 9503 CheckedPairsTotal, 44 TotalNumberOfCompositions - PositiveResult [Line: 723]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 697]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 78 locations, 2 error locations. Result: SAFE, OverallTime: 3.4s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 552 SDtfs, 464 SDslu, 354 SDs, 0 SdLazy, 189 SolverSat, 70 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=719occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 682 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 113 NumberOfCodeBlocks, 113 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 105 ConstructedInterpolants, 0 QuantifiedInterpolants, 2589 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 correct! Received shutdown request...