/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-atomic/lamport.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 19:21:44,755 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 19:21:44,757 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 19:21:44,769 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 19:21:44,770 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 19:21:44,771 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 19:21:44,772 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 19:21:44,774 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 19:21:44,776 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 19:21:44,777 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 19:21:44,778 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 19:21:44,779 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 19:21:44,779 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 19:21:44,780 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 19:21:44,781 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 19:21:44,782 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 19:21:44,783 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 19:21:44,784 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 19:21:44,786 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 19:21:44,787 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 19:21:44,789 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 19:21:44,790 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 19:21:44,791 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 19:21:44,792 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 19:21:44,794 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 19:21:44,794 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 19:21:44,794 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 19:21:44,795 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 19:21:44,796 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 19:21:44,797 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 19:21:44,797 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 19:21:44,797 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 19:21:44,798 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 19:21:44,799 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 19:21:44,800 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 19:21:44,800 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 19:21:44,801 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 19:21:44,801 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 19:21:44,801 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 19:21:44,802 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 19:21:44,803 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 19:21:44,803 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 19:21:44,817 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 19:21:44,818 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 19:21:44,819 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 19:21:44,819 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 19:21:44,819 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 19:21:44,819 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 19:21:44,820 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 19:21:44,820 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 19:21:44,820 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 19:21:44,820 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 19:21:44,820 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 19:21:44,821 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 19:21:44,821 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 19:21:44,821 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 19:21:44,821 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 19:21:44,821 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 19:21:44,822 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 19:21:44,822 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 19:21:44,822 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 19:21:44,822 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 19:21:44,822 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 19:21:44,823 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 19:21:44,823 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 19:21:44,823 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 19:21:44,823 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 19:21:44,823 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 19:21:44,824 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 19:21:44,824 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 19:21:44,824 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 19:21:44,824 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 19:21:44,824 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 19:21:44,825 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 19:21:45,108 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 19:21:45,121 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 19:21:45,126 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 19:21:45,128 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 19:21:45,129 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 19:21:45,130 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 19:21:45,216 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/510069a8c/0e78d42921f1406c9021dcceb0537f3a/FLAG7d1c6c72e [2019-12-27 19:21:45,799 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 19:21:45,800 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/lamport.i [2019-12-27 19:21:45,814 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/510069a8c/0e78d42921f1406c9021dcceb0537f3a/FLAG7d1c6c72e [2019-12-27 19:21:46,045 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/510069a8c/0e78d42921f1406c9021dcceb0537f3a [2019-12-27 19:21:46,055 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 19:21:46,057 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 19:21:46,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 19:21:46,058 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 19:21:46,062 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 19:21:46,063 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:21:46" (1/1) ... [2019-12-27 19:21:46,066 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@286a4454 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:46, skipping insertion in model container [2019-12-27 19:21:46,066 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:21:46" (1/1) ... [2019-12-27 19:21:46,073 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 19:21:46,130 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 19:21:46,626 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:21:46,642 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 19:21:46,730 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:21:46,798 INFO L208 MainTranslator]: Completed translation [2019-12-27 19:21:46,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:46 WrapperNode [2019-12-27 19:21:46,799 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 19:21:46,800 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 19:21:46,800 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 19:21:46,800 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 19:21:46,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:46" (1/1) ... [2019-12-27 19:21:46,825 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:46" (1/1) ... [2019-12-27 19:21:46,847 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 19:21:46,848 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 19:21:46,848 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 19:21:46,848 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 19:21:46,859 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:46" (1/1) ... [2019-12-27 19:21:46,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:46" (1/1) ... [2019-12-27 19:21:46,862 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:46" (1/1) ... [2019-12-27 19:21:46,863 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:46" (1/1) ... [2019-12-27 19:21:46,869 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:46" (1/1) ... [2019-12-27 19:21:46,876 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:46" (1/1) ... [2019-12-27 19:21:46,878 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:46" (1/1) ... [2019-12-27 19:21:46,881 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 19:21:46,882 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 19:21:46,882 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 19:21:46,882 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 19:21:46,883 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:46" (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 19:21:46,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-27 19:21:46,948 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2019-12-27 19:21:46,949 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2019-12-27 19:21:46,949 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-12-27 19:21:46,950 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-12-27 19:21:46,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 19:21:46,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 19:21:46,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 19:21:46,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 19:21:46,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 19:21:46,953 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 19:21:47,401 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 19:21:47,402 INFO L287 CfgBuilder]: Removed 12 assume(true) statements. [2019-12-27 19:21:47,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:21:47 BoogieIcfgContainer [2019-12-27 19:21:47,403 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 19:21:47,407 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 19:21:47,407 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 19:21:47,411 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 19:21:47,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:21:46" (1/3) ... [2019-12-27 19:21:47,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59c73be0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:21:47, skipping insertion in model container [2019-12-27 19:21:47,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:21:46" (2/3) ... [2019-12-27 19:21:47,415 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59c73be0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:21:47, skipping insertion in model container [2019-12-27 19:21:47,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:21:47" (3/3) ... [2019-12-27 19:21:47,422 INFO L109 eAbstractionObserver]: Analyzing ICFG lamport.i [2019-12-27 19:21:47,433 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 19:21:47,434 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 19:21:47,448 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 19:21:47,449 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 19:21:47,483 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork1_#in~_.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:47,484 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork1_#in~_.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:47,484 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork1_~_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:47,485 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork1_~_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:47,486 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:47,486 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:47,489 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~_.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:47,489 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~_.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:47,490 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:47,490 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:47,491 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:47,491 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:47,502 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:47,503 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:47,503 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:47,503 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:47,516 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork1_~_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:47,516 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:47,516 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:47,517 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork1_~_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:21:47,542 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 19:21:47,568 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:21:47,568 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:21:47,569 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:21:47,569 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:21:47,569 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:21:47,569 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:21:47,570 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:21:47,570 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:21:47,592 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 103 transitions [2019-12-27 19:21:47,594 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 84 places, 103 transitions [2019-12-27 19:21:47,669 INFO L132 PetriNetUnfolder]: 25/103 cut-off events. [2019-12-27 19:21:47,670 INFO L133 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2019-12-27 19:21:47,682 INFO L76 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 103 events. 25/103 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 205 event pairs. 0/77 useless extension candidates. Maximal degree in co-relation 79. Up to 5 conditions per place. [2019-12-27 19:21:47,691 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 84 places, 103 transitions [2019-12-27 19:21:47,734 INFO L132 PetriNetUnfolder]: 25/103 cut-off events. [2019-12-27 19:21:47,735 INFO L133 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2019-12-27 19:21:47,738 INFO L76 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 103 events. 25/103 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 205 event pairs. 0/77 useless extension candidates. Maximal degree in co-relation 79. Up to 5 conditions per place. [2019-12-27 19:21:47,742 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 3196 [2019-12-27 19:21:47,743 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 19:21:48,696 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-12-27 19:21:48,787 INFO L206 etLargeBlockEncoding]: Checked pairs total: 11328 [2019-12-27 19:21:48,788 INFO L214 etLargeBlockEncoding]: Total number of compositions: 38 [2019-12-27 19:21:48,791 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 53 places, 65 transitions [2019-12-27 19:21:48,837 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 797 states. [2019-12-27 19:21:48,840 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states. [2019-12-27 19:21:48,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-27 19:21:48,847 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:48,848 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-27 19:21:48,848 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 19:21:48,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:48,855 INFO L82 PathProgramCache]: Analyzing trace with hash 13833324, now seen corresponding path program 1 times [2019-12-27 19:21:48,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:48,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220558359] [2019-12-27 19:21:48,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:49,012 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 19:21:49,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220558359] [2019-12-27 19:21:49,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:49,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:21:49,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1159512600] [2019-12-27 19:21:49,016 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:49,020 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:49,032 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 5 states and 4 transitions. [2019-12-27 19:21:49,032 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:49,035 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:21:49,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-27 19:21:49,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:49,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-27 19:21:49,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-27 19:21:49,048 INFO L87 Difference]: Start difference. First operand 797 states. Second operand 2 states. [2019-12-27 19:21:49,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:49,094 INFO L93 Difference]: Finished difference Result 797 states and 2314 transitions. [2019-12-27 19:21:49,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-27 19:21:49,096 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 4 [2019-12-27 19:21:49,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:49,123 INFO L225 Difference]: With dead ends: 797 [2019-12-27 19:21:49,123 INFO L226 Difference]: Without dead ends: 758 [2019-12-27 19:21:49,125 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 19:21:49,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2019-12-27 19:21:49,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 758. [2019-12-27 19:21:49,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2019-12-27 19:21:49,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 2229 transitions. [2019-12-27 19:21:49,245 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 2229 transitions. Word has length 4 [2019-12-27 19:21:49,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:49,245 INFO L462 AbstractCegarLoop]: Abstraction has 758 states and 2229 transitions. [2019-12-27 19:21:49,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-27 19:21:49,246 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 2229 transitions. [2019-12-27 19:21:49,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-27 19:21:49,247 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:49,248 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:21:49,248 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 19:21:49,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:49,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1620095088, now seen corresponding path program 1 times [2019-12-27 19:21:49,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:49,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668038756] [2019-12-27 19:21:49,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:49,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:49,358 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 19:21:49,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668038756] [2019-12-27 19:21:49,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:49,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:21:49,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1209032413] [2019-12-27 19:21:49,359 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:49,362 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:49,363 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 11 states and 10 transitions. [2019-12-27 19:21:49,363 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:49,364 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:21:49,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:21:49,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:49,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:21:49,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:21:49,366 INFO L87 Difference]: Start difference. First operand 758 states and 2229 transitions. Second operand 3 states. [2019-12-27 19:21:49,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:49,439 INFO L93 Difference]: Finished difference Result 761 states and 2195 transitions. [2019-12-27 19:21:49,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:21:49,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-27 19:21:49,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:49,446 INFO L225 Difference]: With dead ends: 761 [2019-12-27 19:21:49,446 INFO L226 Difference]: Without dead ends: 635 [2019-12-27 19:21:49,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:21:49,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-12-27 19:21:49,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 617. [2019-12-27 19:21:49,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-12-27 19:21:49,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 1829 transitions. [2019-12-27 19:21:49,499 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 1829 transitions. Word has length 10 [2019-12-27 19:21:49,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:49,499 INFO L462 AbstractCegarLoop]: Abstraction has 617 states and 1829 transitions. [2019-12-27 19:21:49,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:21:49,500 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 1829 transitions. [2019-12-27 19:21:49,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-27 19:21:49,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:49,507 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:21:49,507 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 19:21:49,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:49,508 INFO L82 PathProgramCache]: Analyzing trace with hash -563128116, now seen corresponding path program 1 times [2019-12-27 19:21:49,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:49,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907195944] [2019-12-27 19:21:49,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:49,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:49,587 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 19:21:49,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907195944] [2019-12-27 19:21:49,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:49,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:21:49,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [776572657] [2019-12-27 19:21:49,589 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:49,590 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:49,591 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 13 states and 12 transitions. [2019-12-27 19:21:49,591 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:49,592 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:21:49,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:21:49,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:49,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:21:49,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:21:49,593 INFO L87 Difference]: Start difference. First operand 617 states and 1829 transitions. Second operand 3 states. [2019-12-27 19:21:49,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:49,623 INFO L93 Difference]: Finished difference Result 596 states and 1750 transitions. [2019-12-27 19:21:49,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:21:49,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-12-27 19:21:49,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:49,630 INFO L225 Difference]: With dead ends: 596 [2019-12-27 19:21:49,630 INFO L226 Difference]: Without dead ends: 464 [2019-12-27 19:21:49,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:21:49,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-12-27 19:21:49,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2019-12-27 19:21:49,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-12-27 19:21:49,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1401 transitions. [2019-12-27 19:21:49,646 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1401 transitions. Word has length 12 [2019-12-27 19:21:49,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:49,648 INFO L462 AbstractCegarLoop]: Abstraction has 464 states and 1401 transitions. [2019-12-27 19:21:49,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:21:49,648 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1401 transitions. [2019-12-27 19:21:49,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 19:21:49,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:49,652 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 19:21:49,653 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 19:21:49,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:49,653 INFO L82 PathProgramCache]: Analyzing trace with hash -561689065, now seen corresponding path program 1 times [2019-12-27 19:21:49,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:49,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77514238] [2019-12-27 19:21:49,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:49,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:49,733 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 19:21:49,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77514238] [2019-12-27 19:21:49,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:49,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 19:21:49,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2101939737] [2019-12-27 19:21:49,737 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:49,738 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:49,747 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 53 states and 82 transitions. [2019-12-27 19:21:49,747 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:49,768 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 19:21:49,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 19:21:49,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:49,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 19:21:49,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 19:21:49,770 INFO L87 Difference]: Start difference. First operand 464 states and 1401 transitions. Second operand 6 states. [2019-12-27 19:21:49,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:49,898 INFO L93 Difference]: Finished difference Result 728 states and 1967 transitions. [2019-12-27 19:21:49,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:21:49,898 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-12-27 19:21:49,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:49,903 INFO L225 Difference]: With dead ends: 728 [2019-12-27 19:21:49,903 INFO L226 Difference]: Without dead ends: 590 [2019-12-27 19:21:49,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:21:49,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-12-27 19:21:49,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 516. [2019-12-27 19:21:49,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-12-27 19:21:49,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 1385 transitions. [2019-12-27 19:21:49,921 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 1385 transitions. Word has length 19 [2019-12-27 19:21:49,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:49,922 INFO L462 AbstractCegarLoop]: Abstraction has 516 states and 1385 transitions. [2019-12-27 19:21:49,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 19:21:49,922 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 1385 transitions. [2019-12-27 19:21:49,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 19:21:49,924 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:49,924 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 19:21:49,925 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 19:21:49,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:49,925 INFO L82 PathProgramCache]: Analyzing trace with hash 417736639, now seen corresponding path program 1 times [2019-12-27 19:21:49,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:49,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624517829] [2019-12-27 19:21:49,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:49,965 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 19:21:49,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624517829] [2019-12-27 19:21:49,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:49,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:21:49,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1789559681] [2019-12-27 19:21:49,967 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:49,968 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:49,971 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 56 states and 89 transitions. [2019-12-27 19:21:49,972 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:49,975 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 19:21:49,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:21:49,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:49,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:21:49,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:21:49,976 INFO L87 Difference]: Start difference. First operand 516 states and 1385 transitions. Second operand 3 states. [2019-12-27 19:21:50,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:50,025 INFO L93 Difference]: Finished difference Result 610 states and 1553 transitions. [2019-12-27 19:21:50,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:21:50,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-27 19:21:50,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:50,029 INFO L225 Difference]: With dead ends: 610 [2019-12-27 19:21:50,029 INFO L226 Difference]: Without dead ends: 462 [2019-12-27 19:21:50,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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 19:21:50,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-12-27 19:21:50,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 404. [2019-12-27 19:21:50,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2019-12-27 19:21:50,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 1002 transitions. [2019-12-27 19:21:50,044 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 1002 transitions. Word has length 19 [2019-12-27 19:21:50,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:50,044 INFO L462 AbstractCegarLoop]: Abstraction has 404 states and 1002 transitions. [2019-12-27 19:21:50,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:21:50,045 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 1002 transitions. [2019-12-27 19:21:50,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 19:21:50,046 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:50,046 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 19:21:50,046 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 19:21:50,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:50,047 INFO L82 PathProgramCache]: Analyzing trace with hash 962803841, now seen corresponding path program 2 times [2019-12-27 19:21:50,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:50,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635384397] [2019-12-27 19:21:50,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:50,090 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 19:21:50,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635384397] [2019-12-27 19:21:50,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:50,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:21:50,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [956992697] [2019-12-27 19:21:50,091 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:50,093 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:50,096 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 73 transitions. [2019-12-27 19:21:50,096 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:50,099 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 19:21:50,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:21:50,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:50,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:21:50,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:21:50,100 INFO L87 Difference]: Start difference. First operand 404 states and 1002 transitions. Second operand 3 states. [2019-12-27 19:21:50,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:50,139 INFO L93 Difference]: Finished difference Result 436 states and 1030 transitions. [2019-12-27 19:21:50,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:21:50,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-27 19:21:50,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:50,142 INFO L225 Difference]: With dead ends: 436 [2019-12-27 19:21:50,143 INFO L226 Difference]: Without dead ends: 320 [2019-12-27 19:21:50,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:21:50,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-12-27 19:21:50,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 294. [2019-12-27 19:21:50,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-12-27 19:21:50,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 683 transitions. [2019-12-27 19:21:50,156 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 683 transitions. Word has length 19 [2019-12-27 19:21:50,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:50,156 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 683 transitions. [2019-12-27 19:21:50,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:21:50,157 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 683 transitions. [2019-12-27 19:21:50,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 19:21:50,158 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:50,158 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] [2019-12-27 19:21:50,158 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 19:21:50,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:50,158 INFO L82 PathProgramCache]: Analyzing trace with hash -95552411, now seen corresponding path program 1 times [2019-12-27 19:21:50,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:50,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136953440] [2019-12-27 19:21:50,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:50,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:21:50,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136953440] [2019-12-27 19:21:50,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:50,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:21:50,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [364802780] [2019-12-27 19:21:50,229 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:50,231 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:50,235 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 65 states and 99 transitions. [2019-12-27 19:21:50,235 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:50,252 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 19:21:50,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:21:50,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:50,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:21:50,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:21:50,253 INFO L87 Difference]: Start difference. First operand 294 states and 683 transitions. Second operand 5 states. [2019-12-27 19:21:50,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:50,340 INFO L93 Difference]: Finished difference Result 356 states and 854 transitions. [2019-12-27 19:21:50,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 19:21:50,340 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 19:21:50,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:50,342 INFO L225 Difference]: With dead ends: 356 [2019-12-27 19:21:50,342 INFO L226 Difference]: Without dead ends: 288 [2019-12-27 19:21:50,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:21:50,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-12-27 19:21:50,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 234. [2019-12-27 19:21:50,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-27 19:21:50,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 538 transitions. [2019-12-27 19:21:50,352 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 538 transitions. Word has length 22 [2019-12-27 19:21:50,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:50,353 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 538 transitions. [2019-12-27 19:21:50,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:21:50,353 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 538 transitions. [2019-12-27 19:21:50,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 19:21:50,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:21:50,354 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] [2019-12-27 19:21:50,355 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 19:21:50,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:21:50,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1640844081, now seen corresponding path program 1 times [2019-12-27 19:21:50,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:21:50,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854533914] [2019-12-27 19:21:50,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:21:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:21:50,409 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 19:21:50,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854533914] [2019-12-27 19:21:50,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:21:50,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:21:50,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [215074116] [2019-12-27 19:21:50,423 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:21:50,424 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:21:50,429 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 65 states and 99 transitions. [2019-12-27 19:21:50,429 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:21:50,431 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:21:50,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:21:50,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:21:50,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:21:50,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:21:50,436 INFO L87 Difference]: Start difference. First operand 234 states and 538 transitions. Second operand 3 states. [2019-12-27 19:21:50,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:21:50,448 INFO L93 Difference]: Finished difference Result 152 states and 373 transitions. [2019-12-27 19:21:50,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:21:50,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-27 19:21:50,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:21:50,449 INFO L225 Difference]: With dead ends: 152 [2019-12-27 19:21:50,449 INFO L226 Difference]: Without dead ends: 0 [2019-12-27 19:21:50,450 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 19:21:50,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-27 19:21:50,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-27 19:21:50,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-27 19:21:50,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-27 19:21:50,451 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-12-27 19:21:50,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:21:50,451 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-27 19:21:50,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:21:50,451 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-27 19:21:50,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-27 19:21:50,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:21:50 BasicIcfg [2019-12-27 19:21:50,456 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 19:21:50,464 INFO L168 Benchmark]: Toolchain (without parser) took 4401.29 ms. Allocated memory was 145.2 MB in the beginning and 248.5 MB in the end (delta: 103.3 MB). Free memory was 101.1 MB in the beginning and 211.0 MB in the end (delta: -109.9 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 19:21:50,465 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 19:21:50,466 INFO L168 Benchmark]: CACSL2BoogieTranslator took 741.23 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 100.9 MB in the beginning and 161.6 MB in the end (delta: -60.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. [2019-12-27 19:21:50,467 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.55 ms. Allocated memory is still 201.9 MB. Free memory was 161.6 MB in the beginning and 159.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 19:21:50,468 INFO L168 Benchmark]: Boogie Preprocessor took 33.50 ms. Allocated memory is still 201.9 MB. Free memory was 159.6 MB in the beginning and 157.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 19:21:50,471 INFO L168 Benchmark]: RCFGBuilder took 522.00 ms. Allocated memory is still 201.9 MB. Free memory was 157.6 MB in the beginning and 134.1 MB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 7.1 GB. [2019-12-27 19:21:50,472 INFO L168 Benchmark]: TraceAbstraction took 3049.57 ms. Allocated memory was 201.9 MB in the beginning and 248.5 MB in the end (delta: 46.7 MB). Free memory was 134.1 MB in the beginning and 211.0 MB in the end (delta: -76.9 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 19:21:50,480 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.16 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 741.23 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 100.9 MB in the beginning and 161.6 MB in the end (delta: -60.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 47.55 ms. Allocated memory is still 201.9 MB. Free memory was 161.6 MB in the beginning and 159.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.50 ms. Allocated memory is still 201.9 MB. Free memory was 159.6 MB in the beginning and 157.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 522.00 ms. Allocated memory is still 201.9 MB. Free memory was 157.6 MB in the beginning and 134.1 MB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3049.57 ms. Allocated memory was 201.9 MB in the beginning and 248.5 MB in the end (delta: 46.7 MB). Free memory was 134.1 MB in the beginning and 211.0 MB in the end (delta: -76.9 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.1s, 84 ProgramPointsBefore, 53 ProgramPointsAfterwards, 103 TransitionsBefore, 65 TransitionsAfterwards, 3196 CoEnabledTransitionPairs, 6 FixpointIterations, 18 TrivialSequentialCompositions, 16 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 8 ChoiceCompositions, 1143 VarBasedMoverChecksPositive, 48 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 11328 CheckedPairsTotal, 38 TotalNumberOfCompositions - PositiveResult [Line: 723]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 697]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 78 locations, 2 error locations. Result: SAFE, OverallTime: 2.8s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 521 SDtfs, 356 SDslu, 382 SDs, 0 SdLazy, 167 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=797occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 230 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 127 NumberOfCodeBlocks, 127 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 119 ConstructedInterpolants, 0 QuantifiedInterpolants, 3491 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...