/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-ext/13_unverif.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 20:54:49,583 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 20:54:49,586 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 20:54:49,604 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 20:54:49,604 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 20:54:49,605 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 20:54:49,606 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 20:54:49,608 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 20:54:49,609 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 20:54:49,610 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 20:54:49,611 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 20:54:49,612 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 20:54:49,613 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 20:54:49,613 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 20:54:49,614 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 20:54:49,615 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 20:54:49,616 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 20:54:49,617 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 20:54:49,621 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 20:54:49,624 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 20:54:49,626 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 20:54:49,630 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 20:54:49,632 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 20:54:49,633 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 20:54:49,638 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 20:54:49,638 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 20:54:49,638 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 20:54:49,640 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 20:54:49,640 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 20:54:49,641 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 20:54:49,641 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 20:54:49,645 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 20:54:49,646 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 20:54:49,647 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 20:54:49,648 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 20:54:49,648 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 20:54:49,648 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 20:54:49,649 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 20:54:49,650 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 20:54:49,652 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 20:54:49,653 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 20:54:49,654 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 20:54:49,667 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 20:54:49,668 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 20:54:49,669 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 20:54:49,669 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 20:54:49,669 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 20:54:49,669 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 20:54:49,670 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 20:54:49,670 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 20:54:49,670 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 20:54:49,670 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 20:54:49,670 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 20:54:49,671 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 20:54:49,671 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 20:54:49,671 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 20:54:49,671 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 20:54:49,671 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 20:54:49,671 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 20:54:49,672 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 20:54:49,672 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 20:54:49,672 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 20:54:49,672 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 20:54:49,672 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 20:54:49,673 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 20:54:49,673 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 20:54:49,673 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 20:54:49,673 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 20:54:49,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 20:54:49,674 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 20:54:49,674 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 20:54:49,674 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 20:54:49,982 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 20:54:50,006 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 20:54:50,009 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 20:54:50,010 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 20:54:50,010 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 20:54:50,011 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/13_unverif.i [2019-12-26 20:54:50,073 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c05e5bfd/34d5f9e57a0d4218933efbf094c3b349/FLAG123ffca1a [2019-12-26 20:54:50,639 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 20:54:50,640 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/13_unverif.i [2019-12-26 20:54:50,651 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c05e5bfd/34d5f9e57a0d4218933efbf094c3b349/FLAG123ffca1a [2019-12-26 20:54:50,964 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c05e5bfd/34d5f9e57a0d4218933efbf094c3b349 [2019-12-26 20:54:50,972 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 20:54:50,974 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 20:54:50,975 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 20:54:50,976 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 20:54:50,979 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 20:54:50,980 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 08:54:50" (1/1) ... [2019-12-26 20:54:50,983 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ad126e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:54:50, skipping insertion in model container [2019-12-26 20:54:50,983 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 08:54:50" (1/1) ... [2019-12-26 20:54:50,998 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 20:54:51,037 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 20:54:51,507 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 20:54:51,516 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 20:54:51,556 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 20:54:51,635 INFO L208 MainTranslator]: Completed translation [2019-12-26 20:54:51,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:54:51 WrapperNode [2019-12-26 20:54:51,635 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 20:54:51,636 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 20:54:51,636 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 20:54:51,636 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 20:54:51,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:54:51" (1/1) ... [2019-12-26 20:54:51,668 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:54:51" (1/1) ... [2019-12-26 20:54:51,694 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 20:54:51,695 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 20:54:51,695 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 20:54:51,695 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 20:54:51,702 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:54:51" (1/1) ... [2019-12-26 20:54:51,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:54:51" (1/1) ... [2019-12-26 20:54:51,704 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:54:51" (1/1) ... [2019-12-26 20:54:51,705 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:54:51" (1/1) ... [2019-12-26 20:54:51,709 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:54:51" (1/1) ... [2019-12-26 20:54:51,714 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:54:51" (1/1) ... [2019-12-26 20:54:51,715 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:54:51" (1/1) ... [2019-12-26 20:54:51,718 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 20:54:51,718 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 20:54:51,718 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 20:54:51,718 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 20:54:51,719 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:54:51" (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-26 20:54:51,779 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-12-26 20:54:51,779 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-12-26 20:54:51,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 20:54:51,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 20:54:51,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 20:54:51,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 20:54:51,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 20:54:51,781 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 20:54:51,911 INFO L1525 $ProcedureCfgBuilder]: dropping label inside atomic statement: __VERIFIER_atomic_inc_r_returnLabel [2019-12-26 20:54:52,062 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 20:54:52,063 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-12-26 20:54:52,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 08:54:52 BoogieIcfgContainer [2019-12-26 20:54:52,064 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 20:54:52,066 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 20:54:52,066 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 20:54:52,069 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 20:54:52,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 08:54:50" (1/3) ... [2019-12-26 20:54:52,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a9529a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 08:54:52, skipping insertion in model container [2019-12-26 20:54:52,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 08:54:51" (2/3) ... [2019-12-26 20:54:52,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a9529a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 08:54:52, skipping insertion in model container [2019-12-26 20:54:52,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 08:54:52" (3/3) ... [2019-12-26 20:54:52,073 INFO L109 eAbstractionObserver]: Analyzing ICFG 13_unverif.i [2019-12-26 20:54:52,083 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 20:54:52,084 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 20:54:52,090 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-26 20:54:52,091 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 20:54:52,114 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:52,115 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:52,115 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:52,116 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:52,116 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:52,117 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:52,117 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:52,117 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:52,118 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:52,118 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:52,118 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:52,123 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:52,123 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:52,123 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:52,124 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:52,124 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:52,143 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-12-26 20:54:52,159 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 20:54:52,160 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 20:54:52,160 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 20:54:52,160 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 20:54:52,160 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 20:54:52,160 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 20:54:52,161 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 20:54:52,161 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 20:54:52,172 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 31 transitions [2019-12-26 20:54:52,173 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 31 places, 31 transitions [2019-12-26 20:54:52,205 INFO L132 PetriNetUnfolder]: 4/39 cut-off events. [2019-12-26 20:54:52,206 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 20:54:52,211 INFO L76 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 39 events. 4/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 63 event pairs. 0/32 useless extension candidates. Maximal degree in co-relation 21. Up to 4 conditions per place. [2019-12-26 20:54:52,214 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 31 places, 31 transitions [2019-12-26 20:54:52,228 INFO L132 PetriNetUnfolder]: 4/39 cut-off events. [2019-12-26 20:54:52,228 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 20:54:52,230 INFO L76 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 39 events. 4/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 63 event pairs. 0/32 useless extension candidates. Maximal degree in co-relation 21. Up to 4 conditions per place. [2019-12-26 20:54:52,231 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 240 [2019-12-26 20:54:52,232 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 20:54:52,938 INFO L206 etLargeBlockEncoding]: Checked pairs total: 169 [2019-12-26 20:54:52,939 INFO L214 etLargeBlockEncoding]: Total number of compositions: 27 [2019-12-26 20:54:52,942 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 10 places, 10 transitions [2019-12-26 20:54:52,949 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 24 states. [2019-12-26 20:54:52,952 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-12-26 20:54:52,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-26 20:54:52,958 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:54:52,958 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-26 20:54:52,959 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-26 20:54:52,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:54:52,965 INFO L82 PathProgramCache]: Analyzing trace with hash 144192241, now seen corresponding path program 1 times [2019-12-26 20:54:52,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:54:52,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337722227] [2019-12-26 20:54:52,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:54:53,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:54:53,227 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-26 20:54:53,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337722227] [2019-12-26 20:54:53,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 20:54:53,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 20:54:53,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189382985] [2019-12-26 20:54:53,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 20:54:53,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:54:53,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 20:54:53,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 20:54:53,253 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 4 states. [2019-12-26 20:54:53,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:54:53,291 INFO L93 Difference]: Finished difference Result 23 states and 38 transitions. [2019-12-26 20:54:53,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 20:54:53,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-12-26 20:54:53,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:54:53,303 INFO L225 Difference]: With dead ends: 23 [2019-12-26 20:54:53,303 INFO L226 Difference]: Without dead ends: 23 [2019-12-26 20:54:53,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 20:54:53,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-12-26 20:54:53,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-12-26 20:54:53,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-26 20:54:53,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 38 transitions. [2019-12-26 20:54:53,341 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 38 transitions. Word has length 5 [2019-12-26 20:54:53,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:54:53,342 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 38 transitions. [2019-12-26 20:54:53,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 20:54:53,342 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2019-12-26 20:54:53,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-26 20:54:53,342 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:54:53,343 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-26 20:54:53,343 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-26 20:54:53,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:54:53,343 INFO L82 PathProgramCache]: Analyzing trace with hash 174992566, now seen corresponding path program 1 times [2019-12-26 20:54:53,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:54:53,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256271419] [2019-12-26 20:54:53,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:54:53,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:54:53,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:54:53,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256271419] [2019-12-26 20:54:53,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 20:54:53,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 20:54:53,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325355344] [2019-12-26 20:54:53,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 20:54:53,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:54:53,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 20:54:53,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 20:54:53,434 INFO L87 Difference]: Start difference. First operand 23 states and 38 transitions. Second operand 3 states. [2019-12-26 20:54:53,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:54:53,453 INFO L93 Difference]: Finished difference Result 19 states and 31 transitions. [2019-12-26 20:54:53,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 20:54:53,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-12-26 20:54:53,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:54:53,455 INFO L225 Difference]: With dead ends: 19 [2019-12-26 20:54:53,455 INFO L226 Difference]: Without dead ends: 19 [2019-12-26 20:54:53,456 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-26 20:54:53,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-12-26 20:54:53,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2019-12-26 20:54:53,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-12-26 20:54:53,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 24 transitions. [2019-12-26 20:54:53,460 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 24 transitions. Word has length 6 [2019-12-26 20:54:53,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:54:53,461 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 24 transitions. [2019-12-26 20:54:53,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 20:54:53,461 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 24 transitions. [2019-12-26 20:54:53,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-26 20:54:53,461 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:54:53,462 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-12-26 20:54:53,462 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-26 20:54:53,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:54:53,462 INFO L82 PathProgramCache]: Analyzing trace with hash 174947503, now seen corresponding path program 1 times [2019-12-26 20:54:53,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:54:53,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764746070] [2019-12-26 20:54:53,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:54:53,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 20:54:53,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 20:54:53,512 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 20:54:53,513 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 20:54:53,513 WARN L364 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-26 20:54:53,514 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2019-12-26 20:54:53,520 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:53,520 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:53,520 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:53,520 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:53,521 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:53,521 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:53,521 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:53,521 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:53,521 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:53,522 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:53,522 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:53,523 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:53,523 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:53,523 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:53,523 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:53,523 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:53,523 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:53,524 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:53,524 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:53,524 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:53,524 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:53,524 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:53,525 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:53,525 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:53,525 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:53,525 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:53,526 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:53,528 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:53,528 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:53,528 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:53,528 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:53,528 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:53,531 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-26 20:54:53,531 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 20:54:53,532 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 20:54:53,532 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 20:54:53,532 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 20:54:53,532 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 20:54:53,532 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 20:54:53,532 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 20:54:53,532 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 20:54:53,534 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 44 transitions [2019-12-26 20:54:53,535 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 44 places, 44 transitions [2019-12-26 20:54:53,551 INFO L132 PetriNetUnfolder]: 7/61 cut-off events. [2019-12-26 20:54:53,551 INFO L133 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2019-12-26 20:54:53,553 INFO L76 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 61 events. 7/61 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 124 event pairs. 0/49 useless extension candidates. Maximal degree in co-relation 40. Up to 6 conditions per place. [2019-12-26 20:54:53,556 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 44 places, 44 transitions [2019-12-26 20:54:53,571 INFO L132 PetriNetUnfolder]: 7/61 cut-off events. [2019-12-26 20:54:53,571 INFO L133 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2019-12-26 20:54:53,573 INFO L76 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 61 events. 7/61 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 124 event pairs. 0/49 useless extension candidates. Maximal degree in co-relation 40. Up to 6 conditions per place. [2019-12-26 20:54:53,576 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 792 [2019-12-26 20:54:53,576 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 20:54:54,271 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1434 [2019-12-26 20:54:54,271 INFO L214 etLargeBlockEncoding]: Total number of compositions: 29 [2019-12-26 20:54:54,271 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 19 places, 20 transitions [2019-12-26 20:54:54,282 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 208 states. [2019-12-26 20:54:54,282 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2019-12-26 20:54:54,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-26 20:54:54,283 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:54:54,284 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:54:54,284 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:54:54,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:54:54,284 INFO L82 PathProgramCache]: Analyzing trace with hash 569025362, now seen corresponding path program 1 times [2019-12-26 20:54:54,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:54:54,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950822677] [2019-12-26 20:54:54,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:54:54,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:54:54,417 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-26 20:54:54,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950822677] [2019-12-26 20:54:54,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 20:54:54,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 20:54:54,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092193710] [2019-12-26 20:54:54,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 20:54:54,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:54:54,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 20:54:54,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 20:54:54,420 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 5 states. [2019-12-26 20:54:54,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:54:54,513 INFO L93 Difference]: Finished difference Result 251 states and 667 transitions. [2019-12-26 20:54:54,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 20:54:54,514 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-12-26 20:54:54,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:54:54,526 INFO L225 Difference]: With dead ends: 251 [2019-12-26 20:54:54,526 INFO L226 Difference]: Without dead ends: 251 [2019-12-26 20:54:54,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 20:54:54,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-12-26 20:54:54,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 211. [2019-12-26 20:54:54,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-12-26 20:54:54,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 561 transitions. [2019-12-26 20:54:54,588 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 561 transitions. Word has length 7 [2019-12-26 20:54:54,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:54:54,588 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 561 transitions. [2019-12-26 20:54:54,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 20:54:54,589 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 561 transitions. [2019-12-26 20:54:54,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-26 20:54:54,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:54:54,594 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2019-12-26 20:54:54,595 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:54:54,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:54:54,595 INFO L82 PathProgramCache]: Analyzing trace with hash 424323391, now seen corresponding path program 1 times [2019-12-26 20:54:54,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:54:54,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139651634] [2019-12-26 20:54:54,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:54:54,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 20:54:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 20:54:54,645 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 20:54:54,649 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 20:54:54,649 WARN L364 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-26 20:54:54,649 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2019-12-26 20:54:54,661 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,661 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,661 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,662 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,662 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,662 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,662 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,663 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,663 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,663 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,663 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,663 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,664 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,664 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,664 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,664 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,664 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,664 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,665 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,665 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,666 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,666 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,666 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,666 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,667 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,667 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,667 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,667 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,667 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,667 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,668 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,668 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,668 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,668 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,669 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,669 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,669 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,669 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,672 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,672 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,672 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,673 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,673 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,675 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,675 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,676 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,676 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,676 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:54,678 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-26 20:54:54,678 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 20:54:54,678 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 20:54:54,679 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 20:54:54,679 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 20:54:54,679 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 20:54:54,679 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 20:54:54,679 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 20:54:54,679 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 20:54:54,681 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 57 transitions [2019-12-26 20:54:54,683 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 57 places, 57 transitions [2019-12-26 20:54:54,708 INFO L132 PetriNetUnfolder]: 10/83 cut-off events. [2019-12-26 20:54:54,709 INFO L133 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2019-12-26 20:54:54,711 INFO L76 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 83 events. 10/83 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 195 event pairs. 0/66 useless extension candidates. Maximal degree in co-relation 65. Up to 8 conditions per place. [2019-12-26 20:54:54,715 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 57 places, 57 transitions [2019-12-26 20:54:54,728 INFO L132 PetriNetUnfolder]: 10/83 cut-off events. [2019-12-26 20:54:54,729 INFO L133 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2019-12-26 20:54:54,731 INFO L76 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 83 events. 10/83 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 195 event pairs. 0/66 useless extension candidates. Maximal degree in co-relation 65. Up to 8 conditions per place. [2019-12-26 20:54:54,735 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1656 [2019-12-26 20:54:54,735 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 20:54:55,516 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3648 [2019-12-26 20:54:55,516 INFO L214 etLargeBlockEncoding]: Total number of compositions: 38 [2019-12-26 20:54:55,516 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 28 transitions [2019-12-26 20:54:55,572 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1252 states. [2019-12-26 20:54:55,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states. [2019-12-26 20:54:55,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-26 20:54:55,573 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:54:55,573 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:54:55,573 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:54:55,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:54:55,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1782709548, now seen corresponding path program 1 times [2019-12-26 20:54:55,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:54:55,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874262972] [2019-12-26 20:54:55,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:54:55,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:54:55,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:54:55,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874262972] [2019-12-26 20:54:55,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 20:54:55,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 20:54:55,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438448825] [2019-12-26 20:54:55,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 20:54:55,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:54:55,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 20:54:55,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 20:54:55,655 INFO L87 Difference]: Start difference. First operand 1252 states. Second operand 5 states. [2019-12-26 20:54:55,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:54:55,742 INFO L93 Difference]: Finished difference Result 1547 states and 5625 transitions. [2019-12-26 20:54:55,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 20:54:55,743 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-12-26 20:54:55,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:54:55,759 INFO L225 Difference]: With dead ends: 1547 [2019-12-26 20:54:55,760 INFO L226 Difference]: Without dead ends: 1547 [2019-12-26 20:54:55,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 20:54:55,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2019-12-26 20:54:55,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1213. [2019-12-26 20:54:55,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1213 states. [2019-12-26 20:54:55,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 4426 transitions. [2019-12-26 20:54:55,838 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 4426 transitions. Word has length 7 [2019-12-26 20:54:55,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:54:55,838 INFO L462 AbstractCegarLoop]: Abstraction has 1213 states and 4426 transitions. [2019-12-26 20:54:55,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 20:54:55,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 4426 transitions. [2019-12-26 20:54:55,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-26 20:54:55,841 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:54:55,841 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:54:55,841 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:54:55,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:54:55,842 INFO L82 PathProgramCache]: Analyzing trace with hash 508067418, now seen corresponding path program 1 times [2019-12-26 20:54:55,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:54:55,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762341643] [2019-12-26 20:54:55,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:54:55,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:54:55,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:54:55,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762341643] [2019-12-26 20:54:55,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 20:54:55,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 20:54:55,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748510180] [2019-12-26 20:54:55,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 20:54:55,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:54:55,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 20:54:55,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 20:54:55,968 INFO L87 Difference]: Start difference. First operand 1213 states and 4426 transitions. Second operand 4 states. [2019-12-26 20:54:56,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:54:56,071 INFO L93 Difference]: Finished difference Result 1516 states and 5554 transitions. [2019-12-26 20:54:56,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 20:54:56,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-26 20:54:56,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:54:56,085 INFO L225 Difference]: With dead ends: 1516 [2019-12-26 20:54:56,085 INFO L226 Difference]: Without dead ends: 1516 [2019-12-26 20:54:56,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 20:54:56,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2019-12-26 20:54:56,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1241. [2019-12-26 20:54:56,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1241 states. [2019-12-26 20:54:56,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 4558 transitions. [2019-12-26 20:54:56,135 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 4558 transitions. Word has length 9 [2019-12-26 20:54:56,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:54:56,136 INFO L462 AbstractCegarLoop]: Abstraction has 1241 states and 4558 transitions. [2019-12-26 20:54:56,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 20:54:56,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 4558 transitions. [2019-12-26 20:54:56,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-26 20:54:56,137 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:54:56,137 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:54:56,137 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:54:56,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:54:56,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1404558460, now seen corresponding path program 1 times [2019-12-26 20:54:56,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:54:56,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400704163] [2019-12-26 20:54:56,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:54:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:54:56,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-26 20:54:56,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400704163] [2019-12-26 20:54:56,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 20:54:56,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 20:54:56,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258126309] [2019-12-26 20:54:56,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 20:54:56,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:54:56,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 20:54:56,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 20:54:56,256 INFO L87 Difference]: Start difference. First operand 1241 states and 4558 transitions. Second operand 5 states. [2019-12-26 20:54:56,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:54:56,326 INFO L93 Difference]: Finished difference Result 1685 states and 6153 transitions. [2019-12-26 20:54:56,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 20:54:56,326 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-12-26 20:54:56,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:54:56,340 INFO L225 Difference]: With dead ends: 1685 [2019-12-26 20:54:56,341 INFO L226 Difference]: Without dead ends: 1685 [2019-12-26 20:54:56,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 20:54:56,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1685 states. [2019-12-26 20:54:56,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1685 to 1404. [2019-12-26 20:54:56,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1404 states. [2019-12-26 20:54:56,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 5142 transitions. [2019-12-26 20:54:56,395 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 5142 transitions. Word has length 10 [2019-12-26 20:54:56,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:54:56,397 INFO L462 AbstractCegarLoop]: Abstraction has 1404 states and 5142 transitions. [2019-12-26 20:54:56,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 20:54:56,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 5142 transitions. [2019-12-26 20:54:56,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-26 20:54:56,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:54:56,399 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:54:56,399 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:54:56,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:54:56,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1160945276, now seen corresponding path program 1 times [2019-12-26 20:54:56,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:54:56,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269352370] [2019-12-26 20:54:56,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:54:56,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:54:56,448 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-26 20:54:56,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269352370] [2019-12-26 20:54:56,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 20:54:56,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 20:54:56,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960847917] [2019-12-26 20:54:56,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 20:54:56,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:54:56,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 20:54:56,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 20:54:56,450 INFO L87 Difference]: Start difference. First operand 1404 states and 5142 transitions. Second operand 4 states. [2019-12-26 20:54:56,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:54:56,571 INFO L93 Difference]: Finished difference Result 1785 states and 6555 transitions. [2019-12-26 20:54:56,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 20:54:56,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-26 20:54:56,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:54:56,586 INFO L225 Difference]: With dead ends: 1785 [2019-12-26 20:54:56,586 INFO L226 Difference]: Without dead ends: 1785 [2019-12-26 20:54:56,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 20:54:56,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1785 states. [2019-12-26 20:54:56,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1785 to 1545. [2019-12-26 20:54:56,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1545 states. [2019-12-26 20:54:56,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 5692 transitions. [2019-12-26 20:54:56,643 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 5692 transitions. Word has length 12 [2019-12-26 20:54:56,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:54:56,644 INFO L462 AbstractCegarLoop]: Abstraction has 1545 states and 5692 transitions. [2019-12-26 20:54:56,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 20:54:56,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 5692 transitions. [2019-12-26 20:54:56,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-26 20:54:56,649 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:54:56,649 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2019-12-26 20:54:56,649 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:54:56,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:54:56,650 INFO L82 PathProgramCache]: Analyzing trace with hash -584245207, now seen corresponding path program 1 times [2019-12-26 20:54:56,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:54:56,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35432684] [2019-12-26 20:54:56,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:54:56,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 20:54:56,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 20:54:56,691 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 20:54:56,691 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 20:54:56,692 WARN L364 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-26 20:54:56,692 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2019-12-26 20:54:56,700 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,701 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,701 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,701 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,701 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,701 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,701 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,702 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,702 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,702 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,702 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,703 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,703 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,703 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,704 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,704 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,705 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,705 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,705 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,706 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,707 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,707 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,707 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,708 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,708 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,708 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,708 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,708 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,708 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,709 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,709 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,709 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,709 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,710 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,710 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,710 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,710 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,710 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,710 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,711 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,711 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,711 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,711 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,711 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,712 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,712 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,712 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,712 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,712 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,714 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,714 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,714 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,715 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,715 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,717 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,717 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,717 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,718 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,718 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,720 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,720 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,720 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,721 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,721 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:54:56,724 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 20:54:56,724 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 20:54:56,725 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 20:54:56,725 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 20:54:56,725 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 20:54:56,725 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 20:54:56,725 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 20:54:56,725 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 20:54:56,725 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 20:54:56,726 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 70 transitions [2019-12-26 20:54:56,728 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 70 places, 70 transitions [2019-12-26 20:54:56,758 INFO L132 PetriNetUnfolder]: 13/105 cut-off events. [2019-12-26 20:54:56,759 INFO L133 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2019-12-26 20:54:56,763 INFO L76 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 105 events. 13/105 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 266 event pairs. 0/83 useless extension candidates. Maximal degree in co-relation 92. Up to 10 conditions per place. [2019-12-26 20:54:56,769 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 70 places, 70 transitions [2019-12-26 20:54:56,804 INFO L132 PetriNetUnfolder]: 13/105 cut-off events. [2019-12-26 20:54:56,804 INFO L133 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2019-12-26 20:54:56,807 INFO L76 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 105 events. 13/105 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 266 event pairs. 0/83 useless extension candidates. Maximal degree in co-relation 92. Up to 10 conditions per place. [2019-12-26 20:54:56,812 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2832 [2019-12-26 20:54:56,812 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 20:54:57,803 INFO L206 etLargeBlockEncoding]: Checked pairs total: 6531 [2019-12-26 20:54:57,804 INFO L214 etLargeBlockEncoding]: Total number of compositions: 48 [2019-12-26 20:54:57,804 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 33 places, 37 transitions [2019-12-26 20:54:58,348 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 7516 states. [2019-12-26 20:54:58,349 INFO L276 IsEmpty]: Start isEmpty. Operand 7516 states. [2019-12-26 20:54:58,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-26 20:54:58,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:54:58,349 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:54:58,349 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-26 20:54:58,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:54:58,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1253735484, now seen corresponding path program 1 times [2019-12-26 20:54:58,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:54:58,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474572114] [2019-12-26 20:54:58,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:54:58,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:54:58,407 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-26 20:54:58,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474572114] [2019-12-26 20:54:58,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 20:54:58,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 20:54:58,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725265376] [2019-12-26 20:54:58,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 20:54:58,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:54:58,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 20:54:58,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 20:54:58,409 INFO L87 Difference]: Start difference. First operand 7516 states. Second operand 5 states. [2019-12-26 20:54:58,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:54:58,590 INFO L93 Difference]: Finished difference Result 8945 states and 41357 transitions. [2019-12-26 20:54:58,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 20:54:58,591 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-12-26 20:54:58,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:54:58,684 INFO L225 Difference]: With dead ends: 8945 [2019-12-26 20:54:58,685 INFO L226 Difference]: Without dead ends: 8945 [2019-12-26 20:54:58,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 20:54:58,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8945 states. [2019-12-26 20:54:59,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8945 to 6943. [2019-12-26 20:54:59,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6943 states. [2019-12-26 20:54:59,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6943 states to 6943 states and 32243 transitions. [2019-12-26 20:54:59,159 INFO L78 Accepts]: Start accepts. Automaton has 6943 states and 32243 transitions. Word has length 7 [2019-12-26 20:54:59,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:54:59,159 INFO L462 AbstractCegarLoop]: Abstraction has 6943 states and 32243 transitions. [2019-12-26 20:54:59,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 20:54:59,160 INFO L276 IsEmpty]: Start isEmpty. Operand 6943 states and 32243 transitions. [2019-12-26 20:54:59,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-26 20:54:59,160 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:54:59,160 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:54:59,160 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-26 20:54:59,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:54:59,161 INFO L82 PathProgramCache]: Analyzing trace with hash 2045994371, now seen corresponding path program 1 times [2019-12-26 20:54:59,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:54:59,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145592717] [2019-12-26 20:54:59,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:54:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:54:59,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:54:59,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145592717] [2019-12-26 20:54:59,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 20:54:59,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 20:54:59,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898347506] [2019-12-26 20:54:59,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 20:54:59,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:54:59,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 20:54:59,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 20:54:59,235 INFO L87 Difference]: Start difference. First operand 6943 states and 32243 transitions. Second operand 4 states. [2019-12-26 20:54:59,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:54:59,420 INFO L93 Difference]: Finished difference Result 9334 states and 43415 transitions. [2019-12-26 20:54:59,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 20:54:59,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-26 20:54:59,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:54:59,476 INFO L225 Difference]: With dead ends: 9334 [2019-12-26 20:54:59,476 INFO L226 Difference]: Without dead ends: 9334 [2019-12-26 20:54:59,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 20:54:59,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9334 states. [2019-12-26 20:55:00,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9334 to 7850. [2019-12-26 20:55:00,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7850 states. [2019-12-26 20:55:00,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7850 states to 7850 states and 36573 transitions. [2019-12-26 20:55:00,496 INFO L78 Accepts]: Start accepts. Automaton has 7850 states and 36573 transitions. Word has length 9 [2019-12-26 20:55:00,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:55:00,496 INFO L462 AbstractCegarLoop]: Abstraction has 7850 states and 36573 transitions. [2019-12-26 20:55:00,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 20:55:00,496 INFO L276 IsEmpty]: Start isEmpty. Operand 7850 states and 36573 transitions. [2019-12-26 20:55:00,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-26 20:55:00,497 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:55:00,497 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:55:00,497 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-26 20:55:00,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:55:00,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1685612685, now seen corresponding path program 1 times [2019-12-26 20:55:00,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:55:00,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098743517] [2019-12-26 20:55:00,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:55:00,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:55:00,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-26 20:55:00,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098743517] [2019-12-26 20:55:00,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 20:55:00,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 20:55:00,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211174040] [2019-12-26 20:55:00,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 20:55:00,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:55:00,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 20:55:00,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 20:55:00,544 INFO L87 Difference]: Start difference. First operand 7850 states and 36573 transitions. Second operand 5 states. [2019-12-26 20:55:00,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:55:00,693 INFO L93 Difference]: Finished difference Result 10343 states and 47933 transitions. [2019-12-26 20:55:00,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 20:55:00,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-12-26 20:55:00,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:55:00,746 INFO L225 Difference]: With dead ends: 10343 [2019-12-26 20:55:00,746 INFO L226 Difference]: Without dead ends: 10343 [2019-12-26 20:55:00,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 20:55:00,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10343 states. [2019-12-26 20:55:01,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10343 to 8547. [2019-12-26 20:55:01,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8547 states. [2019-12-26 20:55:01,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8547 states to 8547 states and 39726 transitions. [2019-12-26 20:55:01,224 INFO L78 Accepts]: Start accepts. Automaton has 8547 states and 39726 transitions. Word has length 10 [2019-12-26 20:55:01,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:55:01,224 INFO L462 AbstractCegarLoop]: Abstraction has 8547 states and 39726 transitions. [2019-12-26 20:55:01,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 20:55:01,225 INFO L276 IsEmpty]: Start isEmpty. Operand 8547 states and 39726 transitions. [2019-12-26 20:55:01,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-26 20:55:01,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:55:01,226 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:55:01,226 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-26 20:55:01,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:55:01,226 INFO L82 PathProgramCache]: Analyzing trace with hash -671121541, now seen corresponding path program 1 times [2019-12-26 20:55:01,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:55:01,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559816870] [2019-12-26 20:55:01,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:55:01,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:55:01,272 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-26 20:55:01,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559816870] [2019-12-26 20:55:01,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 20:55:01,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 20:55:01,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539483598] [2019-12-26 20:55:01,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 20:55:01,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:55:01,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 20:55:01,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 20:55:01,274 INFO L87 Difference]: Start difference. First operand 8547 states and 39726 transitions. Second operand 4 states. [2019-12-26 20:55:01,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:55:01,448 INFO L93 Difference]: Finished difference Result 11574 states and 53865 transitions. [2019-12-26 20:55:01,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 20:55:01,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-26 20:55:01,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:55:01,491 INFO L225 Difference]: With dead ends: 11574 [2019-12-26 20:55:01,492 INFO L226 Difference]: Without dead ends: 11574 [2019-12-26 20:55:01,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 20:55:01,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11574 states. [2019-12-26 20:55:01,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11574 to 10068. [2019-12-26 20:55:01,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10068 states. [2019-12-26 20:55:02,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10068 states to 10068 states and 46954 transitions. [2019-12-26 20:55:02,023 INFO L78 Accepts]: Start accepts. Automaton has 10068 states and 46954 transitions. Word has length 12 [2019-12-26 20:55:02,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:55:02,023 INFO L462 AbstractCegarLoop]: Abstraction has 10068 states and 46954 transitions. [2019-12-26 20:55:02,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 20:55:02,024 INFO L276 IsEmpty]: Start isEmpty. Operand 10068 states and 46954 transitions. [2019-12-26 20:55:02,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 20:55:02,025 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:55:02,025 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:55:02,025 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-26 20:55:02,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:55:02,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1258447422, now seen corresponding path program 1 times [2019-12-26 20:55:02,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:55:02,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675386176] [2019-12-26 20:55:02,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:55:02,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:55:02,092 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-26 20:55:02,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675386176] [2019-12-26 20:55:02,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 20:55:02,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 20:55:02,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401361451] [2019-12-26 20:55:02,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 20:55:02,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:55:02,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 20:55:02,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 20:55:02,095 INFO L87 Difference]: Start difference. First operand 10068 states and 46954 transitions. Second operand 5 states. [2019-12-26 20:55:02,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:55:02,241 INFO L93 Difference]: Finished difference Result 12128 states and 56330 transitions. [2019-12-26 20:55:02,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 20:55:02,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-26 20:55:02,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:55:02,273 INFO L225 Difference]: With dead ends: 12128 [2019-12-26 20:55:02,273 INFO L226 Difference]: Without dead ends: 12128 [2019-12-26 20:55:02,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 20:55:02,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12128 states. [2019-12-26 20:55:03,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12128 to 10579. [2019-12-26 20:55:03,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10579 states. [2019-12-26 20:55:03,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10579 states to 10579 states and 49194 transitions. [2019-12-26 20:55:03,660 INFO L78 Accepts]: Start accepts. Automaton has 10579 states and 49194 transitions. Word has length 13 [2019-12-26 20:55:03,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:55:03,660 INFO L462 AbstractCegarLoop]: Abstraction has 10579 states and 49194 transitions. [2019-12-26 20:55:03,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 20:55:03,661 INFO L276 IsEmpty]: Start isEmpty. Operand 10579 states and 49194 transitions. [2019-12-26 20:55:03,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 20:55:03,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:55:03,663 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:55:03,663 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-26 20:55:03,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:55:03,664 INFO L82 PathProgramCache]: Analyzing trace with hash -572546880, now seen corresponding path program 1 times [2019-12-26 20:55:03,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:55:03,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049961820] [2019-12-26 20:55:03,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:55:03,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:55:03,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-26 20:55:03,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049961820] [2019-12-26 20:55:03,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 20:55:03,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 20:55:03,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470383609] [2019-12-26 20:55:03,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 20:55:03,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:55:03,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 20:55:03,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 20:55:03,763 INFO L87 Difference]: Start difference. First operand 10579 states and 49194 transitions. Second operand 5 states. [2019-12-26 20:55:03,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:55:03,884 INFO L93 Difference]: Finished difference Result 2356 states and 8479 transitions. [2019-12-26 20:55:03,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 20:55:03,885 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-26 20:55:03,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:55:03,893 INFO L225 Difference]: With dead ends: 2356 [2019-12-26 20:55:03,894 INFO L226 Difference]: Without dead ends: 2356 [2019-12-26 20:55:03,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 20:55:03,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2356 states. [2019-12-26 20:55:03,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2356 to 1991. [2019-12-26 20:55:03,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1991 states. [2019-12-26 20:55:03,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1991 states to 1991 states and 7107 transitions. [2019-12-26 20:55:03,969 INFO L78 Accepts]: Start accepts. Automaton has 1991 states and 7107 transitions. Word has length 13 [2019-12-26 20:55:03,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:55:03,970 INFO L462 AbstractCegarLoop]: Abstraction has 1991 states and 7107 transitions. [2019-12-26 20:55:03,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 20:55:03,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1991 states and 7107 transitions. [2019-12-26 20:55:03,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 20:55:03,972 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:55:03,972 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2019-12-26 20:55:03,972 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-26 20:55:03,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:55:03,973 INFO L82 PathProgramCache]: Analyzing trace with hash -441088886, now seen corresponding path program 1 times [2019-12-26 20:55:03,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:55:03,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904057343] [2019-12-26 20:55:03,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:55:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 20:55:03,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 20:55:03,991 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 20:55:03,992 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 20:55:03,992 WARN L364 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-26 20:55:03,992 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2019-12-26 20:55:04,003 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,003 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,003 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,004 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,004 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,004 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,004 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,004 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,005 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,005 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,005 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,006 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,006 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,006 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,006 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,007 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,007 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,007 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,007 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,007 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,008 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,008 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,008 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,009 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,009 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,009 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,009 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,009 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,010 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,010 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,010 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,010 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,010 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,011 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,011 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,011 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,011 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,012 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,012 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,012 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,012 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,013 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,013 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,013 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,013 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,014 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,014 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,014 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,014 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,015 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,015 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,015 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,015 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,015 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,016 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,016 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,016 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,017 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,017 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,017 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,019 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,019 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,020 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,020 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,020 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,022 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,022 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,022 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,023 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,023 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,025 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,025 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,025 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,025 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,025 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,027 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,027 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,028 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,028 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,028 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:04,030 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-26 20:55:04,030 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 20:55:04,031 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 20:55:04,031 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 20:55:04,031 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 20:55:04,031 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 20:55:04,031 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 20:55:04,031 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 20:55:04,032 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 20:55:04,033 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 83 transitions [2019-12-26 20:55:04,033 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 83 places, 83 transitions [2019-12-26 20:55:04,054 INFO L132 PetriNetUnfolder]: 16/127 cut-off events. [2019-12-26 20:55:04,055 INFO L133 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2019-12-26 20:55:04,058 INFO L76 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 127 events. 16/127 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 336 event pairs. 0/100 useless extension candidates. Maximal degree in co-relation 121. Up to 12 conditions per place. [2019-12-26 20:55:04,066 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 83 places, 83 transitions [2019-12-26 20:55:04,083 INFO L132 PetriNetUnfolder]: 16/127 cut-off events. [2019-12-26 20:55:04,083 INFO L133 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2019-12-26 20:55:04,087 INFO L76 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 127 events. 16/127 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 336 event pairs. 0/100 useless extension candidates. Maximal degree in co-relation 121. Up to 12 conditions per place. [2019-12-26 20:55:04,098 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 4320 [2019-12-26 20:55:04,099 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 20:55:05,368 INFO L206 etLargeBlockEncoding]: Checked pairs total: 8881 [2019-12-26 20:55:05,368 INFO L214 etLargeBlockEncoding]: Total number of compositions: 55 [2019-12-26 20:55:05,369 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 43 transitions [2019-12-26 20:55:12,919 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 45100 states. [2019-12-26 20:55:12,920 INFO L276 IsEmpty]: Start isEmpty. Operand 45100 states. [2019-12-26 20:55:12,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-26 20:55:12,920 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:55:12,920 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:55:12,920 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:55:12,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:55:12,921 INFO L82 PathProgramCache]: Analyzing trace with hash 726122603, now seen corresponding path program 1 times [2019-12-26 20:55:12,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:55:12,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703267146] [2019-12-26 20:55:12,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:55:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:55:12,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-26 20:55:12,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703267146] [2019-12-26 20:55:12,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 20:55:12,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 20:55:12,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889678580] [2019-12-26 20:55:12,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 20:55:12,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:55:12,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 20:55:12,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 20:55:12,969 INFO L87 Difference]: Start difference. First operand 45100 states. Second operand 5 states. [2019-12-26 20:55:13,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:55:13,488 INFO L93 Difference]: Finished difference Result 50507 states and 283723 transitions. [2019-12-26 20:55:13,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 20:55:13,488 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-12-26 20:55:13,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:55:13,986 INFO L225 Difference]: With dead ends: 50507 [2019-12-26 20:55:13,986 INFO L226 Difference]: Without dead ends: 50507 [2019-12-26 20:55:13,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 20:55:14,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50507 states. [2019-12-26 20:55:17,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50507 to 39997. [2019-12-26 20:55:17,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39997 states. [2019-12-26 20:55:17,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39997 states to 39997 states and 225588 transitions. [2019-12-26 20:55:17,329 INFO L78 Accepts]: Start accepts. Automaton has 39997 states and 225588 transitions. Word has length 7 [2019-12-26 20:55:17,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:55:17,329 INFO L462 AbstractCegarLoop]: Abstraction has 39997 states and 225588 transitions. [2019-12-26 20:55:17,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 20:55:17,329 INFO L276 IsEmpty]: Start isEmpty. Operand 39997 states and 225588 transitions. [2019-12-26 20:55:17,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-26 20:55:17,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:55:17,330 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:55:17,330 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:55:17,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:55:17,330 INFO L82 PathProgramCache]: Analyzing trace with hash 2019106765, now seen corresponding path program 1 times [2019-12-26 20:55:17,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:55:17,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142520910] [2019-12-26 20:55:17,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:55:17,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:55:17,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:55:17,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142520910] [2019-12-26 20:55:17,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 20:55:17,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 20:55:17,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220150620] [2019-12-26 20:55:17,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 20:55:17,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:55:17,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 20:55:17,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 20:55:17,387 INFO L87 Difference]: Start difference. First operand 39997 states and 225588 transitions. Second operand 4 states. [2019-12-26 20:55:20,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:55:20,118 INFO L93 Difference]: Finished difference Result 56104 states and 316572 transitions. [2019-12-26 20:55:20,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 20:55:20,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-26 20:55:20,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:55:20,355 INFO L225 Difference]: With dead ends: 56104 [2019-12-26 20:55:20,355 INFO L226 Difference]: Without dead ends: 56104 [2019-12-26 20:55:20,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 20:55:20,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56104 states. [2019-12-26 20:55:21,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56104 to 48029. [2019-12-26 20:55:21,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48029 states. [2019-12-26 20:55:22,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48029 states to 48029 states and 271277 transitions. [2019-12-26 20:55:22,175 INFO L78 Accepts]: Start accepts. Automaton has 48029 states and 271277 transitions. Word has length 9 [2019-12-26 20:55:22,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:55:22,176 INFO L462 AbstractCegarLoop]: Abstraction has 48029 states and 271277 transitions. [2019-12-26 20:55:22,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 20:55:22,176 INFO L276 IsEmpty]: Start isEmpty. Operand 48029 states and 271277 transitions. [2019-12-26 20:55:22,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-26 20:55:22,176 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:55:22,177 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:55:22,177 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:55:22,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:55:22,177 INFO L82 PathProgramCache]: Analyzing trace with hash 112098818, now seen corresponding path program 1 times [2019-12-26 20:55:22,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:55:22,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828777565] [2019-12-26 20:55:22,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:55:22,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:55:22,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-26 20:55:22,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828777565] [2019-12-26 20:55:22,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 20:55:22,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 20:55:22,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292214944] [2019-12-26 20:55:22,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 20:55:22,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:55:22,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 20:55:22,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 20:55:22,220 INFO L87 Difference]: Start difference. First operand 48029 states and 271277 transitions. Second operand 5 states. [2019-12-26 20:55:23,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:55:23,314 INFO L93 Difference]: Finished difference Result 60653 states and 341167 transitions. [2019-12-26 20:55:23,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 20:55:23,314 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-12-26 20:55:23,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:55:23,535 INFO L225 Difference]: With dead ends: 60653 [2019-12-26 20:55:23,535 INFO L226 Difference]: Without dead ends: 60653 [2019-12-26 20:55:23,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 20:55:27,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60653 states. [2019-12-26 20:55:28,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60653 to 50928. [2019-12-26 20:55:28,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50928 states. [2019-12-26 20:55:28,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50928 states to 50928 states and 287199 transitions. [2019-12-26 20:55:28,281 INFO L78 Accepts]: Start accepts. Automaton has 50928 states and 287199 transitions. Word has length 10 [2019-12-26 20:55:28,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:55:28,281 INFO L462 AbstractCegarLoop]: Abstraction has 50928 states and 287199 transitions. [2019-12-26 20:55:28,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 20:55:28,281 INFO L276 IsEmpty]: Start isEmpty. Operand 50928 states and 287199 transitions. [2019-12-26 20:55:28,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-26 20:55:28,282 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:55:28,282 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:55:28,282 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:55:28,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:55:28,283 INFO L82 PathProgramCache]: Analyzing trace with hash 352805076, now seen corresponding path program 1 times [2019-12-26 20:55:28,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:55:28,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493992639] [2019-12-26 20:55:28,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:55:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:55:28,340 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-26 20:55:28,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493992639] [2019-12-26 20:55:28,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 20:55:28,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 20:55:28,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479769694] [2019-12-26 20:55:28,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 20:55:28,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:55:28,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 20:55:28,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 20:55:28,342 INFO L87 Difference]: Start difference. First operand 50928 states and 287199 transitions. Second operand 4 states. [2019-12-26 20:55:29,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:55:29,491 INFO L93 Difference]: Finished difference Result 71415 states and 402930 transitions. [2019-12-26 20:55:29,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 20:55:29,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-26 20:55:29,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:55:29,772 INFO L225 Difference]: With dead ends: 71415 [2019-12-26 20:55:29,772 INFO L226 Difference]: Without dead ends: 71415 [2019-12-26 20:55:29,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 20:55:30,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71415 states. [2019-12-26 20:55:32,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71415 to 62439. [2019-12-26 20:55:32,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62439 states. [2019-12-26 20:55:37,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62439 states to 62439 states and 352729 transitions. [2019-12-26 20:55:37,827 INFO L78 Accepts]: Start accepts. Automaton has 62439 states and 352729 transitions. Word has length 12 [2019-12-26 20:55:37,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:55:37,827 INFO L462 AbstractCegarLoop]: Abstraction has 62439 states and 352729 transitions. [2019-12-26 20:55:37,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 20:55:37,827 INFO L276 IsEmpty]: Start isEmpty. Operand 62439 states and 352729 transitions. [2019-12-26 20:55:37,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 20:55:37,828 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:55:37,828 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:55:37,828 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:55:37,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:55:37,828 INFO L82 PathProgramCache]: Analyzing trace with hash 2145715478, now seen corresponding path program 1 times [2019-12-26 20:55:37,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:55:37,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979803514] [2019-12-26 20:55:37,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:55:37,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:55:37,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:55:37,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979803514] [2019-12-26 20:55:37,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927111553] [2019-12-26 20:55:37,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:55:37,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:55:37,967 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-26 20:55:37,969 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-26 20:55:38,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 20:55:38,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-26 20:55:38,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2019-12-26 20:55:38,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842295152] [2019-12-26 20:55:38,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 20:55:38,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:55:38,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 20:55:38,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-26 20:55:38,034 INFO L87 Difference]: Start difference. First operand 62439 states and 352729 transitions. Second operand 9 states. [2019-12-26 20:55:38,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:55:38,430 INFO L93 Difference]: Finished difference Result 8460 states and 36312 transitions. [2019-12-26 20:55:38,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 20:55:38,431 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2019-12-26 20:55:38,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:55:38,449 INFO L225 Difference]: With dead ends: 8460 [2019-12-26 20:55:38,450 INFO L226 Difference]: Without dead ends: 8460 [2019-12-26 20:55:38,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-26 20:55:38,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8460 states. [2019-12-26 20:55:38,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8460 to 6538. [2019-12-26 20:55:38,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6538 states. [2019-12-26 20:55:38,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6538 states to 6538 states and 27580 transitions. [2019-12-26 20:55:38,592 INFO L78 Accepts]: Start accepts. Automaton has 6538 states and 27580 transitions. Word has length 13 [2019-12-26 20:55:38,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:55:38,593 INFO L462 AbstractCegarLoop]: Abstraction has 6538 states and 27580 transitions. [2019-12-26 20:55:38,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 20:55:38,593 INFO L276 IsEmpty]: Start isEmpty. Operand 6538 states and 27580 transitions. [2019-12-26 20:55:38,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 20:55:38,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:55:38,594 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:55:38,794 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-26 20:55:38,795 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:55:38,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:55:38,795 INFO L82 PathProgramCache]: Analyzing trace with hash 33841388, now seen corresponding path program 1 times [2019-12-26 20:55:38,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:55:38,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868389523] [2019-12-26 20:55:38,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:55:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:55:38,861 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-26 20:55:38,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868389523] [2019-12-26 20:55:38,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 20:55:38,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 20:55:38,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624411504] [2019-12-26 20:55:38,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 20:55:38,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:55:38,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 20:55:38,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 20:55:38,862 INFO L87 Difference]: Start difference. First operand 6538 states and 27580 transitions. Second operand 5 states. [2019-12-26 20:55:39,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:55:39,013 INFO L93 Difference]: Finished difference Result 11626 states and 49057 transitions. [2019-12-26 20:55:39,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 20:55:39,013 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-26 20:55:39,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:55:39,039 INFO L225 Difference]: With dead ends: 11626 [2019-12-26 20:55:39,039 INFO L226 Difference]: Without dead ends: 11626 [2019-12-26 20:55:39,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 20:55:39,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11626 states. [2019-12-26 20:55:39,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11626 to 7402. [2019-12-26 20:55:39,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7402 states. [2019-12-26 20:55:39,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7402 states to 7402 states and 31270 transitions. [2019-12-26 20:55:39,211 INFO L78 Accepts]: Start accepts. Automaton has 7402 states and 31270 transitions. Word has length 13 [2019-12-26 20:55:39,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:55:39,212 INFO L462 AbstractCegarLoop]: Abstraction has 7402 states and 31270 transitions. [2019-12-26 20:55:39,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 20:55:39,212 INFO L276 IsEmpty]: Start isEmpty. Operand 7402 states and 31270 transitions. [2019-12-26 20:55:39,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 20:55:39,213 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:55:39,213 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:55:39,213 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:55:39,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:55:39,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1838131737, now seen corresponding path program 1 times [2019-12-26 20:55:39,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:55:39,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223576463] [2019-12-26 20:55:39,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:55:39,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:55:39,275 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-26 20:55:39,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223576463] [2019-12-26 20:55:39,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 20:55:39,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 20:55:39,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33414358] [2019-12-26 20:55:39,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 20:55:39,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:55:39,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 20:55:39,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 20:55:39,279 INFO L87 Difference]: Start difference. First operand 7402 states and 31270 transitions. Second operand 4 states. [2019-12-26 20:55:39,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:55:39,367 INFO L93 Difference]: Finished difference Result 6970 states and 29425 transitions. [2019-12-26 20:55:39,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 20:55:39,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-26 20:55:39,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:55:39,385 INFO L225 Difference]: With dead ends: 6970 [2019-12-26 20:55:39,385 INFO L226 Difference]: Without dead ends: 6970 [2019-12-26 20:55:39,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 20:55:39,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6970 states. [2019-12-26 20:55:39,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6970 to 6106. [2019-12-26 20:55:39,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6106 states. [2019-12-26 20:55:39,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6106 states to 6106 states and 25735 transitions. [2019-12-26 20:55:39,504 INFO L78 Accepts]: Start accepts. Automaton has 6106 states and 25735 transitions. Word has length 15 [2019-12-26 20:55:39,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:55:39,504 INFO L462 AbstractCegarLoop]: Abstraction has 6106 states and 25735 transitions. [2019-12-26 20:55:39,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 20:55:39,504 INFO L276 IsEmpty]: Start isEmpty. Operand 6106 states and 25735 transitions. [2019-12-26 20:55:39,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 20:55:39,506 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:55:39,506 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:55:39,506 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:55:39,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:55:39,506 INFO L82 PathProgramCache]: Analyzing trace with hash 727939589, now seen corresponding path program 1 times [2019-12-26 20:55:39,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:55:39,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025070431] [2019-12-26 20:55:39,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:55:39,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:55:39,558 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-26 20:55:39,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025070431] [2019-12-26 20:55:39,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 20:55:39,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 20:55:39,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369710585] [2019-12-26 20:55:39,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 20:55:39,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:55:39,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 20:55:39,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 20:55:39,560 INFO L87 Difference]: Start difference. First operand 6106 states and 25735 transitions. Second operand 5 states. [2019-12-26 20:55:39,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 20:55:39,666 INFO L93 Difference]: Finished difference Result 10825 states and 45769 transitions. [2019-12-26 20:55:39,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 20:55:39,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-26 20:55:39,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 20:55:39,695 INFO L225 Difference]: With dead ends: 10825 [2019-12-26 20:55:39,695 INFO L226 Difference]: Without dead ends: 10825 [2019-12-26 20:55:39,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 20:55:39,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10825 states. [2019-12-26 20:55:39,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10825 to 6916. [2019-12-26 20:55:39,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6916 states. [2019-12-26 20:55:39,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6916 states to 6916 states and 29245 transitions. [2019-12-26 20:55:39,854 INFO L78 Accepts]: Start accepts. Automaton has 6916 states and 29245 transitions. Word has length 16 [2019-12-26 20:55:39,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 20:55:39,855 INFO L462 AbstractCegarLoop]: Abstraction has 6916 states and 29245 transitions. [2019-12-26 20:55:39,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 20:55:39,855 INFO L276 IsEmpty]: Start isEmpty. Operand 6916 states and 29245 transitions. [2019-12-26 20:55:39,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-26 20:55:39,857 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:55:39,858 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:55:39,858 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:55:39,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:55:39,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1525432798, now seen corresponding path program 1 times [2019-12-26 20:55:39,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:55:39,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925394397] [2019-12-26 20:55:39,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:55:39,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 20:55:39,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 20:55:39,873 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 20:55:39,873 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 20:55:39,874 WARN L364 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-26 20:55:39,874 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2019-12-26 20:55:39,882 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,882 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,882 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,883 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,883 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,883 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,883 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,883 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,883 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,884 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,884 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,884 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,884 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,884 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,884 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,885 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,885 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,885 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,885 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,885 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,885 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,885 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,886 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,886 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,886 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,886 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,886 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,886 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,886 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,887 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,887 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,887 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,887 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,887 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,887 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,887 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,888 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,888 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,888 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,888 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,888 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,888 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,888 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,889 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,889 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,889 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,889 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,889 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,889 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,890 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,890 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,890 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,890 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,890 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,890 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,891 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,891 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,891 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,891 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,891 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,891 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,891 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,892 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,892 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,892 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,892 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,892 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,893 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,893 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,893 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,893 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,903 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,903 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,904 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,904 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,904 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,905 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,905 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,906 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,906 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,906 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,907 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,907 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,907 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,908 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,908 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,909 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,909 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,909 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,910 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,910 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,911 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,911 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,911 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,912 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,912 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 20:55:39,913 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-26 20:55:39,913 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 20:55:39,913 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 20:55:39,914 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 20:55:39,914 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 20:55:39,914 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 20:55:39,914 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 20:55:39,914 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 20:55:39,914 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 20:55:39,915 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 96 transitions [2019-12-26 20:55:39,915 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 96 places, 96 transitions [2019-12-26 20:55:39,935 INFO L132 PetriNetUnfolder]: 19/149 cut-off events. [2019-12-26 20:55:39,935 INFO L133 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2019-12-26 20:55:39,939 INFO L76 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 149 events. 19/149 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 421 event pairs. 0/117 useless extension candidates. Maximal degree in co-relation 151. Up to 14 conditions per place. [2019-12-26 20:55:39,949 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 96 places, 96 transitions [2019-12-26 20:55:39,969 INFO L132 PetriNetUnfolder]: 19/149 cut-off events. [2019-12-26 20:55:39,969 INFO L133 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2019-12-26 20:55:39,973 INFO L76 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 149 events. 19/149 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 421 event pairs. 0/117 useless extension candidates. Maximal degree in co-relation 151. Up to 14 conditions per place. [2019-12-26 20:55:39,984 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 6120 [2019-12-26 20:55:39,984 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 20:55:40,276 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-12-26 20:55:41,484 INFO L206 etLargeBlockEncoding]: Checked pairs total: 13093 [2019-12-26 20:55:41,485 INFO L214 etLargeBlockEncoding]: Total number of compositions: 62 [2019-12-26 20:55:41,485 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 52 transitions [2019-12-26 20:58:45,563 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 270604 states. [2019-12-26 20:58:45,563 INFO L276 IsEmpty]: Start isEmpty. Operand 270604 states. [2019-12-26 20:58:45,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-26 20:58:45,564 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 20:58:45,564 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-26 20:58:45,564 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 20:58:45,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 20:58:45,564 INFO L82 PathProgramCache]: Analyzing trace with hash 604056706, now seen corresponding path program 1 times [2019-12-26 20:58:45,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 20:58:45,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388321675] [2019-12-26 20:58:45,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 20:58:45,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 20:58:45,607 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-26 20:58:45,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388321675] [2019-12-26 20:58:45,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 20:58:45,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 20:58:45,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580068278] [2019-12-26 20:58:45,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 20:58:45,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 20:58:45,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 20:58:45,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 20:58:45,609 INFO L87 Difference]: Start difference. First operand 270604 states. Second operand 5 states. Received shutdown request... [2019-12-26 20:58:56,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 20:58:56,365 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-26 20:58:56,369 WARN L227 ceAbstractionStarter]: Timeout [2019-12-26 20:58:56,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 08:58:56 BasicIcfg [2019-12-26 20:58:56,369 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 20:58:56,372 INFO L168 Benchmark]: Toolchain (without parser) took 245397.04 ms. Allocated memory was 138.9 MB in the beginning and 3.7 GB in the end (delta: 3.6 GB). Free memory was 102.0 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 3.1 GB. Max. memory is 7.1 GB. [2019-12-26 20:58:56,373 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-26 20:58:56,374 INFO L168 Benchmark]: CACSL2BoogieTranslator took 660.36 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 101.8 MB in the beginning and 162.9 MB in the end (delta: -61.1 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. [2019-12-26 20:58:56,375 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.42 ms. Allocated memory is still 202.9 MB. Free memory was 162.9 MB in the beginning and 160.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 20:58:56,376 INFO L168 Benchmark]: Boogie Preprocessor took 23.04 ms. Allocated memory is still 202.9 MB. Free memory was 160.3 MB in the beginning and 159.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-12-26 20:58:56,383 INFO L168 Benchmark]: RCFGBuilder took 346.29 ms. Allocated memory is still 202.9 MB. Free memory was 159.0 MB in the beginning and 143.4 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 7.1 GB. [2019-12-26 20:58:56,383 INFO L168 Benchmark]: TraceAbstraction took 244303.63 ms. Allocated memory was 202.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 142.7 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2019-12-26 20:58:56,390 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.50 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 660.36 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 101.8 MB in the beginning and 162.9 MB in the end (delta: -61.1 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.42 ms. Allocated memory is still 202.9 MB. Free memory was 162.9 MB in the beginning and 160.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.04 ms. Allocated memory is still 202.9 MB. Free memory was 160.3 MB in the beginning and 159.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 346.29 ms. Allocated memory is still 202.9 MB. Free memory was 159.0 MB in the beginning and 143.4 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 244303.63 ms. Allocated memory was 202.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 142.7 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.7s, 31 ProgramPointsBefore, 10 ProgramPointsAfterwards, 31 TransitionsBefore, 10 TransitionsAfterwards, 240 CoEnabledTransitionPairs, 5 FixpointIterations, 7 TrivialSequentialCompositions, 15 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 111 VarBasedMoverChecksPositive, 0 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 169 CheckedPairsTotal, 27 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.7s, 44 ProgramPointsBefore, 19 ProgramPointsAfterwards, 44 TransitionsBefore, 20 TransitionsAfterwards, 792 CoEnabledTransitionPairs, 5 FixpointIterations, 7 TrivialSequentialCompositions, 19 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 2 ChoiceCompositions, 410 VarBasedMoverChecksPositive, 23 VarBasedMoverChecksNegative, 8 SemBasedMoverChecksPositive, 20 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 1434 CheckedPairsTotal, 29 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.8s, 57 ProgramPointsBefore, 26 ProgramPointsAfterwards, 57 TransitionsBefore, 28 TransitionsAfterwards, 1656 CoEnabledTransitionPairs, 5 FixpointIterations, 7 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 790 VarBasedMoverChecksPositive, 43 VarBasedMoverChecksNegative, 12 SemBasedMoverChecksPositive, 39 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.2s, 0 MoverChecksTotal, 3648 CheckedPairsTotal, 38 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.0s, 70 ProgramPointsBefore, 33 ProgramPointsAfterwards, 70 TransitionsBefore, 37 TransitionsAfterwards, 2832 CoEnabledTransitionPairs, 4 FixpointIterations, 7 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 1398 VarBasedMoverChecksPositive, 94 VarBasedMoverChecksNegative, 54 SemBasedMoverChecksPositive, 59 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.4s, 0 MoverChecksTotal, 6531 CheckedPairsTotal, 48 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.3s, 83 ProgramPointsBefore, 40 ProgramPointsAfterwards, 83 TransitionsBefore, 43 TransitionsAfterwards, 4320 CoEnabledTransitionPairs, 4 FixpointIterations, 7 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 3 ChoiceCompositions, 1993 VarBasedMoverChecksPositive, 86 VarBasedMoverChecksNegative, 36 SemBasedMoverChecksPositive, 61 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.4s, 0 MoverChecksTotal, 8881 CheckedPairsTotal, 55 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.5s, 96 ProgramPointsBefore, 47 ProgramPointsAfterwards, 96 TransitionsBefore, 52 TransitionsAfterwards, 6120 CoEnabledTransitionPairs, 4 FixpointIterations, 7 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 2931 VarBasedMoverChecksPositive, 190 VarBasedMoverChecksNegative, 135 SemBasedMoverChecksPositive, 86 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.6s, 0 MoverChecksTotal, 13093 CheckedPairsTotal, 62 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 687]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 687). Cancelled while BasicCegarLoop was constructing difference of abstraction (270604states) and FLOYD_HOARE automaton (currently 5 states, 5 states before enhancement),while ReachableStatesComputation was computing reachable states (227933 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 1 error locations. Result: TIMEOUT, OverallTime: 196.4s, OverallIterations: 1, TraceHistogramMax: 1, AutomataDifference: 10.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 87 SDtfs, 84 SDslu, 114 SDs, 0 SdLazy, 96 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=270604occurred 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 7 NumberOfCodeBlocks, 7 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 6 ConstructedInterpolants, 0 QuantifiedInterpolants, 198 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 could not prove your program: Timeout Completed graceful shutdown