/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-ext/20_lamport.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 11:52:54,527 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 11:52:54,529 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 11:52:54,542 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 11:52:54,542 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 11:52:54,543 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 11:52:54,544 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 11:52:54,546 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 11:52:54,548 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 11:52:54,549 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 11:52:54,550 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 11:52:54,551 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 11:52:54,551 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 11:52:54,552 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 11:52:54,553 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 11:52:54,554 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 11:52:54,555 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 11:52:54,556 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 11:52:54,558 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 11:52:54,560 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 11:52:54,561 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 11:52:54,562 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 11:52:54,563 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 11:52:54,564 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 11:52:54,566 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 11:52:54,567 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 11:52:54,567 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 11:52:54,568 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 11:52:54,568 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 11:52:54,569 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 11:52:54,569 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 11:52:54,570 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 11:52:54,571 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 11:52:54,572 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 11:52:54,573 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 11:52:54,573 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 11:52:54,573 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 11:52:54,574 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 11:52:54,574 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 11:52:54,575 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 11:52:54,575 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 11:52:54,576 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 11:52:54,591 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 11:52:54,591 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 11:52:54,592 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 11:52:54,592 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 11:52:54,592 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 11:52:54,593 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 11:52:54,593 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 11:52:54,593 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 11:52:54,593 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 11:52:54,593 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 11:52:54,594 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 11:52:54,594 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 11:52:54,594 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 11:52:54,594 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 11:52:54,594 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 11:52:54,594 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 11:52:54,595 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 11:52:54,595 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 11:52:54,595 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 11:52:54,595 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 11:52:54,595 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 11:52:54,596 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 11:52:54,596 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 11:52:54,596 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 11:52:54,596 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 11:52:54,596 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 11:52:54,597 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 11:52:54,597 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 11:52:54,597 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 11:52:54,597 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 11:52:54,897 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 11:52:54,910 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 11:52:54,914 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 11:52:54,915 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 11:52:54,916 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 11:52:54,916 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 11:52:54,995 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4055b9241/489b9d863eac470d859f3acae1dfed7c/FLAG0ede5772a [2019-12-18 11:52:55,612 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 11:52:55,613 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/20_lamport.i [2019-12-18 11:52:55,625 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4055b9241/489b9d863eac470d859f3acae1dfed7c/FLAG0ede5772a [2019-12-18 11:52:55,898 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4055b9241/489b9d863eac470d859f3acae1dfed7c [2019-12-18 11:52:55,907 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 11:52:55,909 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 11:52:55,910 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 11:52:55,910 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 11:52:55,913 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 11:52:55,914 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:52:55" (1/1) ... [2019-12-18 11:52:55,917 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41b9ec44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:52:55, skipping insertion in model container [2019-12-18 11:52:55,917 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:52:55" (1/1) ... [2019-12-18 11:52:55,924 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 11:52:55,970 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 11:52:56,440 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 11:52:56,454 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 11:52:56,528 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 11:52:56,601 INFO L208 MainTranslator]: Completed translation [2019-12-18 11:52:56,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:52:56 WrapperNode [2019-12-18 11:52:56,601 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 11:52:56,602 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 11:52:56,602 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 11:52:56,602 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 11:52:56,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:52:56" (1/1) ... [2019-12-18 11:52:56,628 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:52:56" (1/1) ... [2019-12-18 11:52:56,652 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 11:52:56,653 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 11:52:56,653 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 11:52:56,653 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 11:52:56,664 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:52:56" (1/1) ... [2019-12-18 11:52:56,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:52:56" (1/1) ... [2019-12-18 11:52:56,667 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:52:56" (1/1) ... [2019-12-18 11:52:56,667 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:52:56" (1/1) ... [2019-12-18 11:52:56,673 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:52:56" (1/1) ... [2019-12-18 11:52:56,679 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:52:56" (1/1) ... [2019-12-18 11:52:56,681 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:52:56" (1/1) ... [2019-12-18 11:52:56,684 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 11:52:56,684 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 11:52:56,684 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 11:52:56,685 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 11:52:56,685 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:52:56" (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 11:52:56,747 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-12-18 11:52:56,748 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-12-18 11:52:56,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 11:52:56,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 11:52:56,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 11:52:56,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 11:52:56,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 11:52:56,750 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 11:52:57,177 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 11:52:57,177 INFO L287 CfgBuilder]: Removed 14 assume(true) statements. [2019-12-18 11:52:57,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:52:57 BoogieIcfgContainer [2019-12-18 11:52:57,179 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 11:52:57,180 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 11:52:57,180 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 11:52:57,184 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 11:52:57,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 11:52:55" (1/3) ... [2019-12-18 11:52:57,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51bfe161 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:52:57, skipping insertion in model container [2019-12-18 11:52:57,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:52:56" (2/3) ... [2019-12-18 11:52:57,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51bfe161 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:52:57, skipping insertion in model container [2019-12-18 11:52:57,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:52:57" (3/3) ... [2019-12-18 11:52:57,188 INFO L109 eAbstractionObserver]: Analyzing ICFG 20_lamport.i [2019-12-18 11:52:57,198 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 11:52:57,199 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 11:52:57,208 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 11:52:57,210 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 11:52:57,234 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:52:57,234 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:52:57,235 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:52:57,236 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:52:57,237 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:52:57,237 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:52:57,241 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:52:57,241 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:52:57,242 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:52:57,242 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 11:52:57,269 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-18 11:52:57,287 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 11:52:57,287 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 11:52:57,287 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 11:52:57,288 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 11:52:57,288 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 11:52:57,288 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 11:52:57,288 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 11:52:57,288 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 11:52:57,303 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 92 transitions [2019-12-18 11:52:57,306 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 72 places, 92 transitions [2019-12-18 11:52:57,354 INFO L126 PetriNetUnfolder]: 24/91 cut-off events. [2019-12-18 11:52:57,355 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 11:52:57,364 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 11:52:57,372 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 72 places, 92 transitions [2019-12-18 11:52:57,395 INFO L126 PetriNetUnfolder]: 24/91 cut-off events. [2019-12-18 11:52:57,396 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 11:52:57,398 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 11:52:57,403 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2992 [2019-12-18 11:52:57,405 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 11:52:58,840 INFO L206 etLargeBlockEncoding]: Checked pairs total: 7520 [2019-12-18 11:52:58,840 INFO L214 etLargeBlockEncoding]: Total number of compositions: 46 [2019-12-18 11:52:58,849 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 51 transitions [2019-12-18 11:52:58,885 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 291 states. [2019-12-18 11:52:58,888 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states. [2019-12-18 11:52:58,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-18 11:52:58,897 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:52:58,898 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-18 11:52:58,898 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:52:58,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:52:58,905 INFO L82 PathProgramCache]: Analyzing trace with hash 12384667, now seen corresponding path program 1 times [2019-12-18 11:52:58,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:52:58,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480423221] [2019-12-18 11:52:58,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:52:59,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:52:59,103 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 11:52:59,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480423221] [2019-12-18 11:52:59,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:52:59,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 11:52:59,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508279196] [2019-12-18 11:52:59,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-18 11:52:59,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:52:59,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-18 11:52:59,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-18 11:52:59,131 INFO L87 Difference]: Start difference. First operand 291 states. Second operand 2 states. [2019-12-18 11:52:59,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:52:59,168 INFO L93 Difference]: Finished difference Result 291 states and 750 transitions. [2019-12-18 11:52:59,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-18 11:52:59,169 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 4 [2019-12-18 11:52:59,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:52:59,187 INFO L225 Difference]: With dead ends: 291 [2019-12-18 11:52:59,187 INFO L226 Difference]: Without dead ends: 282 [2019-12-18 11:52:59,189 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 11:52:59,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-12-18 11:52:59,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2019-12-18 11:52:59,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-12-18 11:52:59,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 732 transitions. [2019-12-18 11:52:59,260 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 732 transitions. Word has length 4 [2019-12-18 11:52:59,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:52:59,261 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 732 transitions. [2019-12-18 11:52:59,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-18 11:52:59,261 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 732 transitions. [2019-12-18 11:52:59,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 11:52:59,263 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:52:59,263 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:52:59,263 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:52:59,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:52:59,264 INFO L82 PathProgramCache]: Analyzing trace with hash 27980612, now seen corresponding path program 1 times [2019-12-18 11:52:59,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:52:59,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146870467] [2019-12-18 11:52:59,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:52:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:52:59,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 11:52:59,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146870467] [2019-12-18 11:52:59,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:52:59,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 11:52:59,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374157541] [2019-12-18 11:52:59,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 11:52:59,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:52:59,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 11:52:59,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 11:52:59,346 INFO L87 Difference]: Start difference. First operand 282 states and 732 transitions. Second operand 3 states. [2019-12-18 11:52:59,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:52:59,426 INFO L93 Difference]: Finished difference Result 281 states and 714 transitions. [2019-12-18 11:52:59,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:52:59,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 11:52:59,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:52:59,432 INFO L225 Difference]: With dead ends: 281 [2019-12-18 11:52:59,435 INFO L226 Difference]: Without dead ends: 242 [2019-12-18 11:52:59,436 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 11:52:59,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-12-18 11:52:59,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 236. [2019-12-18 11:52:59,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-12-18 11:52:59,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 615 transitions. [2019-12-18 11:52:59,484 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 615 transitions. Word has length 9 [2019-12-18 11:52:59,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:52:59,484 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 615 transitions. [2019-12-18 11:52:59,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 11:52:59,485 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 615 transitions. [2019-12-18 11:52:59,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 11:52:59,486 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:52:59,486 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:52:59,486 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:52:59,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:52:59,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1037274544, now seen corresponding path program 1 times [2019-12-18 11:52:59,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:52:59,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668399528] [2019-12-18 11:52:59,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:52:59,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:52:59,560 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 11:52:59,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668399528] [2019-12-18 11:52:59,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:52:59,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 11:52:59,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914959221] [2019-12-18 11:52:59,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 11:52:59,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:52:59,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 11:52:59,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 11:52:59,562 INFO L87 Difference]: Start difference. First operand 236 states and 615 transitions. Second operand 3 states. [2019-12-18 11:52:59,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:52:59,589 INFO L93 Difference]: Finished difference Result 225 states and 582 transitions. [2019-12-18 11:52:59,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:52:59,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 11:52:59,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:52:59,593 INFO L225 Difference]: With dead ends: 225 [2019-12-18 11:52:59,593 INFO L226 Difference]: Without dead ends: 186 [2019-12-18 11:52:59,593 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 11:52:59,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-12-18 11:52:59,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2019-12-18 11:52:59,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-12-18 11:52:59,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 490 transitions. [2019-12-18 11:52:59,621 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 490 transitions. Word has length 9 [2019-12-18 11:52:59,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:52:59,621 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 490 transitions. [2019-12-18 11:52:59,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 11:52:59,621 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 490 transitions. [2019-12-18 11:52:59,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 11:52:59,623 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:52:59,627 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:52:59,627 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:52:59,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:52:59,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1540220195, now seen corresponding path program 1 times [2019-12-18 11:52:59,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:52:59,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668344356] [2019-12-18 11:52:59,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:52:59,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:52:59,710 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 11:52:59,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668344356] [2019-12-18 11:52:59,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:52:59,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 11:52:59,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189671695] [2019-12-18 11:52:59,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 11:52:59,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:52:59,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 11:52:59,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 11:52:59,713 INFO L87 Difference]: Start difference. First operand 186 states and 490 transitions. Second operand 3 states. [2019-12-18 11:52:59,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:52:59,742 INFO L93 Difference]: Finished difference Result 308 states and 768 transitions. [2019-12-18 11:52:59,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:52:59,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 11:52:59,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:52:59,747 INFO L225 Difference]: With dead ends: 308 [2019-12-18 11:52:59,748 INFO L226 Difference]: Without dead ends: 306 [2019-12-18 11:52:59,748 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 11:52:59,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-12-18 11:52:59,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 229. [2019-12-18 11:52:59,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-12-18 11:52:59,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 602 transitions. [2019-12-18 11:52:59,762 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 602 transitions. Word has length 15 [2019-12-18 11:52:59,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:52:59,762 INFO L462 AbstractCegarLoop]: Abstraction has 229 states and 602 transitions. [2019-12-18 11:52:59,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 11:52:59,762 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 602 transitions. [2019-12-18 11:52:59,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 11:52:59,771 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:52:59,772 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:52:59,772 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:52:59,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:52:59,772 INFO L82 PathProgramCache]: Analyzing trace with hash 988190489, now seen corresponding path program 1 times [2019-12-18 11:52:59,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:52:59,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271522200] [2019-12-18 11:52:59,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:52:59,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:52:59,812 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 11:52:59,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271522200] [2019-12-18 11:52:59,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:52:59,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 11:52:59,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636398491] [2019-12-18 11:52:59,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 11:52:59,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:52:59,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 11:52:59,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 11:52:59,815 INFO L87 Difference]: Start difference. First operand 229 states and 602 transitions. Second operand 3 states. [2019-12-18 11:52:59,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:52:59,864 INFO L93 Difference]: Finished difference Result 312 states and 770 transitions. [2019-12-18 11:52:59,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:52:59,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 11:52:59,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:52:59,867 INFO L225 Difference]: With dead ends: 312 [2019-12-18 11:52:59,867 INFO L226 Difference]: Without dead ends: 237 [2019-12-18 11:52:59,868 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 11:52:59,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-12-18 11:52:59,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 216. [2019-12-18 11:52:59,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-12-18 11:52:59,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 534 transitions. [2019-12-18 11:52:59,877 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 534 transitions. Word has length 15 [2019-12-18 11:52:59,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:52:59,877 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 534 transitions. [2019-12-18 11:52:59,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 11:52:59,877 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 534 transitions. [2019-12-18 11:52:59,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 11:52:59,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:52:59,879 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:52:59,879 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:52:59,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:52:59,879 INFO L82 PathProgramCache]: Analyzing trace with hash -795157281, now seen corresponding path program 2 times [2019-12-18 11:52:59,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:52:59,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909615130] [2019-12-18 11:52:59,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:52:59,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:52:59,914 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 11:52:59,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909615130] [2019-12-18 11:52:59,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:52:59,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 11:52:59,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853683809] [2019-12-18 11:52:59,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 11:52:59,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:52:59,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 11:52:59,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 11:52:59,916 INFO L87 Difference]: Start difference. First operand 216 states and 534 transitions. Second operand 3 states. [2019-12-18 11:52:59,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:52:59,935 INFO L93 Difference]: Finished difference Result 293 states and 674 transitions. [2019-12-18 11:52:59,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:52:59,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 11:52:59,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:52:59,938 INFO L225 Difference]: With dead ends: 293 [2019-12-18 11:52:59,938 INFO L226 Difference]: Without dead ends: 293 [2019-12-18 11:52:59,939 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 11:52:59,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-12-18 11:52:59,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 216. [2019-12-18 11:52:59,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-12-18 11:52:59,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 522 transitions. [2019-12-18 11:52:59,947 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 522 transitions. Word has length 15 [2019-12-18 11:52:59,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:52:59,949 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 522 transitions. [2019-12-18 11:52:59,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 11:52:59,949 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 522 transitions. [2019-12-18 11:52:59,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 11:52:59,950 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:52:59,950 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 11:52:59,950 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:52:59,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:52:59,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1884700835, now seen corresponding path program 2 times [2019-12-18 11:52:59,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:52:59,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639580419] [2019-12-18 11:52:59,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:52:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:52:59,999 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 11:52:59,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639580419] [2019-12-18 11:52:59,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:53:00,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 11:53:00,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611520993] [2019-12-18 11:53:00,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 11:53:00,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:53:00,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 11:53:00,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 11:53:00,001 INFO L87 Difference]: Start difference. First operand 216 states and 522 transitions. Second operand 3 states. [2019-12-18 11:53:00,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:53:00,042 INFO L93 Difference]: Finished difference Result 181 states and 375 transitions. [2019-12-18 11:53:00,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:53:00,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 11:53:00,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:53:00,044 INFO L225 Difference]: With dead ends: 181 [2019-12-18 11:53:00,044 INFO L226 Difference]: Without dead ends: 115 [2019-12-18 11:53:00,045 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 11:53:00,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-12-18 11:53:00,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 96. [2019-12-18 11:53:00,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-12-18 11:53:00,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 190 transitions. [2019-12-18 11:53:00,049 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 190 transitions. Word has length 15 [2019-12-18 11:53:00,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:53:00,049 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 190 transitions. [2019-12-18 11:53:00,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 11:53:00,049 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 190 transitions. [2019-12-18 11:53:00,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 11:53:00,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:53:00,050 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 11:53:00,050 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:53:00,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:53:00,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1567500834, now seen corresponding path program 1 times [2019-12-18 11:53:00,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:53:00,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641475975] [2019-12-18 11:53:00,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:53:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:53:00,080 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 11:53:00,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641475975] [2019-12-18 11:53:00,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:53:00,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 11:53:00,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809449576] [2019-12-18 11:53:00,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 11:53:00,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:53:00,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 11:53:00,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 11:53:00,082 INFO L87 Difference]: Start difference. First operand 96 states and 190 transitions. Second operand 3 states. [2019-12-18 11:53:00,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:53:00,099 INFO L93 Difference]: Finished difference Result 98 states and 191 transitions. [2019-12-18 11:53:00,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:53:00,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-18 11:53:00,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:53:00,100 INFO L225 Difference]: With dead ends: 98 [2019-12-18 11:53:00,101 INFO L226 Difference]: Without dead ends: 81 [2019-12-18 11:53:00,101 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 11:53:00,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-12-18 11:53:00,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-12-18 11:53:00,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-12-18 11:53:00,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 159 transitions. [2019-12-18 11:53:00,104 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 159 transitions. Word has length 17 [2019-12-18 11:53:00,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:53:00,104 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 159 transitions. [2019-12-18 11:53:00,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 11:53:00,105 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 159 transitions. [2019-12-18 11:53:00,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 11:53:00,105 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 11:53:00,105 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 11:53:00,106 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 11:53:00,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 11:53:00,106 INFO L82 PathProgramCache]: Analyzing trace with hash 322655978, now seen corresponding path program 1 times [2019-12-18 11:53:00,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 11:53:00,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267107690] [2019-12-18 11:53:00,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 11:53:00,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 11:53:00,169 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 11:53:00,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267107690] [2019-12-18 11:53:00,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 11:53:00,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 11:53:00,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555758191] [2019-12-18 11:53:00,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 11:53:00,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 11:53:00,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 11:53:00,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 11:53:00,171 INFO L87 Difference]: Start difference. First operand 81 states and 159 transitions. Second operand 3 states. [2019-12-18 11:53:00,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 11:53:00,176 INFO L93 Difference]: Finished difference Result 56 states and 119 transitions. [2019-12-18 11:53:00,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 11:53:00,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-18 11:53:00,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 11:53:00,177 INFO L225 Difference]: With dead ends: 56 [2019-12-18 11:53:00,177 INFO L226 Difference]: Without dead ends: 0 [2019-12-18 11:53:00,178 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 11:53:00,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-18 11:53:00,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-18 11:53:00,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-18 11:53:00,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-18 11:53:00,179 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2019-12-18 11:53:00,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 11:53:00,179 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-18 11:53:00,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 11:53:00,179 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-18 11:53:00,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-18 11:53:00,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 11:53:00 BasicIcfg [2019-12-18 11:53:00,184 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 11:53:00,186 INFO L168 Benchmark]: Toolchain (without parser) took 4276.71 ms. Allocated memory was 141.6 MB in the beginning and 257.9 MB in the end (delta: 116.4 MB). Free memory was 97.9 MB in the beginning and 143.4 MB in the end (delta: -45.5 MB). Peak memory consumption was 70.9 MB. Max. memory is 7.1 GB. [2019-12-18 11:53:00,187 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 141.6 MB. Free memory was 117.9 MB in the beginning and 117.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 11:53:00,188 INFO L168 Benchmark]: CACSL2BoogieTranslator took 692.12 ms. Allocated memory was 141.6 MB in the beginning and 198.2 MB in the end (delta: 56.6 MB). Free memory was 97.5 MB in the beginning and 157.6 MB in the end (delta: -60.1 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. [2019-12-18 11:53:00,189 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.24 ms. Allocated memory is still 198.2 MB. Free memory was 157.6 MB in the beginning and 155.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 11:53:00,189 INFO L168 Benchmark]: Boogie Preprocessor took 31.25 ms. Allocated memory is still 198.2 MB. Free memory was 155.6 MB in the beginning and 154.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2019-12-18 11:53:00,190 INFO L168 Benchmark]: RCFGBuilder took 494.71 ms. Allocated memory is still 198.2 MB. Free memory was 154.2 MB in the beginning and 131.7 MB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. [2019-12-18 11:53:00,191 INFO L168 Benchmark]: TraceAbstraction took 3003.67 ms. Allocated memory was 198.2 MB in the beginning and 257.9 MB in the end (delta: 59.8 MB). Free memory was 131.7 MB in the beginning and 143.4 MB in the end (delta: -11.7 MB). Peak memory consumption was 48.1 MB. Max. memory is 7.1 GB. [2019-12-18 11:53:00,195 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 141.6 MB. Free memory was 117.9 MB in the beginning and 117.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 692.12 ms. Allocated memory was 141.6 MB in the beginning and 198.2 MB in the end (delta: 56.6 MB). Free memory was 97.5 MB in the beginning and 157.6 MB in the end (delta: -60.1 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 50.24 ms. Allocated memory is still 198.2 MB. Free memory was 157.6 MB in the beginning and 155.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.25 ms. Allocated memory is still 198.2 MB. Free memory was 155.6 MB in the beginning and 154.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 494.71 ms. Allocated memory is still 198.2 MB. Free memory was 154.2 MB in the beginning and 131.7 MB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3003.67 ms. Allocated memory was 198.2 MB in the beginning and 257.9 MB in the end (delta: 59.8 MB). Free memory was 131.7 MB in the beginning and 143.4 MB in the end (delta: -11.7 MB). Peak memory consumption was 48.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.5s, 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.8s, 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...