/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.epf -i ../../../trunk/examples/svcomp/pthread-ext/20_lamport.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 15:49:06,012 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 15:49:06,014 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 15:49:06,026 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 15:49:06,027 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 15:49:06,027 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 15:49:06,029 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 15:49:06,031 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 15:49:06,034 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 15:49:06,042 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 15:49:06,043 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 15:49:06,048 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 15:49:06,048 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 15:49:06,051 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 15:49:06,052 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 15:49:06,053 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 15:49:06,055 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 15:49:06,056 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 15:49:06,060 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 15:49:06,064 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 15:49:06,067 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 15:49:06,068 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 15:49:06,069 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 15:49:06,070 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 15:49:06,077 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 15:49:06,077 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 15:49:06,077 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 15:49:06,079 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 15:49:06,080 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 15:49:06,082 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 15:49:06,083 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 15:49:06,084 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 15:49:06,084 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 15:49:06,085 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 15:49:06,089 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 15:49:06,089 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 15:49:06,090 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 15:49:06,090 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 15:49:06,090 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 15:49:06,092 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 15:49:06,093 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 15:49:06,094 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.epf [2019-12-18 15:49:06,114 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 15:49:06,115 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 15:49:06,117 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 15:49:06,117 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 15:49:06,117 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 15:49:06,117 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 15:49:06,118 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 15:49:06,118 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 15:49:06,118 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 15:49:06,118 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 15:49:06,119 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 15:49:06,120 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 15:49:06,120 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 15:49:06,120 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 15:49:06,120 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 15:49:06,121 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 15:49:06,121 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 15:49:06,121 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 15:49:06,121 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 15:49:06,121 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 15:49:06,122 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 15:49:06,122 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 15:49:06,122 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 15:49:06,122 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 15:49:06,122 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 15:49:06,123 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 15:49:06,123 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 15:49:06,123 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 15:49:06,123 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 15:49:06,399 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 15:49:06,416 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 15:49:06,420 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 15:49:06,421 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 15:49:06,422 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 15:49:06,422 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/20_lamport.i [2019-12-18 15:49:06,497 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7446a770/ea813246f13a4b369ec567386939a67a/FLAG6f99d426f [2019-12-18 15:49:07,095 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 15:49:07,096 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/20_lamport.i [2019-12-18 15:49:07,115 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7446a770/ea813246f13a4b369ec567386939a67a/FLAG6f99d426f [2019-12-18 15:49:07,351 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7446a770/ea813246f13a4b369ec567386939a67a [2019-12-18 15:49:07,359 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 15:49:07,361 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 15:49:07,362 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 15:49:07,362 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 15:49:07,366 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 15:49:07,367 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:49:07" (1/1) ... [2019-12-18 15:49:07,369 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1977489f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:49:07, skipping insertion in model container [2019-12-18 15:49:07,370 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:49:07" (1/1) ... [2019-12-18 15:49:07,377 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 15:49:07,439 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 15:49:07,917 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:49:07,932 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 15:49:08,022 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:49:08,088 INFO L208 MainTranslator]: Completed translation [2019-12-18 15:49:08,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:49:08 WrapperNode [2019-12-18 15:49:08,089 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 15:49:08,089 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 15:49:08,090 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 15:49:08,090 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 15:49:08,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:49:08" (1/1) ... [2019-12-18 15:49:08,115 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:49:08" (1/1) ... [2019-12-18 15:49:08,138 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 15:49:08,138 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 15:49:08,138 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 15:49:08,138 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 15:49:08,147 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:49:08" (1/1) ... [2019-12-18 15:49:08,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:49:08" (1/1) ... [2019-12-18 15:49:08,149 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:49:08" (1/1) ... [2019-12-18 15:49:08,150 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:49:08" (1/1) ... [2019-12-18 15:49:08,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:49:08" (1/1) ... [2019-12-18 15:49:08,162 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:49:08" (1/1) ... [2019-12-18 15:49:08,165 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:49:08" (1/1) ... [2019-12-18 15:49:08,168 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 15:49:08,169 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 15:49:08,169 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 15:49:08,169 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 15:49:08,170 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:49:08" (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-18 15:49:08,238 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-12-18 15:49:08,238 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-12-18 15:49:08,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 15:49:08,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 15:49:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 15:49:08,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 15:49:08,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 15:49:08,242 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 15:49:08,654 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 15:49:08,654 INFO L287 CfgBuilder]: Removed 14 assume(true) statements. [2019-12-18 15:49:08,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:49:08 BoogieIcfgContainer [2019-12-18 15:49:08,656 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 15:49:08,658 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 15:49:08,658 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 15:49:08,661 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 15:49:08,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 03:49:07" (1/3) ... [2019-12-18 15:49:08,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43d2936d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:49:08, skipping insertion in model container [2019-12-18 15:49:08,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:49:08" (2/3) ... [2019-12-18 15:49:08,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43d2936d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:49:08, skipping insertion in model container [2019-12-18 15:49:08,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:49:08" (3/3) ... [2019-12-18 15:49:08,665 INFO L109 eAbstractionObserver]: Analyzing ICFG 20_lamport.i [2019-12-18 15:49:08,674 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 15:49:08,675 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 15:49:08,682 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 15:49:08,683 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 15:49:08,710 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:49:08,710 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:49:08,711 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:49:08,711 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:49:08,712 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:49:08,712 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:49:08,717 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:49:08,717 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:49:08,718 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:49:08,718 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:49:08,736 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-18 15:49:08,758 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 15:49:08,758 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 15:49:08,758 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 15:49:08,758 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 15:49:08,759 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 15:49:08,759 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 15:49:08,759 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 15:49:08,759 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 15:49:08,774 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 92 transitions [2019-12-18 15:49:08,776 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 72 places, 92 transitions [2019-12-18 15:49:08,827 INFO L126 PetriNetUnfolder]: 24/91 cut-off events. [2019-12-18 15:49:08,827 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:49:08,835 INFO L76 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 91 events. 24/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 162 event pairs. 3/68 useless extension candidates. Maximal degree in co-relation 78. Up to 5 conditions per place. [2019-12-18 15:49:08,842 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 72 places, 92 transitions [2019-12-18 15:49:08,865 INFO L126 PetriNetUnfolder]: 24/91 cut-off events. [2019-12-18 15:49:08,866 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:49:08,868 INFO L76 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 91 events. 24/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 162 event pairs. 3/68 useless extension candidates. Maximal degree in co-relation 78. Up to 5 conditions per place. [2019-12-18 15:49:08,873 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2992 [2019-12-18 15:49:08,874 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 15:49:10,234 INFO L206 etLargeBlockEncoding]: Checked pairs total: 7520 [2019-12-18 15:49:10,235 INFO L214 etLargeBlockEncoding]: Total number of compositions: 46 [2019-12-18 15:49:10,239 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 51 transitions [2019-12-18 15:49:10,262 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 291 states. [2019-12-18 15:49:10,265 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states. [2019-12-18 15:49:10,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-18 15:49:10,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:49:10,272 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-18 15:49:10,273 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:49:10,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:49:10,279 INFO L82 PathProgramCache]: Analyzing trace with hash 12384667, now seen corresponding path program 1 times [2019-12-18 15:49:10,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:49:10,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836082385] [2019-12-18 15:49:10,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:49:10,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:49:10,424 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-18 15:49:10,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836082385] [2019-12-18 15:49:10,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:49:10,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:49:10,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122020999] [2019-12-18 15:49:10,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-18 15:49:10,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:49:10,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-18 15:49:10,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-18 15:49:10,450 INFO L87 Difference]: Start difference. First operand 291 states. Second operand 2 states. [2019-12-18 15:49:10,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:49:10,496 INFO L93 Difference]: Finished difference Result 291 states and 750 transitions. [2019-12-18 15:49:10,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-18 15:49:10,498 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 4 [2019-12-18 15:49:10,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:49:10,515 INFO L225 Difference]: With dead ends: 291 [2019-12-18 15:49:10,515 INFO L226 Difference]: Without dead ends: 282 [2019-12-18 15:49:10,517 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-18 15:49:10,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-12-18 15:49:10,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2019-12-18 15:49:10,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-12-18 15:49:10,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 732 transitions. [2019-12-18 15:49:10,588 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 732 transitions. Word has length 4 [2019-12-18 15:49:10,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:49:10,589 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 732 transitions. [2019-12-18 15:49:10,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-18 15:49:10,589 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 732 transitions. [2019-12-18 15:49:10,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 15:49:10,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:49:10,591 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:49:10,591 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:49:10,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:49:10,592 INFO L82 PathProgramCache]: Analyzing trace with hash 27980612, now seen corresponding path program 1 times [2019-12-18 15:49:10,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:49:10,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737901353] [2019-12-18 15:49:10,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:49:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:49:10,653 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-18 15:49:10,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737901353] [2019-12-18 15:49:10,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:49:10,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:49:10,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459511781] [2019-12-18 15:49:10,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:49:10,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:49:10,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:49:10,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:49:10,660 INFO L87 Difference]: Start difference. First operand 282 states and 732 transitions. Second operand 3 states. [2019-12-18 15:49:10,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:49:10,700 INFO L93 Difference]: Finished difference Result 281 states and 714 transitions. [2019-12-18 15:49:10,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:49:10,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 15:49:10,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:49:10,704 INFO L225 Difference]: With dead ends: 281 [2019-12-18 15:49:10,705 INFO L226 Difference]: Without dead ends: 242 [2019-12-18 15:49:10,706 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-18 15:49:10,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-12-18 15:49:10,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 236. [2019-12-18 15:49:10,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-12-18 15:49:10,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 615 transitions. [2019-12-18 15:49:10,727 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 615 transitions. Word has length 9 [2019-12-18 15:49:10,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:49:10,727 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 615 transitions. [2019-12-18 15:49:10,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:49:10,728 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 615 transitions. [2019-12-18 15:49:10,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 15:49:10,729 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:49:10,729 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:49:10,729 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:49:10,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:49:10,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1037274544, now seen corresponding path program 1 times [2019-12-18 15:49:10,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:49:10,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088779361] [2019-12-18 15:49:10,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:49:10,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:49:10,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:49:10,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088779361] [2019-12-18 15:49:10,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:49:10,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:49:10,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815042882] [2019-12-18 15:49:10,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:49:10,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:49:10,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:49:10,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:49:10,809 INFO L87 Difference]: Start difference. First operand 236 states and 615 transitions. Second operand 3 states. [2019-12-18 15:49:10,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:49:10,829 INFO L93 Difference]: Finished difference Result 225 states and 582 transitions. [2019-12-18 15:49:10,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:49:10,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 15:49:10,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:49:10,832 INFO L225 Difference]: With dead ends: 225 [2019-12-18 15:49:10,832 INFO L226 Difference]: Without dead ends: 186 [2019-12-18 15:49:10,832 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-18 15:49:10,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-12-18 15:49:10,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2019-12-18 15:49:10,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-12-18 15:49:10,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 490 transitions. [2019-12-18 15:49:10,846 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 490 transitions. Word has length 9 [2019-12-18 15:49:10,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:49:10,846 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 490 transitions. [2019-12-18 15:49:10,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:49:10,846 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 490 transitions. [2019-12-18 15:49:10,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 15:49:10,849 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:49:10,849 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:49:10,849 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:49:10,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:49:10,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1540220195, now seen corresponding path program 1 times [2019-12-18 15:49:10,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:49:10,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039538424] [2019-12-18 15:49:10,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:49:10,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:49:10,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-18 15:49:10,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039538424] [2019-12-18 15:49:10,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:49:10,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:49:10,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194596044] [2019-12-18 15:49:10,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:49:10,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:49:10,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:49:10,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:49:10,920 INFO L87 Difference]: Start difference. First operand 186 states and 490 transitions. Second operand 3 states. [2019-12-18 15:49:10,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:49:10,943 INFO L93 Difference]: Finished difference Result 308 states and 768 transitions. [2019-12-18 15:49:10,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:49:10,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 15:49:10,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:49:10,946 INFO L225 Difference]: With dead ends: 308 [2019-12-18 15:49:10,947 INFO L226 Difference]: Without dead ends: 306 [2019-12-18 15:49:10,947 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-18 15:49:10,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-12-18 15:49:10,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 229. [2019-12-18 15:49:10,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-12-18 15:49:10,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 602 transitions. [2019-12-18 15:49:10,960 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 602 transitions. Word has length 15 [2019-12-18 15:49:10,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:49:10,961 INFO L462 AbstractCegarLoop]: Abstraction has 229 states and 602 transitions. [2019-12-18 15:49:10,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:49:10,961 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 602 transitions. [2019-12-18 15:49:10,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 15:49:10,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:49:10,963 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:49:10,964 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:49:10,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:49:10,964 INFO L82 PathProgramCache]: Analyzing trace with hash 988190489, now seen corresponding path program 1 times [2019-12-18 15:49:10,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:49:10,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213033561] [2019-12-18 15:49:10,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:49:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:49:11,005 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-18 15:49:11,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213033561] [2019-12-18 15:49:11,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:49:11,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:49:11,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980808456] [2019-12-18 15:49:11,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:49:11,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:49:11,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:49:11,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:49:11,011 INFO L87 Difference]: Start difference. First operand 229 states and 602 transitions. Second operand 3 states. [2019-12-18 15:49:11,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:49:11,085 INFO L93 Difference]: Finished difference Result 312 states and 770 transitions. [2019-12-18 15:49:11,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:49:11,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 15:49:11,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:49:11,088 INFO L225 Difference]: With dead ends: 312 [2019-12-18 15:49:11,089 INFO L226 Difference]: Without dead ends: 237 [2019-12-18 15:49:11,089 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-18 15:49:11,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-12-18 15:49:11,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 216. [2019-12-18 15:49:11,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-12-18 15:49:11,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 534 transitions. [2019-12-18 15:49:11,099 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 534 transitions. Word has length 15 [2019-12-18 15:49:11,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:49:11,099 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 534 transitions. [2019-12-18 15:49:11,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:49:11,099 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 534 transitions. [2019-12-18 15:49:11,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 15:49:11,101 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:49:11,102 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:49:11,102 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:49:11,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:49:11,102 INFO L82 PathProgramCache]: Analyzing trace with hash -795157281, now seen corresponding path program 2 times [2019-12-18 15:49:11,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:49:11,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075287665] [2019-12-18 15:49:11,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:49:11,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:49:11,132 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-18 15:49:11,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075287665] [2019-12-18 15:49:11,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:49:11,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:49:11,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227811730] [2019-12-18 15:49:11,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:49:11,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:49:11,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:49:11,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:49:11,135 INFO L87 Difference]: Start difference. First operand 216 states and 534 transitions. Second operand 3 states. [2019-12-18 15:49:11,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:49:11,163 INFO L93 Difference]: Finished difference Result 293 states and 674 transitions. [2019-12-18 15:49:11,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:49:11,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 15:49:11,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:49:11,169 INFO L225 Difference]: With dead ends: 293 [2019-12-18 15:49:11,169 INFO L226 Difference]: Without dead ends: 293 [2019-12-18 15:49:11,170 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-18 15:49:11,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-12-18 15:49:11,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 216. [2019-12-18 15:49:11,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-12-18 15:49:11,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 522 transitions. [2019-12-18 15:49:11,182 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 522 transitions. Word has length 15 [2019-12-18 15:49:11,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:49:11,183 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 522 transitions. [2019-12-18 15:49:11,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:49:11,183 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 522 transitions. [2019-12-18 15:49:11,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 15:49:11,187 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:49:11,187 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:49:11,187 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:49:11,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:49:11,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1884700835, now seen corresponding path program 2 times [2019-12-18 15:49:11,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:49:11,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138572323] [2019-12-18 15:49:11,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:49:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:49:11,256 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-18 15:49:11,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138572323] [2019-12-18 15:49:11,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:49:11,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:49:11,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392404222] [2019-12-18 15:49:11,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:49:11,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:49:11,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:49:11,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:49:11,258 INFO L87 Difference]: Start difference. First operand 216 states and 522 transitions. Second operand 3 states. [2019-12-18 15:49:11,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:49:11,309 INFO L93 Difference]: Finished difference Result 181 states and 375 transitions. [2019-12-18 15:49:11,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:49:11,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 15:49:11,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:49:11,310 INFO L225 Difference]: With dead ends: 181 [2019-12-18 15:49:11,311 INFO L226 Difference]: Without dead ends: 115 [2019-12-18 15:49:11,311 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-18 15:49:11,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-12-18 15:49:11,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 96. [2019-12-18 15:49:11,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-12-18 15:49:11,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 190 transitions. [2019-12-18 15:49:11,318 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 190 transitions. Word has length 15 [2019-12-18 15:49:11,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:49:11,319 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 190 transitions. [2019-12-18 15:49:11,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:49:11,319 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 190 transitions. [2019-12-18 15:49:11,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 15:49:11,320 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:49:11,320 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:49:11,320 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:49:11,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:49:11,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1567500834, now seen corresponding path program 1 times [2019-12-18 15:49:11,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:49:11,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863465731] [2019-12-18 15:49:11,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:49:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:49:11,382 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-18 15:49:11,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863465731] [2019-12-18 15:49:11,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:49:11,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:49:11,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859260512] [2019-12-18 15:49:11,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:49:11,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:49:11,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:49:11,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:49:11,386 INFO L87 Difference]: Start difference. First operand 96 states and 190 transitions. Second operand 3 states. [2019-12-18 15:49:11,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:49:11,404 INFO L93 Difference]: Finished difference Result 98 states and 191 transitions. [2019-12-18 15:49:11,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:49:11,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-18 15:49:11,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:49:11,406 INFO L225 Difference]: With dead ends: 98 [2019-12-18 15:49:11,406 INFO L226 Difference]: Without dead ends: 81 [2019-12-18 15:49:11,407 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-18 15:49:11,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-12-18 15:49:11,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-12-18 15:49:11,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-12-18 15:49:11,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 159 transitions. [2019-12-18 15:49:11,410 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 159 transitions. Word has length 17 [2019-12-18 15:49:11,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:49:11,410 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 159 transitions. [2019-12-18 15:49:11,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:49:11,411 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 159 transitions. [2019-12-18 15:49:11,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 15:49:11,411 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:49:11,411 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:49:11,411 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:49:11,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:49:11,412 INFO L82 PathProgramCache]: Analyzing trace with hash 322655978, now seen corresponding path program 1 times [2019-12-18 15:49:11,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:49:11,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326091641] [2019-12-18 15:49:11,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:49:11,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:49:11,464 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-18 15:49:11,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326091641] [2019-12-18 15:49:11,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:49:11,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:49:11,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458153067] [2019-12-18 15:49:11,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:49:11,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:49:11,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:49:11,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:49:11,466 INFO L87 Difference]: Start difference. First operand 81 states and 159 transitions. Second operand 3 states. [2019-12-18 15:49:11,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:49:11,472 INFO L93 Difference]: Finished difference Result 56 states and 119 transitions. [2019-12-18 15:49:11,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:49:11,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-18 15:49:11,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:49:11,473 INFO L225 Difference]: With dead ends: 56 [2019-12-18 15:49:11,474 INFO L226 Difference]: Without dead ends: 0 [2019-12-18 15:49:11,474 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-18 15:49:11,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-18 15:49:11,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-18 15:49:11,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-18 15:49:11,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-18 15:49:11,475 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2019-12-18 15:49:11,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:49:11,475 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-18 15:49:11,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:49:11,476 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-18 15:49:11,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-18 15:49:11,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 03:49:11 BasicIcfg [2019-12-18 15:49:11,480 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 15:49:11,483 INFO L168 Benchmark]: Toolchain (without parser) took 4121.41 ms. Allocated memory was 145.2 MB in the beginning and 247.5 MB in the end (delta: 102.2 MB). Free memory was 100.6 MB in the beginning and 126.5 MB in the end (delta: -25.8 MB). Peak memory consumption was 76.4 MB. Max. memory is 7.1 GB. [2019-12-18 15:49:11,484 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-18 15:49:11,485 INFO L168 Benchmark]: CACSL2BoogieTranslator took 726.94 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 100.2 MB in the beginning and 162.6 MB in the end (delta: -62.4 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. [2019-12-18 15:49:11,485 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.42 ms. Allocated memory is still 203.4 MB. Free memory was 162.6 MB in the beginning and 160.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 15:49:11,486 INFO L168 Benchmark]: Boogie Preprocessor took 30.14 ms. Allocated memory is still 203.4 MB. Free memory was 160.6 MB in the beginning and 158.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 15:49:11,487 INFO L168 Benchmark]: RCFGBuilder took 487.93 ms. Allocated memory is still 203.4 MB. Free memory was 158.7 MB in the beginning and 136.3 MB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2019-12-18 15:49:11,488 INFO L168 Benchmark]: TraceAbstraction took 2822.77 ms. Allocated memory was 203.4 MB in the beginning and 247.5 MB in the end (delta: 44.0 MB). Free memory was 136.3 MB in the beginning and 126.5 MB in the end (delta: 9.9 MB). Peak memory consumption was 53.9 MB. Max. memory is 7.1 GB. [2019-12-18 15:49:11,492 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.25 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 726.94 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 100.2 MB in the beginning and 162.6 MB in the end (delta: -62.4 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 48.42 ms. Allocated memory is still 203.4 MB. Free memory was 162.6 MB in the beginning and 160.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.14 ms. Allocated memory is still 203.4 MB. Free memory was 160.6 MB in the beginning and 158.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 487.93 ms. Allocated memory is still 203.4 MB. Free memory was 158.7 MB in the beginning and 136.3 MB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2822.77 ms. Allocated memory was 203.4 MB in the beginning and 247.5 MB in the end (delta: 44.0 MB). Free memory was 136.3 MB in the beginning and 126.5 MB in the end (delta: 9.9 MB). Peak memory consumption was 53.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.4s, 72 ProgramPointsBefore, 37 ProgramPointsAfterwards, 92 TransitionsBefore, 51 TransitionsAfterwards, 2992 CoEnabledTransitionPairs, 5 FixpointIterations, 11 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 8 ChoiceCompositions, 1205 VarBasedMoverChecksPositive, 82 VarBasedMoverChecksNegative, 50 SemBasedMoverChecksPositive, 61 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.4s, 0 MoverChecksTotal, 7520 CheckedPairsTotal, 46 TotalNumberOfCompositions - PositiveResult [Line: 698]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 724]: 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 2 procedures, 69 locations, 2 error locations. Result: SAFE, OverallTime: 2.7s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 474 SDtfs, 189 SDslu, 211 SDs, 0 SdLazy, 96 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=291occurred 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.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 200 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 107 ConstructedInterpolants, 0 QuantifiedInterpolants, 2461 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...