/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-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread-atomic/lamport.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 08:41:46,510 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 08:41:46,513 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 08:41:46,530 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 08:41:46,531 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 08:41:46,532 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 08:41:46,534 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 08:41:46,543 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 08:41:46,547 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 08:41:46,550 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 08:41:46,552 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 08:41:46,554 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 08:41:46,554 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 08:41:46,556 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 08:41:46,559 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 08:41:46,560 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 08:41:46,562 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 08:41:46,562 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 08:41:46,564 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 08:41:46,569 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 08:41:46,574 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 08:41:46,579 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 08:41:46,580 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 08:41:46,581 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 08:41:46,583 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 08:41:46,583 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 08:41:46,583 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 08:41:46,585 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 08:41:46,587 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 08:41:46,588 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 08:41:46,588 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 08:41:46,590 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 08:41:46,590 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 08:41:46,593 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 08:41:46,595 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 08:41:46,595 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 08:41:46,595 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 08:41:46,596 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 08:41:46,596 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 08:41:46,597 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 08:41:46,598 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 08:41:46,599 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-NoLbe.epf [2019-12-27 08:41:46,625 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 08:41:46,625 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 08:41:46,626 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 08:41:46,627 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 08:41:46,627 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 08:41:46,627 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 08:41:46,627 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 08:41:46,628 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 08:41:46,628 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 08:41:46,628 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 08:41:46,628 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 08:41:46,628 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 08:41:46,629 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 08:41:46,629 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 08:41:46,629 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 08:41:46,629 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 08:41:46,629 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 08:41:46,630 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 08:41:46,630 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 08:41:46,630 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 08:41:46,630 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 08:41:46,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 08:41:46,631 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 08:41:46,631 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 08:41:46,631 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 08:41:46,631 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 08:41:46,632 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 08:41:46,632 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-27 08:41:46,632 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 08:41:46,632 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 08:41:46,891 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 08:41:46,906 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 08:41:46,909 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 08:41:46,911 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 08:41:46,911 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 08:41:46,912 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/lamport.i [2019-12-27 08:41:46,982 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb8f42571/f066433190de434ab9bade2684ced2c9/FLAG74c2612f1 [2019-12-27 08:41:47,478 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 08:41:47,479 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/lamport.i [2019-12-27 08:41:47,490 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb8f42571/f066433190de434ab9bade2684ced2c9/FLAG74c2612f1 [2019-12-27 08:41:47,780 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb8f42571/f066433190de434ab9bade2684ced2c9 [2019-12-27 08:41:47,791 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 08:41:47,793 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 08:41:47,794 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 08:41:47,794 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 08:41:47,798 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 08:41:47,799 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:41:47" (1/1) ... [2019-12-27 08:41:47,801 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e512af8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:47, skipping insertion in model container [2019-12-27 08:41:47,802 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:41:47" (1/1) ... [2019-12-27 08:41:47,809 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 08:41:47,868 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 08:41:48,372 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 08:41:48,387 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 08:41:48,436 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 08:41:48,522 INFO L208 MainTranslator]: Completed translation [2019-12-27 08:41:48,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:48 WrapperNode [2019-12-27 08:41:48,522 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 08:41:48,523 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 08:41:48,523 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 08:41:48,523 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 08:41:48,530 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:48" (1/1) ... [2019-12-27 08:41:48,548 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:48" (1/1) ... [2019-12-27 08:41:48,575 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 08:41:48,576 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 08:41:48,576 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 08:41:48,576 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 08:41:48,586 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:48" (1/1) ... [2019-12-27 08:41:48,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:48" (1/1) ... [2019-12-27 08:41:48,589 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:48" (1/1) ... [2019-12-27 08:41:48,589 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:48" (1/1) ... [2019-12-27 08:41:48,595 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:48" (1/1) ... [2019-12-27 08:41:48,604 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:48" (1/1) ... [2019-12-27 08:41:48,607 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:48" (1/1) ... [2019-12-27 08:41:48,610 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 08:41:48,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 08:41:48,611 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 08:41:48,611 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 08:41:48,612 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 08:41:48,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-27 08:41:48,672 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2019-12-27 08:41:48,672 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2019-12-27 08:41:48,672 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-12-27 08:41:48,672 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-12-27 08:41:48,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 08:41:48,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 08:41:48,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 08:41:48,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 08:41:48,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 08:41:48,676 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 08:41:49,107 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 08:41:49,107 INFO L287 CfgBuilder]: Removed 12 assume(true) statements. [2019-12-27 08:41:49,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:41:49 BoogieIcfgContainer [2019-12-27 08:41:49,109 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 08:41:49,110 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 08:41:49,110 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 08:41:49,114 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 08:41:49,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:41:47" (1/3) ... [2019-12-27 08:41:49,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a7d0695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:41:49, skipping insertion in model container [2019-12-27 08:41:49,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:41:48" (2/3) ... [2019-12-27 08:41:49,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a7d0695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:41:49, skipping insertion in model container [2019-12-27 08:41:49,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:41:49" (3/3) ... [2019-12-27 08:41:49,122 INFO L109 eAbstractionObserver]: Analyzing ICFG lamport.i [2019-12-27 08:41:49,130 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 08:41:49,130 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 08:41:49,137 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 08:41:49,138 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 08:41:49,163 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork1_#in~_.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:49,164 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork1_#in~_.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:49,164 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork1_~_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:49,164 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork1_~_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:49,165 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:49,165 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:49,167 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~_.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:49,168 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~_.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:49,168 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:49,168 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:49,169 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:49,169 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:49,174 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:49,174 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:49,174 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:49,175 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:49,180 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork1_~_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:49,181 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:49,181 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:49,181 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork1_~_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:41:49,209 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 08:41:49,232 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 08:41:49,232 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 08:41:49,232 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 08:41:49,232 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 08:41:49,233 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 08:41:49,233 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 08:41:49,233 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 08:41:49,233 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 08:41:49,254 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 103 transitions [2019-12-27 08:41:49,360 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1817 states. [2019-12-27 08:41:49,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states. [2019-12-27 08:41:49,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 08:41:49,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:49,372 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:41:49,373 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:49,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:49,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1775298709, now seen corresponding path program 1 times [2019-12-27 08:41:49,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:49,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942083431] [2019-12-27 08:41:49,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:49,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:49,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:49,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942083431] [2019-12-27 08:41:49,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:41:49,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:41:49,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206262409] [2019-12-27 08:41:49,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-27 08:41:49,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:49,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-27 08:41:49,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-27 08:41:49,578 INFO L87 Difference]: Start difference. First operand 1817 states. Second operand 2 states. [2019-12-27 08:41:49,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:49,652 INFO L93 Difference]: Finished difference Result 1817 states and 5405 transitions. [2019-12-27 08:41:49,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-27 08:41:49,653 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2019-12-27 08:41:49,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:49,696 INFO L225 Difference]: With dead ends: 1817 [2019-12-27 08:41:49,696 INFO L226 Difference]: Without dead ends: 1703 [2019-12-27 08:41:49,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-27 08:41:49,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2019-12-27 08:41:49,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1703. [2019-12-27 08:41:49,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1703 states. [2019-12-27 08:41:49,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 5135 transitions. [2019-12-27 08:41:49,917 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 5135 transitions. Word has length 19 [2019-12-27 08:41:49,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:49,918 INFO L462 AbstractCegarLoop]: Abstraction has 1703 states and 5135 transitions. [2019-12-27 08:41:49,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-27 08:41:49,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 5135 transitions. [2019-12-27 08:41:49,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 08:41:49,921 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:49,921 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:41:49,922 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:49,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:49,922 INFO L82 PathProgramCache]: Analyzing trace with hash 49770655, now seen corresponding path program 1 times [2019-12-27 08:41:49,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:49,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634039120] [2019-12-27 08:41:49,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:49,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:50,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:50,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634039120] [2019-12-27 08:41:50,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:41:50,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:41:50,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9681231] [2019-12-27 08:41:50,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:41:50,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:50,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:41:50,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:41:50,029 INFO L87 Difference]: Start difference. First operand 1703 states and 5135 transitions. Second operand 3 states. [2019-12-27 08:41:50,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:50,072 INFO L93 Difference]: Finished difference Result 1688 states and 5004 transitions. [2019-12-27 08:41:50,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:41:50,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-27 08:41:50,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:50,084 INFO L225 Difference]: With dead ends: 1688 [2019-12-27 08:41:50,084 INFO L226 Difference]: Without dead ends: 1400 [2019-12-27 08:41:50,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:41:50,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2019-12-27 08:41:50,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1346. [2019-12-27 08:41:50,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1346 states. [2019-12-27 08:41:50,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 4070 transitions. [2019-12-27 08:41:50,133 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 4070 transitions. Word has length 25 [2019-12-27 08:41:50,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:50,134 INFO L462 AbstractCegarLoop]: Abstraction has 1346 states and 4070 transitions. [2019-12-27 08:41:50,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:41:50,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 4070 transitions. [2019-12-27 08:41:50,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 08:41:50,138 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:50,138 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:41:50,138 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:50,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:50,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1258497381, now seen corresponding path program 1 times [2019-12-27 08:41:50,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:50,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138056672] [2019-12-27 08:41:50,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:50,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:50,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138056672] [2019-12-27 08:41:50,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:41:50,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:41:50,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118471258] [2019-12-27 08:41:50,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:41:50,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:50,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:41:50,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:41:50,250 INFO L87 Difference]: Start difference. First operand 1346 states and 4070 transitions. Second operand 3 states. [2019-12-27 08:41:50,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:50,306 INFO L93 Difference]: Finished difference Result 1256 states and 3768 transitions. [2019-12-27 08:41:50,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:41:50,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-27 08:41:50,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:50,317 INFO L225 Difference]: With dead ends: 1256 [2019-12-27 08:41:50,318 INFO L226 Difference]: Without dead ends: 953 [2019-12-27 08:41:50,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:41:50,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2019-12-27 08:41:50,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 953. [2019-12-27 08:41:50,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2019-12-27 08:41:50,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 2915 transitions. [2019-12-27 08:41:50,361 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 2915 transitions. Word has length 28 [2019-12-27 08:41:50,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:50,363 INFO L462 AbstractCegarLoop]: Abstraction has 953 states and 2915 transitions. [2019-12-27 08:41:50,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:41:50,364 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 2915 transitions. [2019-12-27 08:41:50,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 08:41:50,372 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:50,372 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:41:50,373 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:50,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:50,373 INFO L82 PathProgramCache]: Analyzing trace with hash 676228912, now seen corresponding path program 1 times [2019-12-27 08:41:50,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:50,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951798081] [2019-12-27 08:41:50,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:50,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:50,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:50,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951798081] [2019-12-27 08:41:50,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:41:50,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:41:50,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738511192] [2019-12-27 08:41:50,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:41:50,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:50,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:41:50,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:41:50,499 INFO L87 Difference]: Start difference. First operand 953 states and 2915 transitions. Second operand 3 states. [2019-12-27 08:41:50,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:50,595 INFO L93 Difference]: Finished difference Result 1280 states and 3880 transitions. [2019-12-27 08:41:50,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:41:50,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-12-27 08:41:50,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:50,604 INFO L225 Difference]: With dead ends: 1280 [2019-12-27 08:41:50,604 INFO L226 Difference]: Without dead ends: 1019 [2019-12-27 08:41:50,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:41:50,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2019-12-27 08:41:50,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 968. [2019-12-27 08:41:50,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2019-12-27 08:41:50,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 2883 transitions. [2019-12-27 08:41:50,646 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 2883 transitions. Word has length 37 [2019-12-27 08:41:50,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:50,647 INFO L462 AbstractCegarLoop]: Abstraction has 968 states and 2883 transitions. [2019-12-27 08:41:50,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:41:50,647 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 2883 transitions. [2019-12-27 08:41:50,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 08:41:50,653 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:50,653 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:41:50,653 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:50,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:50,654 INFO L82 PathProgramCache]: Analyzing trace with hash 2110748096, now seen corresponding path program 2 times [2019-12-27 08:41:50,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:50,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647474520] [2019-12-27 08:41:50,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:50,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:50,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647474520] [2019-12-27 08:41:50,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:41:50,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:41:50,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570852247] [2019-12-27 08:41:50,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:41:50,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:50,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:41:50,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:41:50,751 INFO L87 Difference]: Start difference. First operand 968 states and 2883 transitions. Second operand 3 states. [2019-12-27 08:41:50,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:50,783 INFO L93 Difference]: Finished difference Result 1481 states and 4205 transitions. [2019-12-27 08:41:50,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:41:50,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-12-27 08:41:50,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:50,795 INFO L225 Difference]: With dead ends: 1481 [2019-12-27 08:41:50,795 INFO L226 Difference]: Without dead ends: 1481 [2019-12-27 08:41:50,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:41:50,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2019-12-27 08:41:50,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1067. [2019-12-27 08:41:50,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1067 states. [2019-12-27 08:41:50,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 3149 transitions. [2019-12-27 08:41:50,865 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 3149 transitions. Word has length 37 [2019-12-27 08:41:50,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:50,868 INFO L462 AbstractCegarLoop]: Abstraction has 1067 states and 3149 transitions. [2019-12-27 08:41:50,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:41:50,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 3149 transitions. [2019-12-27 08:41:50,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 08:41:50,871 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:50,871 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:41:50,871 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:50,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:50,872 INFO L82 PathProgramCache]: Analyzing trace with hash -2037849130, now seen corresponding path program 3 times [2019-12-27 08:41:50,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:50,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041734270] [2019-12-27 08:41:50,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:50,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:50,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:50,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041734270] [2019-12-27 08:41:50,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:41:50,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 08:41:50,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761510656] [2019-12-27 08:41:50,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 08:41:50,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:50,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 08:41:50,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:41:50,913 INFO L87 Difference]: Start difference. First operand 1067 states and 3149 transitions. Second operand 4 states. [2019-12-27 08:41:50,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:50,941 INFO L93 Difference]: Finished difference Result 1307 states and 3558 transitions. [2019-12-27 08:41:50,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:41:50,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-12-27 08:41:50,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:50,950 INFO L225 Difference]: With dead ends: 1307 [2019-12-27 08:41:50,951 INFO L226 Difference]: Without dead ends: 1298 [2019-12-27 08:41:50,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:41:50,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2019-12-27 08:41:50,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 986. [2019-12-27 08:41:50,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2019-12-27 08:41:50,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2774 transitions. [2019-12-27 08:41:50,983 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2774 transitions. Word has length 37 [2019-12-27 08:41:50,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:50,983 INFO L462 AbstractCegarLoop]: Abstraction has 986 states and 2774 transitions. [2019-12-27 08:41:50,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 08:41:50,984 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2774 transitions. [2019-12-27 08:41:50,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 08:41:50,986 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:50,986 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:41:50,986 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:50,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:50,987 INFO L82 PathProgramCache]: Analyzing trace with hash -795571246, now seen corresponding path program 1 times [2019-12-27 08:41:50,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:50,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909496408] [2019-12-27 08:41:50,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:51,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:51,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:51,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909496408] [2019-12-27 08:41:51,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:41:51,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:41:51,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526616710] [2019-12-27 08:41:51,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:41:51,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:51,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:41:51,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:41:51,029 INFO L87 Difference]: Start difference. First operand 986 states and 2774 transitions. Second operand 3 states. [2019-12-27 08:41:51,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:51,065 INFO L93 Difference]: Finished difference Result 863 states and 2227 transitions. [2019-12-27 08:41:51,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:41:51,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-12-27 08:41:51,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:51,070 INFO L225 Difference]: With dead ends: 863 [2019-12-27 08:41:51,070 INFO L226 Difference]: Without dead ends: 656 [2019-12-27 08:41:51,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:41:51,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2019-12-27 08:41:51,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 569. [2019-12-27 08:41:51,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2019-12-27 08:41:51,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 1425 transitions. [2019-12-27 08:41:51,085 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 1425 transitions. Word has length 37 [2019-12-27 08:41:51,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:51,086 INFO L462 AbstractCegarLoop]: Abstraction has 569 states and 1425 transitions. [2019-12-27 08:41:51,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:41:51,086 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 1425 transitions. [2019-12-27 08:41:51,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 08:41:51,088 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:51,088 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:41:51,088 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:51,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:51,088 INFO L82 PathProgramCache]: Analyzing trace with hash -914081305, now seen corresponding path program 1 times [2019-12-27 08:41:51,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:51,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559877153] [2019-12-27 08:41:51,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:51,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:51,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:51,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559877153] [2019-12-27 08:41:51,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:41:51,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:41:51,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987372225] [2019-12-27 08:41:51,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:41:51,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:51,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:41:51,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:41:51,117 INFO L87 Difference]: Start difference. First operand 569 states and 1425 transitions. Second operand 3 states. [2019-12-27 08:41:51,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:51,128 INFO L93 Difference]: Finished difference Result 545 states and 1361 transitions. [2019-12-27 08:41:51,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:41:51,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 08:41:51,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:51,132 INFO L225 Difference]: With dead ends: 545 [2019-12-27 08:41:51,133 INFO L226 Difference]: Without dead ends: 473 [2019-12-27 08:41:51,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:41:51,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-12-27 08:41:51,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 473. [2019-12-27 08:41:51,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2019-12-27 08:41:51,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 1178 transitions. [2019-12-27 08:41:51,145 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 1178 transitions. Word has length 40 [2019-12-27 08:41:51,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:51,146 INFO L462 AbstractCegarLoop]: Abstraction has 473 states and 1178 transitions. [2019-12-27 08:41:51,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:41:51,146 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 1178 transitions. [2019-12-27 08:41:51,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 08:41:51,147 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:41:51,148 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:41:51,148 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:41:51,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:41:51,148 INFO L82 PathProgramCache]: Analyzing trace with hash -463809077, now seen corresponding path program 1 times [2019-12-27 08:41:51,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:41:51,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069595175] [2019-12-27 08:41:51,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:41:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:41:51,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:41:51,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069595175] [2019-12-27 08:41:51,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:41:51,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:41:51,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632615643] [2019-12-27 08:41:51,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:41:51,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:41:51,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:41:51,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:41:51,182 INFO L87 Difference]: Start difference. First operand 473 states and 1178 transitions. Second operand 3 states. [2019-12-27 08:41:51,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:41:51,189 INFO L93 Difference]: Finished difference Result 314 states and 832 transitions. [2019-12-27 08:41:51,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:41:51,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 08:41:51,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:41:51,190 INFO L225 Difference]: With dead ends: 314 [2019-12-27 08:41:51,191 INFO L226 Difference]: Without dead ends: 0 [2019-12-27 08:41:51,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:41:51,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-27 08:41:51,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-27 08:41:51,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-27 08:41:51,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-27 08:41:51,192 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2019-12-27 08:41:51,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:41:51,192 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-27 08:41:51,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:41:51,193 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-27 08:41:51,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-27 08:41:51,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:41:51 BasicIcfg [2019-12-27 08:41:51,198 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 08:41:51,201 INFO L168 Benchmark]: Toolchain (without parser) took 3408.23 ms. Allocated memory was 138.4 MB in the beginning and 255.9 MB in the end (delta: 117.4 MB). Free memory was 101.6 MB in the beginning and 137.9 MB in the end (delta: -36.3 MB). Peak memory consumption was 81.2 MB. Max. memory is 7.1 GB. [2019-12-27 08:41:51,202 INFO L168 Benchmark]: CDTParser took 0.43 ms. Allocated memory is still 138.4 MB. Free memory is still 121.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 08:41:51,203 INFO L168 Benchmark]: CACSL2BoogieTranslator took 729.02 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.6 MB in the beginning and 163.1 MB in the end (delta: -61.5 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. [2019-12-27 08:41:51,204 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.37 ms. Allocated memory is still 202.9 MB. Free memory was 163.1 MB in the beginning and 161.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 08:41:51,205 INFO L168 Benchmark]: Boogie Preprocessor took 34.30 ms. Allocated memory is still 202.9 MB. Free memory was 161.2 MB in the beginning and 159.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 08:41:51,205 INFO L168 Benchmark]: RCFGBuilder took 498.74 ms. Allocated memory is still 202.9 MB. Free memory was 159.2 MB in the beginning and 135.5 MB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 7.1 GB. [2019-12-27 08:41:51,206 INFO L168 Benchmark]: TraceAbstraction took 2088.30 ms. Allocated memory was 202.9 MB in the beginning and 255.9 MB in the end (delta: 53.0 MB). Free memory was 135.5 MB in the beginning and 137.9 MB in the end (delta: -2.4 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. [2019-12-27 08:41:51,210 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.43 ms. Allocated memory is still 138.4 MB. Free memory is still 121.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 729.02 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.6 MB in the beginning and 163.1 MB in the end (delta: -61.5 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 52.37 ms. Allocated memory is still 202.9 MB. Free memory was 163.1 MB in the beginning and 161.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.30 ms. Allocated memory is still 202.9 MB. Free memory was 161.2 MB in the beginning and 159.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 498.74 ms. Allocated memory is still 202.9 MB. Free memory was 159.2 MB in the beginning and 135.5 MB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2088.30 ms. Allocated memory was 202.9 MB in the beginning and 255.9 MB in the end (delta: 53.0 MB). Free memory was 135.5 MB in the beginning and 137.9 MB in the end (delta: -2.4 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 723]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 697]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 78 locations, 2 error locations. Result: SAFE, OverallTime: 1.9s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 806 SDtfs, 290 SDslu, 513 SDs, 0 SdLazy, 92 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1817occurred 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.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 918 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 300 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 291 ConstructedInterpolants, 0 QuantifiedInterpolants, 13179 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...