/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_74-tricky_address1_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 12:19:07,718 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 12:19:07,720 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 12:19:07,738 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 12:19:07,738 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 12:19:07,739 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 12:19:07,739 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 12:19:07,741 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 12:19:07,742 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 12:19:07,742 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 12:19:07,743 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 12:19:07,744 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 12:19:07,744 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 12:19:07,744 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 12:19:07,745 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 12:19:07,746 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 12:19:07,746 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 12:19:07,747 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 12:19:07,748 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 12:19:07,749 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 12:19:07,749 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 12:19:07,750 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 12:19:07,751 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 12:19:07,751 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 12:19:07,753 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 12:19:07,753 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 12:19:07,753 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 12:19:07,753 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 12:19:07,754 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 12:19:07,754 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 12:19:07,754 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 12:19:07,755 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 12:19:07,755 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 12:19:07,756 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 12:19:07,756 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 12:19:07,756 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 12:19:07,757 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 12:19:07,757 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 12:19:07,757 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 12:19:07,758 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 12:19:07,758 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 12:19:07,759 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf [2021-06-05 12:19:07,773 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 12:19:07,773 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 12:19:07,773 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 12:19:07,774 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 12:19:07,774 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 12:19:07,774 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 12:19:07,775 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 12:19:07,775 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 12:19:07,775 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 12:19:07,775 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 12:19:07,775 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 12:19:07,775 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 12:19:07,775 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 12:19:07,775 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 12:19:07,775 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 12:19:07,775 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 12:19:07,775 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 12:19:07,775 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 12:19:07,776 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 12:19:07,776 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 12:19:07,776 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 12:19:07,776 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 12:19:07,776 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 12:19:07,776 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 12:19:07,776 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 12:19:07,776 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 12:19:07,776 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 12:19:07,776 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 12:19:07,777 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 12:19:07,777 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 12:19:07,777 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 12:19:07,777 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2021-06-05 12:19:07,777 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-05 12:19:07,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 12:19:08,008 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 12:19:08,010 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 12:19:08,011 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 12:19:08,011 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 12:19:08,012 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_74-tricky_address1_racefree.i [2021-06-05 12:19:08,062 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/369f24d16/215c4e4e409846e6a18cfe659c27c490/FLAG8eb3ef104 [2021-06-05 12:19:08,466 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 12:19:08,466 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_74-tricky_address1_racefree.i [2021-06-05 12:19:08,492 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/369f24d16/215c4e4e409846e6a18cfe659c27c490/FLAG8eb3ef104 [2021-06-05 12:19:08,503 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/369f24d16/215c4e4e409846e6a18cfe659c27c490 [2021-06-05 12:19:08,505 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 12:19:08,506 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 12:19:08,513 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 12:19:08,513 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 12:19:08,516 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 12:19:08,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 12:19:08" (1/1) ... [2021-06-05 12:19:08,517 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5004b559 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:19:08, skipping insertion in model container [2021-06-05 12:19:08,517 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 12:19:08" (1/1) ... [2021-06-05 12:19:08,522 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 12:19:08,565 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 12:19:08,923 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_74-tricky_address1_racefree.i[41060,41073] [2021-06-05 12:19:08,948 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 12:19:08,965 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 12:19:08,995 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_74-tricky_address1_racefree.i[41060,41073] [2021-06-05 12:19:09,015 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 12:19:09,109 INFO L208 MainTranslator]: Completed translation [2021-06-05 12:19:09,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:19:09 WrapperNode [2021-06-05 12:19:09,110 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 12:19:09,111 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 12:19:09,111 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 12:19:09,111 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 12:19:09,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:19:09" (1/1) ... [2021-06-05 12:19:09,144 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:19:09" (1/1) ... [2021-06-05 12:19:09,160 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 12:19:09,161 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 12:19:09,161 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 12:19:09,161 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 12:19:09,166 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:19:09" (1/1) ... [2021-06-05 12:19:09,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:19:09" (1/1) ... [2021-06-05 12:19:09,169 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:19:09" (1/1) ... [2021-06-05 12:19:09,169 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:19:09" (1/1) ... [2021-06-05 12:19:09,174 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:19:09" (1/1) ... [2021-06-05 12:19:09,178 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:19:09" (1/1) ... [2021-06-05 12:19:09,180 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:19:09" (1/1) ... [2021-06-05 12:19:09,181 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 12:19:09,182 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 12:19:09,182 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 12:19:09,182 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 12:19:09,183 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:19:09" (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 [2021-06-05 12:19:09,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 12:19:09,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 12:19:09,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-06-05 12:19:09,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 12:19:09,255 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-06-05 12:19:09,255 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2021-06-05 12:19:09,255 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2021-06-05 12:19:09,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 12:19:09,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 12:19:09,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 12:19:09,257 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-05 12:19:09,724 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 12:19:09,725 INFO L299 CfgBuilder]: Removed 35 assume(true) statements. [2021-06-05 12:19:09,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 12:19:09 BoogieIcfgContainer [2021-06-05 12:19:09,726 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 12:19:09,728 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 12:19:09,728 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 12:19:09,730 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 12:19:09,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 12:19:08" (1/3) ... [2021-06-05 12:19:09,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@117d906e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 12:19:09, skipping insertion in model container [2021-06-05 12:19:09,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:19:09" (2/3) ... [2021-06-05 12:19:09,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@117d906e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 12:19:09, skipping insertion in model container [2021-06-05 12:19:09,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 12:19:09" (3/3) ... [2021-06-05 12:19:09,734 INFO L111 eAbstractionObserver]: Analyzing ICFG 28-race_reach_74-tricky_address1_racefree.i [2021-06-05 12:19:09,738 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 12:19:09,739 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 12:19:09,739 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-05 12:19:09,739 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 12:19:09,772 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,772 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,772 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,772 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,773 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,773 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,773 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,773 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,773 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,773 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,773 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,773 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,773 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,773 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,774 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,774 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,774 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,774 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,774 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,774 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,774 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,774 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,774 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,775 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,775 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,775 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,775 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,775 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,775 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,775 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,775 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,775 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,776 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,776 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,776 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,776 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,776 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,776 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,776 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,776 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,776 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,776 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,777 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,777 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,777 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,777 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,777 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,777 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,777 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,778 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,778 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,778 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,778 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,778 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,778 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,778 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,778 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,778 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,779 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,779 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,779 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,779 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,779 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,779 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,779 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,779 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,780 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,780 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,780 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,780 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,780 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,780 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,780 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,780 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,780 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,781 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,781 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,781 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,781 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,781 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,781 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,781 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,781 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,781 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,781 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,782 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,782 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,782 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,782 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,782 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,782 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,782 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,782 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,782 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,783 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,783 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,783 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,783 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,783 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,783 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,783 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,783 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,783 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,783 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,784 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,784 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,784 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,784 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,784 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,784 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,784 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,786 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,786 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,786 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,787 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,787 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,787 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,787 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,787 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,787 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,787 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,787 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,787 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,787 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,788 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,788 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,788 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,788 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,788 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,789 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,789 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,789 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,789 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,789 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,790 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,790 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,791 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,791 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,792 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,792 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,792 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,792 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,792 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,792 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,792 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,792 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,792 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,793 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,793 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,793 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,793 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,793 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,794 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,794 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,794 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,794 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,794 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,794 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:09,799 INFO L149 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2021-06-05 12:19:09,814 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-06-05 12:19:09,826 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 12:19:09,826 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 12:19:09,826 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 12:19:09,826 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 12:19:09,826 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 12:19:09,826 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 12:19:09,826 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 12:19:09,826 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 12:19:09,834 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 155 places, 183 transitions, 374 flow [2021-06-05 12:19:09,910 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3441 states, 3431 states have (on average 2.4054211600116586) internal successors, (8253), 3440 states have internal predecessors, (8253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:09,918 INFO L276 IsEmpty]: Start isEmpty. Operand has 3441 states, 3431 states have (on average 2.4054211600116586) internal successors, (8253), 3440 states have internal predecessors, (8253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:09,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-06-05 12:19:09,924 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:09,924 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:19:09,924 INFO L430 AbstractCegarLoop]: === Iteration 1 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:19:09,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:09,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1291964669, now seen corresponding path program 1 times [2021-06-05 12:19:09,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:09,933 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259084072] [2021-06-05 12:19:09,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:10,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:19:10,087 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:10,087 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259084072] [2021-06-05 12:19:10,087 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259084072] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:19:10,087 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:19:10,088 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 12:19:10,088 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347600713] [2021-06-05 12:19:10,091 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-05 12:19:10,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:10,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-05 12:19:10,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 12:19:10,106 INFO L87 Difference]: Start difference. First operand has 3441 states, 3431 states have (on average 2.4054211600116586) internal successors, (8253), 3440 states have internal predecessors, (8253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:10,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:19:10,144 INFO L93 Difference]: Finished difference Result 3325 states and 6561 transitions. [2021-06-05 12:19:10,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-05 12:19:10,145 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-06-05 12:19:10,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:19:10,160 INFO L225 Difference]: With dead ends: 3325 [2021-06-05 12:19:10,160 INFO L226 Difference]: Without dead ends: 2054 [2021-06-05 12:19:10,161 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 12:19:10,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2054 states. [2021-06-05 12:19:10,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2054 to 2054. [2021-06-05 12:19:10,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2054 states, 2047 states have (on average 1.9477283829995116) internal successors, (3987), 2053 states have internal predecessors, (3987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:10,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2054 states to 2054 states and 3987 transitions. [2021-06-05 12:19:10,261 INFO L78 Accepts]: Start accepts. Automaton has 2054 states and 3987 transitions. Word has length 42 [2021-06-05 12:19:10,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:10,261 INFO L482 AbstractCegarLoop]: Abstraction has 2054 states and 3987 transitions. [2021-06-05 12:19:10,262 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:10,262 INFO L276 IsEmpty]: Start isEmpty. Operand 2054 states and 3987 transitions. [2021-06-05 12:19:10,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-06-05 12:19:10,263 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:10,263 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:19:10,263 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 12:19:10,263 INFO L430 AbstractCegarLoop]: === Iteration 2 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:19:10,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:10,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1864530047, now seen corresponding path program 1 times [2021-06-05 12:19:10,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:10,264 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811541107] [2021-06-05 12:19:10,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:10,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:10,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:19:10,308 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:10,308 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811541107] [2021-06-05 12:19:10,309 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811541107] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:19:10,309 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:19:10,309 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 12:19:10,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605260030] [2021-06-05 12:19:10,309 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 12:19:10,310 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:10,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 12:19:10,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 12:19:10,310 INFO L87 Difference]: Start difference. First operand 2054 states and 3987 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:10,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:19:10,331 INFO L93 Difference]: Finished difference Result 2058 states and 3991 transitions. [2021-06-05 12:19:10,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 12:19:10,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-06-05 12:19:10,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:19:10,337 INFO L225 Difference]: With dead ends: 2058 [2021-06-05 12:19:10,337 INFO L226 Difference]: Without dead ends: 2058 [2021-06-05 12:19:10,338 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 12:19:10,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2058 states. [2021-06-05 12:19:10,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2058 to 2055. [2021-06-05 12:19:10,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2055 states, 2048 states have (on average 1.947265625) internal successors, (3988), 2054 states have internal predecessors, (3988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:10,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 3988 transitions. [2021-06-05 12:19:10,375 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 3988 transitions. Word has length 42 [2021-06-05 12:19:10,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:10,375 INFO L482 AbstractCegarLoop]: Abstraction has 2055 states and 3988 transitions. [2021-06-05 12:19:10,375 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:10,375 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 3988 transitions. [2021-06-05 12:19:10,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-06-05 12:19:10,376 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:10,376 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:19:10,376 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 12:19:10,376 INFO L430 AbstractCegarLoop]: === Iteration 3 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:19:10,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:10,377 INFO L82 PathProgramCache]: Analyzing trace with hash -404342279, now seen corresponding path program 1 times [2021-06-05 12:19:10,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:10,377 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957142553] [2021-06-05 12:19:10,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:10,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:19:10,419 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:10,419 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957142553] [2021-06-05 12:19:10,420 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957142553] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:10,420 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432339498] [2021-06-05 12:19:10,420 INFO L95 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 [2021-06-05 12:19:10,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:10,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 2 conjunts are in the unsatisfiable core [2021-06-05 12:19:10,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:19:10,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 12:19:10,601 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432339498] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:19:10,602 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:19:10,602 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-06-05 12:19:10,602 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291029996] [2021-06-05 12:19:10,602 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 12:19:10,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:10,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 12:19:10,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-05 12:19:10,604 INFO L87 Difference]: Start difference. First operand 2055 states and 3988 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:10,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:19:10,628 INFO L93 Difference]: Finished difference Result 2041 states and 3974 transitions. [2021-06-05 12:19:10,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 12:19:10,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-06-05 12:19:10,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:19:10,634 INFO L225 Difference]: With dead ends: 2041 [2021-06-05 12:19:10,634 INFO L226 Difference]: Without dead ends: 2041 [2021-06-05 12:19:10,634 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 11.0ms TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-05 12:19:10,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2041 states. [2021-06-05 12:19:10,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2041 to 2041. [2021-06-05 12:19:10,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2041 states, 2035 states have (on average 1.952825552825553) internal successors, (3974), 2040 states have internal predecessors, (3974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:10,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2041 states to 2041 states and 3974 transitions. [2021-06-05 12:19:10,666 INFO L78 Accepts]: Start accepts. Automaton has 2041 states and 3974 transitions. Word has length 47 [2021-06-05 12:19:10,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:10,666 INFO L482 AbstractCegarLoop]: Abstraction has 2041 states and 3974 transitions. [2021-06-05 12:19:10,666 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:10,666 INFO L276 IsEmpty]: Start isEmpty. Operand 2041 states and 3974 transitions. [2021-06-05 12:19:10,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-06-05 12:19:10,671 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:10,671 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:19:10,885 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-06-05 12:19:10,885 INFO L430 AbstractCegarLoop]: === Iteration 4 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:19:10,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:10,885 INFO L82 PathProgramCache]: Analyzing trace with hash -27244182, now seen corresponding path program 1 times [2021-06-05 12:19:10,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:10,886 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738790046] [2021-06-05 12:19:10,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:10,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:10,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 12:19:10,919 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:10,920 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738790046] [2021-06-05 12:19:10,920 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738790046] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:10,920 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171443383] [2021-06-05 12:19:10,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:19:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:10,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjunts are in the unsatisfiable core [2021-06-05 12:19:10,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:19:11,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 12:19:11,099 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171443383] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:11,099 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:19:11,100 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-06-05 12:19:11,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94882556] [2021-06-05 12:19:11,100 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 12:19:11,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:11,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 12:19:11,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 12:19:11,101 INFO L87 Difference]: Start difference. First operand 2041 states and 3974 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:11,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:19:11,199 INFO L93 Difference]: Finished difference Result 2049 states and 3982 transitions. [2021-06-05 12:19:11,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 12:19:11,199 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-06-05 12:19:11,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:19:11,205 INFO L225 Difference]: With dead ends: 2049 [2021-06-05 12:19:11,205 INFO L226 Difference]: Without dead ends: 2049 [2021-06-05 12:19:11,205 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 24.4ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:19:11,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2049 states. [2021-06-05 12:19:11,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2049 to 2046. [2021-06-05 12:19:11,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2046 states, 2040 states have (on average 1.9504901960784313) internal successors, (3979), 2045 states have internal predecessors, (3979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:11,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 2046 states and 3979 transitions. [2021-06-05 12:19:11,249 INFO L78 Accepts]: Start accepts. Automaton has 2046 states and 3979 transitions. Word has length 57 [2021-06-05 12:19:11,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:11,249 INFO L482 AbstractCegarLoop]: Abstraction has 2046 states and 3979 transitions. [2021-06-05 12:19:11,249 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:11,249 INFO L276 IsEmpty]: Start isEmpty. Operand 2046 states and 3979 transitions. [2021-06-05 12:19:11,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-06-05 12:19:11,250 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:11,250 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:19:11,468 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:19:11,469 INFO L430 AbstractCegarLoop]: === Iteration 5 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:19:11,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:11,469 INFO L82 PathProgramCache]: Analyzing trace with hash -553822222, now seen corresponding path program 2 times [2021-06-05 12:19:11,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:11,470 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651642901] [2021-06-05 12:19:11,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:11,510 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 12:19:11,510 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:11,510 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651642901] [2021-06-05 12:19:11,510 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651642901] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:11,510 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085153924] [2021-06-05 12:19:11,510 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:19:11,614 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:19:11,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:19:11,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjunts are in the unsatisfiable core [2021-06-05 12:19:11,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:19:11,743 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 12:19:11,743 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085153924] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:11,743 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:19:11,743 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-06-05 12:19:11,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481009181] [2021-06-05 12:19:11,745 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 12:19:11,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:11,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 12:19:11,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 12:19:11,746 INFO L87 Difference]: Start difference. First operand 2046 states and 3979 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:11,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:19:11,775 INFO L93 Difference]: Finished difference Result 476 states and 852 transitions. [2021-06-05 12:19:11,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 12:19:11,775 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-06-05 12:19:11,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:19:11,777 INFO L225 Difference]: With dead ends: 476 [2021-06-05 12:19:11,777 INFO L226 Difference]: Without dead ends: 296 [2021-06-05 12:19:11,777 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 25.3ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:19:11,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2021-06-05 12:19:11,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2021-06-05 12:19:11,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 1.7491525423728813) internal successors, (516), 295 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:11,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 516 transitions. [2021-06-05 12:19:11,782 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 516 transitions. Word has length 62 [2021-06-05 12:19:11,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:11,782 INFO L482 AbstractCegarLoop]: Abstraction has 296 states and 516 transitions. [2021-06-05 12:19:11,782 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:11,782 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 516 transitions. [2021-06-05 12:19:11,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-06-05 12:19:11,783 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:11,783 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:19:12,002 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:19:12,002 INFO L430 AbstractCegarLoop]: === Iteration 6 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:19:12,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:12,003 INFO L82 PathProgramCache]: Analyzing trace with hash 259801319, now seen corresponding path program 1 times [2021-06-05 12:19:12,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:12,003 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987266141] [2021-06-05 12:19:12,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:12,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:12,057 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:19:12,057 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:12,057 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987266141] [2021-06-05 12:19:12,057 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987266141] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:12,057 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161142324] [2021-06-05 12:19:12,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:19:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:12,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-05 12:19:12,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:19:12,253 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:19:12,253 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161142324] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:12,253 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:19:12,253 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 12:19:12,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464171199] [2021-06-05 12:19:12,254 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 12:19:12,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:12,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 12:19:12,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:19:12,254 INFO L87 Difference]: Start difference. First operand 296 states and 516 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:12,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:19:12,299 INFO L93 Difference]: Finished difference Result 304 states and 524 transitions. [2021-06-05 12:19:12,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 12:19:12,299 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-06-05 12:19:12,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:19:12,300 INFO L225 Difference]: With dead ends: 304 [2021-06-05 12:19:12,300 INFO L226 Difference]: Without dead ends: 304 [2021-06-05 12:19:12,301 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 51.2ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-06-05 12:19:12,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2021-06-05 12:19:12,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 301. [2021-06-05 12:19:12,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 1.7366666666666666) internal successors, (521), 300 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:12,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 521 transitions. [2021-06-05 12:19:12,305 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 521 transitions. Word has length 65 [2021-06-05 12:19:12,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:12,305 INFO L482 AbstractCegarLoop]: Abstraction has 301 states and 521 transitions. [2021-06-05 12:19:12,305 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:12,305 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 521 transitions. [2021-06-05 12:19:12,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-06-05 12:19:12,305 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:12,306 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:19:12,520 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:19:12,521 INFO L430 AbstractCegarLoop]: === Iteration 7 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:19:12,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:12,521 INFO L82 PathProgramCache]: Analyzing trace with hash -2054797457, now seen corresponding path program 2 times [2021-06-05 12:19:12,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:12,522 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755801751] [2021-06-05 12:19:12,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:12,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:12,579 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:19:12,580 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:12,580 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755801751] [2021-06-05 12:19:12,580 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755801751] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:12,580 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252038892] [2021-06-05 12:19:12,580 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:19:12,648 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 12:19:12,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:19:12,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-05 12:19:12,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:19:12,699 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 12:19:12,700 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:19:12,701 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:12,701 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:19:12,702 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:19:12,718 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-06-05 12:19:12,719 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:19:12,721 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:12,722 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:19:12,723 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:19:12,817 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:19:12,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 12:19:12,819 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:19:12,821 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:12,822 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:19:12,822 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:19:12,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:19:12,872 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:19:12,873 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:19:12,876 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:12,877 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:19:12,882 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:12,884 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:19:12,884 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:19:12,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-06-05 12:19:12,926 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:19:12,927 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:12,928 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:19:12,928 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-06-05 12:19:12,970 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-06-05 12:19:12,970 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252038892] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:19:12,970 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:19:12,970 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2021-06-05 12:19:12,970 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760488039] [2021-06-05 12:19:12,971 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 12:19:12,971 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:12,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 12:19:12,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-06-05 12:19:12,971 INFO L87 Difference]: Start difference. First operand 301 states and 521 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:13,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:19:13,142 INFO L93 Difference]: Finished difference Result 315 states and 529 transitions. [2021-06-05 12:19:13,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 12:19:13,143 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-06-05 12:19:13,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:19:13,143 INFO L225 Difference]: With dead ends: 315 [2021-06-05 12:19:13,143 INFO L226 Difference]: Without dead ends: 229 [2021-06-05 12:19:13,144 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 199.0ms TimeCoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2021-06-05 12:19:13,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-06-05 12:19:13,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2021-06-05 12:19:13,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.6535087719298245) internal successors, (377), 228 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:13,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 377 transitions. [2021-06-05 12:19:13,147 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 377 transitions. Word has length 70 [2021-06-05 12:19:13,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:13,149 INFO L482 AbstractCegarLoop]: Abstraction has 229 states and 377 transitions. [2021-06-05 12:19:13,149 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:13,149 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 377 transitions. [2021-06-05 12:19:13,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-06-05 12:19:13,149 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:13,149 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:19:13,356 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-06-05 12:19:13,357 INFO L430 AbstractCegarLoop]: === Iteration 8 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:19:13,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:13,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1710364682, now seen corresponding path program 1 times [2021-06-05 12:19:13,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:13,357 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532806172] [2021-06-05 12:19:13,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:13,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:13,415 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:19:13,415 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:13,416 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532806172] [2021-06-05 12:19:13,416 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532806172] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:13,416 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254741561] [2021-06-05 12:19:13,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:19:13,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:13,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 8 conjunts are in the unsatisfiable core [2021-06-05 12:19:13,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:19:13,607 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:19:13,607 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254741561] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:13,608 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:19:13,608 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2021-06-05 12:19:13,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383953356] [2021-06-05 12:19:13,608 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 12:19:13,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:13,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 12:19:13,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-06-05 12:19:13,609 INFO L87 Difference]: Start difference. First operand 229 states and 377 transitions. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:13,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:19:13,672 INFO L93 Difference]: Finished difference Result 237 states and 385 transitions. [2021-06-05 12:19:13,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 12:19:13,677 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-06-05 12:19:13,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:19:13,679 INFO L225 Difference]: With dead ends: 237 [2021-06-05 12:19:13,679 INFO L226 Difference]: Without dead ends: 237 [2021-06-05 12:19:13,679 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 61.0ms TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2021-06-05 12:19:13,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2021-06-05 12:19:13,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 234. [2021-06-05 12:19:13,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 1.6394849785407726) internal successors, (382), 233 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:13,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 382 transitions. [2021-06-05 12:19:13,683 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 382 transitions. Word has length 79 [2021-06-05 12:19:13,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:13,684 INFO L482 AbstractCegarLoop]: Abstraction has 234 states and 382 transitions. [2021-06-05 12:19:13,684 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:13,684 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 382 transitions. [2021-06-05 12:19:13,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-06-05 12:19:13,688 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:13,688 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:19:13,900 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:19:13,901 INFO L430 AbstractCegarLoop]: === Iteration 9 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:19:13,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:13,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1669992594, now seen corresponding path program 2 times [2021-06-05 12:19:13,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:13,901 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528664293] [2021-06-05 12:19:13,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:13,978 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:19:13,978 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:13,978 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528664293] [2021-06-05 12:19:13,978 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528664293] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:13,978 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098377510] [2021-06-05 12:19:13,978 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:19:14,072 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:19:14,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:19:14,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 12:19:14,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:19:14,191 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:19:14,191 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098377510] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:14,191 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:19:14,191 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2021-06-05 12:19:14,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825665387] [2021-06-05 12:19:14,191 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 12:19:14,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:14,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 12:19:14,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 12:19:14,192 INFO L87 Difference]: Start difference. First operand 234 states and 382 transitions. Second operand has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:14,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:19:14,272 INFO L93 Difference]: Finished difference Result 242 states and 390 transitions. [2021-06-05 12:19:14,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 12:19:14,273 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-06-05 12:19:14,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:19:14,274 INFO L225 Difference]: With dead ends: 242 [2021-06-05 12:19:14,274 INFO L226 Difference]: Without dead ends: 242 [2021-06-05 12:19:14,274 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 103.0ms TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2021-06-05 12:19:14,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-06-05 12:19:14,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 239. [2021-06-05 12:19:14,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 238 states have (on average 1.6260504201680672) internal successors, (387), 238 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:14,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 387 transitions. [2021-06-05 12:19:14,277 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 387 transitions. Word has length 84 [2021-06-05 12:19:14,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:14,277 INFO L482 AbstractCegarLoop]: Abstraction has 239 states and 387 transitions. [2021-06-05 12:19:14,277 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:14,277 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 387 transitions. [2021-06-05 12:19:14,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-06-05 12:19:14,278 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:14,278 INFO L521 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:19:14,494 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:19:14,495 INFO L430 AbstractCegarLoop]: === Iteration 10 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:19:14,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:14,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1715481866, now seen corresponding path program 3 times [2021-06-05 12:19:14,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:14,495 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049579595] [2021-06-05 12:19:14,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:14,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:14,603 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:19:14,603 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:14,603 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049579595] [2021-06-05 12:19:14,604 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049579595] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:14,604 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369090993] [2021-06-05 12:19:14,604 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:19:14,667 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 12:19:14,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:19:14,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 13 conjunts are in the unsatisfiable core [2021-06-05 12:19:14,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:19:14,687 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 12:19:14,687 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:19:14,689 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:14,689 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:19:14,689 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:19:14,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-06-05 12:19:14,701 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:19:14,703 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:14,704 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:19:14,704 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:19:14,771 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:19:14,771 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 12:19:14,774 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:19:14,776 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:14,777 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:19:14,777 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:19:14,806 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:19:14,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:19:14,810 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:19:14,813 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:14,814 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:19:14,817 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:14,818 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:19:14,819 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-05 12:19:14,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:19:14,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:19:14,903 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:19:14,906 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:14,906 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:19:14,910 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:14,912 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:19:14,912 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:19:14,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-06-05 12:19:14,933 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:19:14,935 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:14,936 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:19:14,936 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-06-05 12:19:14,979 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-06-05 12:19:14,979 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369090993] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:14,979 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:19:14,979 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2021-06-05 12:19:14,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299786806] [2021-06-05 12:19:14,980 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 12:19:14,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:14,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 12:19:14,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2021-06-05 12:19:14,980 INFO L87 Difference]: Start difference. First operand 239 states and 387 transitions. Second operand has 21 states, 21 states have (on average 6.523809523809524) internal successors, (137), 21 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:15,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:19:15,428 INFO L93 Difference]: Finished difference Result 243 states and 389 transitions. [2021-06-05 12:19:15,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-05 12:19:15,428 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.523809523809524) internal successors, (137), 21 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-06-05 12:19:15,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:19:15,428 INFO L225 Difference]: With dead ends: 243 [2021-06-05 12:19:15,429 INFO L226 Difference]: Without dead ends: 0 [2021-06-05 12:19:15,429 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 425.6ms TimeCoverageRelationStatistics Valid=360, Invalid=1362, Unknown=0, NotChecked=0, Total=1722 [2021-06-05 12:19:15,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-05 12:19:15,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-05 12:19:15,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:15,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-05 12:19:15,429 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 89 [2021-06-05 12:19:15,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:15,429 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-05 12:19:15,429 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 6.523809523809524) internal successors, (137), 21 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:15,430 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-05 12:19:15,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 12:19:15,644 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-06-05 12:19:15,645 INFO L315 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2021-06-05 12:19:15,646 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 12:19:15,647 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 12:19:15,647 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 12:19:15,647 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 12:19:15,647 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 12:19:15,647 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 12:19:15,647 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 12:19:15,647 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 12:19:15,647 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == InUseError======== [2021-06-05 12:19:15,649 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 155 places, 183 transitions, 374 flow [2021-06-05 12:19:15,686 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3441 states, 3431 states have (on average 2.4054211600116586) internal successors, (8253), 3440 states have internal predecessors, (8253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:15,690 INFO L276 IsEmpty]: Start isEmpty. Operand has 3441 states, 3431 states have (on average 2.4054211600116586) internal successors, (8253), 3440 states have internal predecessors, (8253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:15,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-06-05 12:19:15,691 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:15,691 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:19:15,691 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:19:15,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:15,691 INFO L82 PathProgramCache]: Analyzing trace with hash 922313015, now seen corresponding path program 1 times [2021-06-05 12:19:15,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:15,691 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947658321] [2021-06-05 12:19:15,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:15,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:15,701 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:19:15,701 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:15,701 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947658321] [2021-06-05 12:19:15,701 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947658321] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:19:15,701 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:19:15,701 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 12:19:15,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998554812] [2021-06-05 12:19:15,701 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-05 12:19:15,701 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:15,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-05 12:19:15,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 12:19:15,706 INFO L87 Difference]: Start difference. First operand has 3441 states, 3431 states have (on average 2.4054211600116586) internal successors, (8253), 3440 states have internal predecessors, (8253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:15,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:19:15,719 INFO L93 Difference]: Finished difference Result 3325 states and 6561 transitions. [2021-06-05 12:19:15,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-05 12:19:15,719 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-06-05 12:19:15,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:19:15,720 INFO L225 Difference]: With dead ends: 3325 [2021-06-05 12:19:15,721 INFO L226 Difference]: Without dead ends: 620 [2021-06-05 12:19:15,721 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 12:19:15,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2021-06-05 12:19:15,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2021-06-05 12:19:15,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 617 states have (on average 1.8654781199351702) internal successors, (1151), 619 states have internal predecessors, (1151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:15,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 1151 transitions. [2021-06-05 12:19:15,731 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 1151 transitions. Word has length 43 [2021-06-05 12:19:15,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:15,731 INFO L482 AbstractCegarLoop]: Abstraction has 620 states and 1151 transitions. [2021-06-05 12:19:15,731 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:15,731 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 1151 transitions. [2021-06-05 12:19:15,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-06-05 12:19:15,732 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:15,732 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:19:15,732 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 12:19:15,732 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:19:15,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:15,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1154896328, now seen corresponding path program 1 times [2021-06-05 12:19:15,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:15,732 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875899969] [2021-06-05 12:19:15,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:15,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:15,746 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:19:15,747 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:15,747 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875899969] [2021-06-05 12:19:15,747 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875899969] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:19:15,747 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:19:15,747 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 12:19:15,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028768920] [2021-06-05 12:19:15,747 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 12:19:15,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:15,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 12:19:15,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 12:19:15,748 INFO L87 Difference]: Start difference. First operand 620 states and 1151 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:15,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:19:15,756 INFO L93 Difference]: Finished difference Result 624 states and 1155 transitions. [2021-06-05 12:19:15,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 12:19:15,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-06-05 12:19:15,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:19:15,758 INFO L225 Difference]: With dead ends: 624 [2021-06-05 12:19:15,758 INFO L226 Difference]: Without dead ends: 624 [2021-06-05 12:19:15,758 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 12:19:15,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2021-06-05 12:19:15,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 621. [2021-06-05 12:19:15,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 618 states have (on average 1.8640776699029127) internal successors, (1152), 620 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:15,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 1152 transitions. [2021-06-05 12:19:15,768 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 1152 transitions. Word has length 43 [2021-06-05 12:19:15,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:15,768 INFO L482 AbstractCegarLoop]: Abstraction has 621 states and 1152 transitions. [2021-06-05 12:19:15,768 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:15,768 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 1152 transitions. [2021-06-05 12:19:15,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-06-05 12:19:15,769 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:15,769 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:19:15,769 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-05 12:19:15,769 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:19:15,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:15,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1161251520, now seen corresponding path program 1 times [2021-06-05 12:19:15,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:15,769 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612102625] [2021-06-05 12:19:15,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:15,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:15,801 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:19:15,801 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:15,802 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612102625] [2021-06-05 12:19:15,802 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612102625] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:15,802 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954166873] [2021-06-05 12:19:15,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:19:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:15,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 4 conjunts are in the unsatisfiable core [2021-06-05 12:19:15,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:19:15,914 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:19:15,914 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954166873] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:15,914 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:19:15,914 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-06-05 12:19:15,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538155273] [2021-06-05 12:19:15,915 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 12:19:15,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:15,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 12:19:15,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 12:19:15,916 INFO L87 Difference]: Start difference. First operand 621 states and 1152 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:15,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:19:15,941 INFO L93 Difference]: Finished difference Result 629 states and 1160 transitions. [2021-06-05 12:19:15,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 12:19:15,941 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-06-05 12:19:15,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:19:15,942 INFO L225 Difference]: With dead ends: 629 [2021-06-05 12:19:15,942 INFO L226 Difference]: Without dead ends: 629 [2021-06-05 12:19:15,943 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 20.7ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:19:15,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2021-06-05 12:19:15,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 626. [2021-06-05 12:19:15,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 623 states have (on average 1.8571428571428572) internal successors, (1157), 625 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:15,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 1157 transitions. [2021-06-05 12:19:15,951 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 1157 transitions. Word has length 48 [2021-06-05 12:19:15,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:15,951 INFO L482 AbstractCegarLoop]: Abstraction has 626 states and 1157 transitions. [2021-06-05 12:19:15,951 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:15,951 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 1157 transitions. [2021-06-05 12:19:15,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-06-05 12:19:15,951 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:15,951 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:19:16,160 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:19:16,161 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:19:16,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:16,161 INFO L82 PathProgramCache]: Analyzing trace with hash 392053560, now seen corresponding path program 2 times [2021-06-05 12:19:16,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:16,161 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355161611] [2021-06-05 12:19:16,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:16,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:16,190 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:19:16,190 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:16,191 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355161611] [2021-06-05 12:19:16,191 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355161611] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:16,191 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923429859] [2021-06-05 12:19:16,191 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:19:16,284 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:19:16,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:19:16,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-05 12:19:16,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:19:16,345 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:19:16,345 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923429859] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:16,345 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:19:16,345 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 12:19:16,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851246871] [2021-06-05 12:19:16,345 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 12:19:16,345 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:16,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 12:19:16,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:19:16,346 INFO L87 Difference]: Start difference. First operand 626 states and 1157 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:16,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:19:16,388 INFO L93 Difference]: Finished difference Result 634 states and 1165 transitions. [2021-06-05 12:19:16,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 12:19:16,388 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-06-05 12:19:16,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:19:16,390 INFO L225 Difference]: With dead ends: 634 [2021-06-05 12:19:16,390 INFO L226 Difference]: Without dead ends: 634 [2021-06-05 12:19:16,390 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 40.4ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-06-05 12:19:16,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2021-06-05 12:19:16,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 631. [2021-06-05 12:19:16,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 628 states have (on average 1.8503184713375795) internal successors, (1162), 630 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:16,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 1162 transitions. [2021-06-05 12:19:16,398 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 1162 transitions. Word has length 53 [2021-06-05 12:19:16,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:16,398 INFO L482 AbstractCegarLoop]: Abstraction has 631 states and 1162 transitions. [2021-06-05 12:19:16,398 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:16,398 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 1162 transitions. [2021-06-05 12:19:16,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-06-05 12:19:16,399 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:16,399 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:19:16,612 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:19:16,613 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:19:16,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:16,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1416112704, now seen corresponding path program 3 times [2021-06-05 12:19:16,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:16,614 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663840082] [2021-06-05 12:19:16,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:16,653 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:19:16,653 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:16,654 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663840082] [2021-06-05 12:19:16,654 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663840082] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:16,654 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441732996] [2021-06-05 12:19:16,654 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:19:16,728 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-06-05 12:19:16,728 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:19:16,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 8 conjunts are in the unsatisfiable core [2021-06-05 12:19:16,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:19:16,798 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:19:16,798 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441732996] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:16,798 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:19:16,798 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2021-06-05 12:19:16,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596699150] [2021-06-05 12:19:16,799 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 12:19:16,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:16,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 12:19:16,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-06-05 12:19:16,799 INFO L87 Difference]: Start difference. First operand 631 states and 1162 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:16,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:19:16,860 INFO L93 Difference]: Finished difference Result 639 states and 1170 transitions. [2021-06-05 12:19:16,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 12:19:16,861 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-06-05 12:19:16,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:19:16,862 INFO L225 Difference]: With dead ends: 639 [2021-06-05 12:19:16,862 INFO L226 Difference]: Without dead ends: 639 [2021-06-05 12:19:16,862 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 64.6ms TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2021-06-05 12:19:16,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2021-06-05 12:19:16,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 636. [2021-06-05 12:19:16,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 633 states have (on average 1.8436018957345972) internal successors, (1167), 635 states have internal predecessors, (1167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:16,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 1167 transitions. [2021-06-05 12:19:16,870 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 1167 transitions. Word has length 58 [2021-06-05 12:19:16,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:16,870 INFO L482 AbstractCegarLoop]: Abstraction has 636 states and 1167 transitions. [2021-06-05 12:19:16,870 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:16,870 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 1167 transitions. [2021-06-05 12:19:16,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 12:19:16,870 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:16,870 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:19:17,087 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-06-05 12:19:17,087 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:19:17,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:17,087 INFO L82 PathProgramCache]: Analyzing trace with hash -560162760, now seen corresponding path program 4 times [2021-06-05 12:19:17,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:17,088 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527631636] [2021-06-05 12:19:17,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:17,138 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:19:17,138 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:17,138 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527631636] [2021-06-05 12:19:17,139 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527631636] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:17,139 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859692193] [2021-06-05 12:19:17,139 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:19:17,190 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 12:19:17,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:19:17,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 12:19:17,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:19:17,267 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:19:17,268 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859692193] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:17,268 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:19:17,268 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2021-06-05 12:19:17,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224473278] [2021-06-05 12:19:17,268 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 12:19:17,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:17,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 12:19:17,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 12:19:17,269 INFO L87 Difference]: Start difference. First operand 636 states and 1167 transitions. Second operand has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:17,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:19:17,380 INFO L93 Difference]: Finished difference Result 644 states and 1175 transitions. [2021-06-05 12:19:17,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 12:19:17,382 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 12:19:17,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:19:17,383 INFO L225 Difference]: With dead ends: 644 [2021-06-05 12:19:17,383 INFO L226 Difference]: Without dead ends: 644 [2021-06-05 12:19:17,384 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 111.0ms TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2021-06-05 12:19:17,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2021-06-05 12:19:17,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 641. [2021-06-05 12:19:17,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 638 states have (on average 1.8369905956112853) internal successors, (1172), 640 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:17,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 1172 transitions. [2021-06-05 12:19:17,391 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 1172 transitions. Word has length 63 [2021-06-05 12:19:17,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:17,391 INFO L482 AbstractCegarLoop]: Abstraction has 641 states and 1172 transitions. [2021-06-05 12:19:17,391 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:17,391 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 1172 transitions. [2021-06-05 12:19:17,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-05 12:19:17,392 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:17,392 INFO L521 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:19:17,608 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-06-05 12:19:17,609 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:19:17,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:17,609 INFO L82 PathProgramCache]: Analyzing trace with hash -955866944, now seen corresponding path program 5 times [2021-06-05 12:19:17,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:17,609 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023249135] [2021-06-05 12:19:17,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:17,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:17,675 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:19:17,675 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:17,675 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023249135] [2021-06-05 12:19:17,675 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023249135] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:17,675 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77288381] [2021-06-05 12:19:17,675 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:19:17,756 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-06-05 12:19:17,756 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:19:17,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-05 12:19:17,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:19:17,839 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:19:17,839 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77288381] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:17,839 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:19:17,839 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2021-06-05 12:19:17,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482200530] [2021-06-05 12:19:17,840 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 12:19:17,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:17,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 12:19:17,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-06-05 12:19:17,840 INFO L87 Difference]: Start difference. First operand 641 states and 1172 transitions. Second operand has 15 states, 15 states have (on average 4.6) internal successors, (69), 15 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:17,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:19:17,948 INFO L93 Difference]: Finished difference Result 649 states and 1180 transitions. [2021-06-05 12:19:17,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 12:19:17,949 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.6) internal successors, (69), 15 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-06-05 12:19:17,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:19:17,950 INFO L225 Difference]: With dead ends: 649 [2021-06-05 12:19:17,950 INFO L226 Difference]: Without dead ends: 649 [2021-06-05 12:19:17,951 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 114.6ms TimeCoverageRelationStatistics Valid=196, Invalid=404, Unknown=0, NotChecked=0, Total=600 [2021-06-05 12:19:17,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2021-06-05 12:19:17,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 646. [2021-06-05 12:19:17,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 643 states have (on average 1.8304821150855366) internal successors, (1177), 645 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:17,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 1177 transitions. [2021-06-05 12:19:17,958 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 1177 transitions. Word has length 68 [2021-06-05 12:19:17,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:17,959 INFO L482 AbstractCegarLoop]: Abstraction has 646 states and 1177 transitions. [2021-06-05 12:19:17,959 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.6) internal successors, (69), 15 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:17,959 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 1177 transitions. [2021-06-05 12:19:17,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-06-05 12:19:17,959 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:17,959 INFO L521 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:19:18,176 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-06-05 12:19:18,177 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:19:18,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:18,179 INFO L82 PathProgramCache]: Analyzing trace with hash 531934520, now seen corresponding path program 6 times [2021-06-05 12:19:18,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:18,179 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104406449] [2021-06-05 12:19:18,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:18,277 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:19:18,277 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:18,278 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104406449] [2021-06-05 12:19:18,278 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104406449] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:18,278 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14642968] [2021-06-05 12:19:18,278 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:19:18,366 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2021-06-05 12:19:18,367 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:19:18,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 14 conjunts are in the unsatisfiable core [2021-06-05 12:19:18,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:19:18,479 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:19:18,479 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14642968] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:18,479 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:19:18,479 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2021-06-05 12:19:18,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785892404] [2021-06-05 12:19:18,480 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 12:19:18,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:18,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 12:19:18,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-06-05 12:19:18,480 INFO L87 Difference]: Start difference. First operand 646 states and 1177 transitions. Second operand has 17 states, 17 states have (on average 4.352941176470588) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:18,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:19:18,617 INFO L93 Difference]: Finished difference Result 654 states and 1185 transitions. [2021-06-05 12:19:18,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 12:19:18,617 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.352941176470588) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-06-05 12:19:18,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:19:18,620 INFO L225 Difference]: With dead ends: 654 [2021-06-05 12:19:18,620 INFO L226 Difference]: Without dead ends: 654 [2021-06-05 12:19:18,621 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 175.6ms TimeCoverageRelationStatistics Valid=263, Invalid=549, Unknown=0, NotChecked=0, Total=812 [2021-06-05 12:19:18,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2021-06-05 12:19:18,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 651. [2021-06-05 12:19:18,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 648 states have (on average 1.8240740740740742) internal successors, (1182), 650 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:18,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1182 transitions. [2021-06-05 12:19:18,628 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1182 transitions. Word has length 73 [2021-06-05 12:19:18,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:18,628 INFO L482 AbstractCegarLoop]: Abstraction has 651 states and 1182 transitions. [2021-06-05 12:19:18,628 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 4.352941176470588) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:18,628 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1182 transitions. [2021-06-05 12:19:18,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-06-05 12:19:18,629 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:18,629 INFO L521 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:19:18,844 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:19:18,845 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:19:18,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:18,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1253288896, now seen corresponding path program 7 times [2021-06-05 12:19:18,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:18,845 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217824969] [2021-06-05 12:19:18,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:18,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:18,944 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:19:18,944 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:18,944 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217824969] [2021-06-05 12:19:18,945 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217824969] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:18,945 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497346217] [2021-06-05 12:19:18,945 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:19:19,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:19,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 16 conjunts are in the unsatisfiable core [2021-06-05 12:19:19,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:19:19,106 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:19:19,106 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497346217] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:19,106 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:19:19,106 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2021-06-05 12:19:19,106 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644277748] [2021-06-05 12:19:19,107 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 12:19:19,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:19,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 12:19:19,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2021-06-05 12:19:19,107 INFO L87 Difference]: Start difference. First operand 651 states and 1182 transitions. Second operand has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 19 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:19,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:19:19,273 INFO L93 Difference]: Finished difference Result 659 states and 1190 transitions. [2021-06-05 12:19:19,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-05 12:19:19,273 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 19 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-06-05 12:19:19,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:19:19,275 INFO L225 Difference]: With dead ends: 659 [2021-06-05 12:19:19,275 INFO L226 Difference]: Without dead ends: 659 [2021-06-05 12:19:19,275 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 198.0ms TimeCoverageRelationStatistics Valid=340, Invalid=716, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 12:19:19,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2021-06-05 12:19:19,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 656. [2021-06-05 12:19:19,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 653 states have (on average 1.8177641653905054) internal successors, (1187), 655 states have internal predecessors, (1187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:19,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1187 transitions. [2021-06-05 12:19:19,282 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1187 transitions. Word has length 78 [2021-06-05 12:19:19,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:19,282 INFO L482 AbstractCegarLoop]: Abstraction has 656 states and 1187 transitions. [2021-06-05 12:19:19,282 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 19 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:19,283 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1187 transitions. [2021-06-05 12:19:19,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-06-05 12:19:19,283 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:19,283 INFO L521 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:19:19,499 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:19:19,499 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:19:19,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:19,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1518960072, now seen corresponding path program 8 times [2021-06-05 12:19:19,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:19,500 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830306582] [2021-06-05 12:19:19,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:19,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:19,632 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:19:19,632 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:19,632 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830306582] [2021-06-05 12:19:19,632 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830306582] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:19,632 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311270023] [2021-06-05 12:19:19,632 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:19:19,714 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:19:19,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:19:19,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 18 conjunts are in the unsatisfiable core [2021-06-05 12:19:19,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:19:19,846 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:19:19,846 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311270023] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:19,846 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:19:19,846 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 21 [2021-06-05 12:19:19,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807331681] [2021-06-05 12:19:19,847 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 12:19:19,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:19,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 12:19:19,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2021-06-05 12:19:19,847 INFO L87 Difference]: Start difference. First operand 656 states and 1187 transitions. Second operand has 21 states, 21 states have (on average 4.0) internal successors, (84), 21 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:20,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:19:20,022 INFO L93 Difference]: Finished difference Result 664 states and 1195 transitions. [2021-06-05 12:19:20,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 12:19:20,022 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.0) internal successors, (84), 21 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-06-05 12:19:20,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:19:20,024 INFO L225 Difference]: With dead ends: 664 [2021-06-05 12:19:20,024 INFO L226 Difference]: Without dead ends: 664 [2021-06-05 12:19:20,024 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 234.5ms TimeCoverageRelationStatistics Valid=427, Invalid=905, Unknown=0, NotChecked=0, Total=1332 [2021-06-05 12:19:20,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2021-06-05 12:19:20,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 661. [2021-06-05 12:19:20,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 658 states have (on average 1.8115501519756838) internal successors, (1192), 660 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:20,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 1192 transitions. [2021-06-05 12:19:20,031 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 1192 transitions. Word has length 83 [2021-06-05 12:19:20,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:20,031 INFO L482 AbstractCegarLoop]: Abstraction has 661 states and 1192 transitions. [2021-06-05 12:19:20,032 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 4.0) internal successors, (84), 21 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:20,032 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 1192 transitions. [2021-06-05 12:19:20,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-06-05 12:19:20,032 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:20,032 INFO L521 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:19:20,248 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:19:20,249 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:19:20,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:20,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1378945344, now seen corresponding path program 9 times [2021-06-05 12:19:20,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:20,249 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221915010] [2021-06-05 12:19:20,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:20,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:20,383 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:19:20,383 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:20,383 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221915010] [2021-06-05 12:19:20,383 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221915010] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:20,383 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515828571] [2021-06-05 12:19:20,384 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:19:20,497 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2021-06-05 12:19:20,497 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:19:20,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 12:19:20,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:19:20,611 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:19:20,612 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515828571] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:20,612 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:19:20,612 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2021-06-05 12:19:20,612 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761733879] [2021-06-05 12:19:20,612 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 12:19:20,612 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:20,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 12:19:20,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2021-06-05 12:19:20,613 INFO L87 Difference]: Start difference. First operand 661 states and 1192 transitions. Second operand has 23 states, 23 states have (on average 3.869565217391304) internal successors, (89), 23 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:20,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:19:20,855 INFO L93 Difference]: Finished difference Result 666 states and 1197 transitions. [2021-06-05 12:19:20,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-05 12:19:20,855 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.869565217391304) internal successors, (89), 23 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-06-05 12:19:20,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:19:20,857 INFO L225 Difference]: With dead ends: 666 [2021-06-05 12:19:20,857 INFO L226 Difference]: Without dead ends: 666 [2021-06-05 12:19:20,857 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 298.4ms TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2021-06-05 12:19:20,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2021-06-05 12:19:20,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 666. [2021-06-05 12:19:20,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 663 states have (on average 1.8054298642533937) internal successors, (1197), 665 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:20,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1197 transitions. [2021-06-05 12:19:20,864 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1197 transitions. Word has length 88 [2021-06-05 12:19:20,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:20,865 INFO L482 AbstractCegarLoop]: Abstraction has 666 states and 1197 transitions. [2021-06-05 12:19:20,865 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.869565217391304) internal successors, (89), 23 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:20,865 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1197 transitions. [2021-06-05 12:19:20,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-06-05 12:19:20,865 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:20,865 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:19:21,081 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-06-05 12:19:21,081 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:19:21,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:21,081 INFO L82 PathProgramCache]: Analyzing trace with hash -156100808, now seen corresponding path program 10 times [2021-06-05 12:19:21,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:21,081 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23089808] [2021-06-05 12:19:21,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:21,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 12:19:21,097 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 12:19:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 12:19:21,110 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 12:19:21,124 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 12:19:21,125 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 12:19:21,125 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-05 12:19:21,125 INFO L315 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2021-06-05 12:19:21,125 WARN L242 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 12:19:21,125 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2021-06-05 12:19:21,135 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,136 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,136 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,136 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,136 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,136 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,136 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,136 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,136 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,136 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,136 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,136 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,136 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,136 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,136 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,136 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,136 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,136 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,137 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,137 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,137 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,137 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,137 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,137 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,137 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,137 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,137 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,137 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,137 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,137 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,137 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,137 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,137 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,137 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,137 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,137 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,137 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,137 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,137 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,137 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,137 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,138 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,138 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,138 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,138 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,138 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,138 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,138 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,138 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,138 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,138 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,138 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,138 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,138 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,138 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,138 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,138 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,138 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,138 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,138 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,139 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,139 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,139 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,139 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,139 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,139 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,139 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,139 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,139 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,139 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,139 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,139 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,139 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,139 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,139 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,139 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,139 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,139 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,139 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,139 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,140 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,140 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,140 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,140 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,140 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,140 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,140 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,140 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,140 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,140 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,140 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,140 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,140 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,140 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,140 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,140 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,140 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,140 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,140 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,140 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,140 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,140 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,140 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,141 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,141 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,141 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,141 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,141 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,141 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,141 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,141 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,141 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,141 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,141 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,141 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,141 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,141 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,141 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,141 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,141 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,141 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,141 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,141 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,141 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,141 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,142 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,142 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,142 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,142 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,142 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,142 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,142 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,142 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,142 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,142 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,142 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,142 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,142 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,142 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,142 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,143 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,143 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,143 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,143 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,143 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,143 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,143 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,143 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,143 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,143 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,143 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,143 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,143 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,143 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,143 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,143 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,143 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,143 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,143 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,143 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,143 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,143 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,144 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,144 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,144 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,144 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,144 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,144 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,144 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,144 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,144 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,144 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,144 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,144 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,144 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,144 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,144 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,144 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,144 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,144 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,144 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,144 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,144 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,145 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,145 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,145 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,145 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,145 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,145 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,145 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,145 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,145 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,145 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,145 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,145 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,145 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,145 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,145 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,145 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,145 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,145 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,145 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,145 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,146 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,146 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,146 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,146 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,146 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,146 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,146 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,146 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,146 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,146 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,146 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,146 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,146 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,146 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,146 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,146 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,146 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,146 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,146 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,146 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,146 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,146 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,147 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,147 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,147 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,147 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,147 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,147 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,147 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,147 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,147 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,147 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,147 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,147 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,147 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,147 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,147 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,147 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,147 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,147 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,147 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,148 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,148 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,148 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,148 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,148 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,148 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,148 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,148 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,148 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,148 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,148 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,148 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,148 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,148 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,148 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,148 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,148 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,148 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,148 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,148 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,148 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,148 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,148 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,148 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,149 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,149 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,149 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,149 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,149 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,149 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,149 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,149 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,149 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,149 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,149 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,149 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,149 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,150 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,150 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,150 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,150 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,150 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,150 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,150 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,150 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,150 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,150 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,150 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,150 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,150 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,151 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,151 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,151 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,151 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,151 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,151 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,151 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,152 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,152 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,152 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,152 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,152 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,152 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,152 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,152 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,152 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,152 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,152 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,152 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,152 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,152 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~p~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,152 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:19:21,155 INFO L149 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-06-05 12:19:21,155 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-06-05 12:19:21,155 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 12:19:21,155 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 12:19:21,156 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 12:19:21,156 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 12:19:21,156 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 12:19:21,156 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 12:19:21,156 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 12:19:21,156 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 12:19:21,157 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 211 places, 251 transitions, 520 flow [2021-06-05 12:19:59,136 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 185097 states, 185073 states have (on average 3.625445094638332) internal successors, (670972), 185096 states have internal predecessors, (670972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:59,347 INFO L276 IsEmpty]: Start isEmpty. Operand has 185097 states, 185073 states have (on average 3.625445094638332) internal successors, (670972), 185096 states have internal predecessors, (670972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:59,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-06-05 12:19:59,348 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:59,348 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:19:59,348 INFO L430 AbstractCegarLoop]: === Iteration 1 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:19:59,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:59,349 INFO L82 PathProgramCache]: Analyzing trace with hash 680563171, now seen corresponding path program 1 times [2021-06-05 12:19:59,349 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:59,349 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931700103] [2021-06-05 12:19:59,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:59,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:59,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:19:59,355 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:59,355 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931700103] [2021-06-05 12:19:59,355 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931700103] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:19:59,356 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:19:59,356 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 12:19:59,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28000955] [2021-06-05 12:19:59,356 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-05 12:19:59,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:59,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-05 12:19:59,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 12:19:59,549 INFO L87 Difference]: Start difference. First operand has 185097 states, 185073 states have (on average 3.625445094638332) internal successors, (670972), 185096 states have internal predecessors, (670972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:00,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:20:00,924 INFO L93 Difference]: Finished difference Result 175522 states and 522411 transitions. [2021-06-05 12:20:00,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-05 12:20:00,925 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-06-05 12:20:00,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:20:01,309 INFO L225 Difference]: With dead ends: 175522 [2021-06-05 12:20:01,309 INFO L226 Difference]: Without dead ends: 136991 [2021-06-05 12:20:01,310 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 12:20:05,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136991 states. [2021-06-05 12:20:07,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136991 to 136991. [2021-06-05 12:20:07,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136991 states, 136961 states have (on average 2.957148385306766) internal successors, (405014), 136990 states have internal predecessors, (405014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:08,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136991 states to 136991 states and 405014 transitions. [2021-06-05 12:20:08,319 INFO L78 Accepts]: Start accepts. Automaton has 136991 states and 405014 transitions. Word has length 42 [2021-06-05 12:20:08,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:20:08,319 INFO L482 AbstractCegarLoop]: Abstraction has 136991 states and 405014 transitions. [2021-06-05 12:20:08,319 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:08,319 INFO L276 IsEmpty]: Start isEmpty. Operand 136991 states and 405014 transitions. [2021-06-05 12:20:08,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-06-05 12:20:08,320 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:20:08,320 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:20:08,320 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-05 12:20:08,320 INFO L430 AbstractCegarLoop]: === Iteration 2 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:20:08,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:20:08,320 INFO L82 PathProgramCache]: Analyzing trace with hash 107997793, now seen corresponding path program 1 times [2021-06-05 12:20:08,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:20:08,321 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392034354] [2021-06-05 12:20:08,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:20:08,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:08,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:20:08,340 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:20:08,340 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392034354] [2021-06-05 12:20:08,341 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392034354] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:20:08,341 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:20:08,341 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 12:20:08,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660264825] [2021-06-05 12:20:08,341 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 12:20:08,341 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:20:08,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 12:20:08,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 12:20:08,341 INFO L87 Difference]: Start difference. First operand 136991 states and 405014 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:08,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:20:08,931 INFO L93 Difference]: Finished difference Result 136995 states and 405018 transitions. [2021-06-05 12:20:08,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 12:20:08,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-06-05 12:20:08,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:20:09,172 INFO L225 Difference]: With dead ends: 136995 [2021-06-05 12:20:09,172 INFO L226 Difference]: Without dead ends: 136995 [2021-06-05 12:20:09,172 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 12:20:13,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136995 states. [2021-06-05 12:20:14,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136995 to 136992. [2021-06-05 12:20:14,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136992 states, 136962 states have (on average 2.9571340955885574) internal successors, (405015), 136991 states have internal predecessors, (405015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:15,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136992 states to 136992 states and 405015 transitions. [2021-06-05 12:20:15,673 INFO L78 Accepts]: Start accepts. Automaton has 136992 states and 405015 transitions. Word has length 42 [2021-06-05 12:20:15,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:20:15,673 INFO L482 AbstractCegarLoop]: Abstraction has 136992 states and 405015 transitions. [2021-06-05 12:20:15,673 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:15,673 INFO L276 IsEmpty]: Start isEmpty. Operand 136992 states and 405015 transitions. [2021-06-05 12:20:15,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-06-05 12:20:15,674 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:20:15,674 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:20:15,674 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-05 12:20:15,674 INFO L430 AbstractCegarLoop]: === Iteration 3 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:20:15,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:20:15,674 INFO L82 PathProgramCache]: Analyzing trace with hash -452618924, now seen corresponding path program 1 times [2021-06-05 12:20:15,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:20:15,675 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327918340] [2021-06-05 12:20:15,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:20:15,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:15,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:20:15,707 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:20:15,707 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327918340] [2021-06-05 12:20:15,707 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327918340] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:15,707 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68003923] [2021-06-05 12:20:15,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:20:15,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:15,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 2 conjunts are in the unsatisfiable core [2021-06-05 12:20:15,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:20:15,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 12:20:15,815 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68003923] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:20:15,815 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:20:15,815 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-06-05 12:20:15,815 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89888000] [2021-06-05 12:20:15,815 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 12:20:15,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:20:15,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 12:20:15,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-05 12:20:15,816 INFO L87 Difference]: Start difference. First operand 136992 states and 405015 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:16,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:20:16,263 INFO L93 Difference]: Finished difference Result 136978 states and 405001 transitions. [2021-06-05 12:20:16,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 12:20:16,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-06-05 12:20:16,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:20:16,601 INFO L225 Difference]: With dead ends: 136978 [2021-06-05 12:20:16,601 INFO L226 Difference]: Without dead ends: 136978 [2021-06-05 12:20:16,601 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 9.6ms TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-05 12:20:21,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136978 states. [2021-06-05 12:20:22,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136978 to 136978. [2021-06-05 12:20:22,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136978 states, 136949 states have (on average 2.957312576214503) internal successors, (405001), 136977 states have internal predecessors, (405001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:23,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136978 states to 136978 states and 405001 transitions. [2021-06-05 12:20:23,032 INFO L78 Accepts]: Start accepts. Automaton has 136978 states and 405001 transitions. Word has length 47 [2021-06-05 12:20:23,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:20:23,032 INFO L482 AbstractCegarLoop]: Abstraction has 136978 states and 405001 transitions. [2021-06-05 12:20:23,032 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:23,032 INFO L276 IsEmpty]: Start isEmpty. Operand 136978 states and 405001 transitions. [2021-06-05 12:20:23,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-06-05 12:20:23,033 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:20:23,033 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:20:23,234 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-06-05 12:20:23,234 INFO L430 AbstractCegarLoop]: === Iteration 4 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:20:23,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:20:23,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1501306781, now seen corresponding path program 1 times [2021-06-05 12:20:23,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:20:23,235 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792340483] [2021-06-05 12:20:23,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:20:23,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:23,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 12:20:23,293 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:20:23,293 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792340483] [2021-06-05 12:20:23,293 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792340483] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:23,293 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987413645] [2021-06-05 12:20:23,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:20:23,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:23,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjunts are in the unsatisfiable core [2021-06-05 12:20:23,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:20:23,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 12:20:23,448 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987413645] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:23,448 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:20:23,448 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-06-05 12:20:23,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266615467] [2021-06-05 12:20:23,448 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 12:20:23,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:20:23,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 12:20:23,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 12:20:23,449 INFO L87 Difference]: Start difference. First operand 136978 states and 405001 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:23,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:20:23,877 INFO L93 Difference]: Finished difference Result 136986 states and 405009 transitions. [2021-06-05 12:20:23,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 12:20:23,877 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-06-05 12:20:23,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:20:24,518 INFO L225 Difference]: With dead ends: 136986 [2021-06-05 12:20:24,518 INFO L226 Difference]: Without dead ends: 136986 [2021-06-05 12:20:24,518 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 20.5ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:20:28,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136986 states. [2021-06-05 12:20:30,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136986 to 136983. [2021-06-05 12:20:30,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136983 states, 136954 states have (on average 2.9572411174554962) internal successors, (405006), 136982 states have internal predecessors, (405006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:30,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136983 states to 136983 states and 405006 transitions. [2021-06-05 12:20:30,615 INFO L78 Accepts]: Start accepts. Automaton has 136983 states and 405006 transitions. Word has length 57 [2021-06-05 12:20:30,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:20:30,615 INFO L482 AbstractCegarLoop]: Abstraction has 136983 states and 405006 transitions. [2021-06-05 12:20:30,615 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:30,615 INFO L276 IsEmpty]: Start isEmpty. Operand 136983 states and 405006 transitions. [2021-06-05 12:20:30,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-06-05 12:20:30,617 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:20:30,617 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:20:30,821 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-06-05 12:20:30,821 INFO L430 AbstractCegarLoop]: === Iteration 5 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:20:30,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:20:30,823 INFO L82 PathProgramCache]: Analyzing trace with hash 639275280, now seen corresponding path program 2 times [2021-06-05 12:20:30,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:20:30,823 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110285611] [2021-06-05 12:20:30,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:20:30,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:30,872 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 12:20:30,872 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:20:30,872 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110285611] [2021-06-05 12:20:30,872 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110285611] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:30,872 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363020494] [2021-06-05 12:20:30,872 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:20:30,948 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:20:30,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:20:30,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjunts are in the unsatisfiable core [2021-06-05 12:20:30,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:20:31,028 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 12:20:31,028 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363020494] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:31,028 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:20:31,028 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-06-05 12:20:31,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744472852] [2021-06-05 12:20:31,028 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 12:20:31,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:20:31,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 12:20:31,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 12:20:31,029 INFO L87 Difference]: Start difference. First operand 136983 states and 405006 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:31,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:20:31,897 INFO L93 Difference]: Finished difference Result 135620 states and 402261 transitions. [2021-06-05 12:20:31,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 12:20:31,898 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-06-05 12:20:31,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:20:32,099 INFO L225 Difference]: With dead ends: 135620 [2021-06-05 12:20:32,099 INFO L226 Difference]: Without dead ends: 135620 [2021-06-05 12:20:32,100 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 18.4ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:20:36,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135620 states. [2021-06-05 12:20:37,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135620 to 135620. [2021-06-05 12:20:38,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135620 states, 135594 states have (on average 2.9666578167175537) internal successors, (402261), 135619 states have internal predecessors, (402261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:38,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135620 states to 135620 states and 402261 transitions. [2021-06-05 12:20:38,437 INFO L78 Accepts]: Start accepts. Automaton has 135620 states and 402261 transitions. Word has length 62 [2021-06-05 12:20:38,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:20:38,437 INFO L482 AbstractCegarLoop]: Abstraction has 135620 states and 402261 transitions. [2021-06-05 12:20:38,437 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:38,437 INFO L276 IsEmpty]: Start isEmpty. Operand 135620 states and 402261 transitions. [2021-06-05 12:20:38,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-06-05 12:20:38,439 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:20:38,439 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:20:38,640 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-06-05 12:20:38,641 INFO L430 AbstractCegarLoop]: === Iteration 6 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:20:38,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:20:38,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1321609052, now seen corresponding path program 1 times [2021-06-05 12:20:38,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:20:38,641 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438838318] [2021-06-05 12:20:38,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:20:38,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:38,675 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:20:38,675 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:20:38,675 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438838318] [2021-06-05 12:20:38,675 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438838318] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:38,675 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435532493] [2021-06-05 12:20:38,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:20:38,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:38,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-05 12:20:38,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:20:38,831 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:20:38,831 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435532493] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:38,831 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:20:38,831 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 12:20:38,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483531769] [2021-06-05 12:20:38,831 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 12:20:38,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:20:38,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 12:20:38,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:20:38,832 INFO L87 Difference]: Start difference. First operand 135620 states and 402261 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:39,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:20:39,766 INFO L93 Difference]: Finished difference Result 135628 states and 402269 transitions. [2021-06-05 12:20:39,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 12:20:39,767 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-06-05 12:20:39,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:20:40,023 INFO L225 Difference]: With dead ends: 135628 [2021-06-05 12:20:40,023 INFO L226 Difference]: Without dead ends: 135628 [2021-06-05 12:20:40,023 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 38.6ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-06-05 12:20:44,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135628 states. [2021-06-05 12:20:46,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135628 to 135625. [2021-06-05 12:20:46,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135625 states, 135599 states have (on average 2.966585299301617) internal successors, (402266), 135624 states have internal predecessors, (402266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:46,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135625 states to 135625 states and 402266 transitions. [2021-06-05 12:20:46,517 INFO L78 Accepts]: Start accepts. Automaton has 135625 states and 402266 transitions. Word has length 65 [2021-06-05 12:20:46,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:20:46,517 INFO L482 AbstractCegarLoop]: Abstraction has 135625 states and 402266 transitions. [2021-06-05 12:20:46,517 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:46,517 INFO L276 IsEmpty]: Start isEmpty. Operand 135625 states and 402266 transitions. [2021-06-05 12:20:46,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-06-05 12:20:46,519 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:20:46,519 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:20:46,719 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-06-05 12:20:46,719 INFO L430 AbstractCegarLoop]: === Iteration 7 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:20:46,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:20:46,719 INFO L82 PathProgramCache]: Analyzing trace with hash 2036304977, now seen corresponding path program 2 times [2021-06-05 12:20:46,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:20:46,720 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192835120] [2021-06-05 12:20:46,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:20:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:46,772 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:20:46,773 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:20:46,773 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192835120] [2021-06-05 12:20:46,773 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192835120] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:46,773 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465395469] [2021-06-05 12:20:46,773 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:20:46,864 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 12:20:46,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:20:46,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-05 12:20:46,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:20:46,882 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 12:20:46,883 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:20:46,884 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:20:46,884 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:20:46,884 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:20:46,894 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-06-05 12:20:46,895 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:20:46,897 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:20:46,898 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:20:46,898 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:20:46,944 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:20:46,944 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 12:20:46,945 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:20:46,948 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:20:46,949 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:20:46,949 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:20:46,977 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:20:46,980 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:20:46,981 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:20:46,984 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:20:46,985 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:20:46,988 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:20:46,990 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:20:46,991 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:20:47,031 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-06-05 12:20:47,032 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:20:47,033 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:20:47,033 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:20:47,034 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-06-05 12:20:47,070 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-06-05 12:20:47,070 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465395469] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:20:47,071 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:20:47,071 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2021-06-05 12:20:47,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415243663] [2021-06-05 12:20:47,071 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 12:20:47,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:20:47,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 12:20:47,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-06-05 12:20:47,071 INFO L87 Difference]: Start difference. First operand 135625 states and 402266 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:49,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:20:49,079 INFO L93 Difference]: Finished difference Result 244728 states and 716225 transitions. [2021-06-05 12:20:49,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-06-05 12:20:49,081 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-06-05 12:20:49,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:20:49,483 INFO L225 Difference]: With dead ends: 244728 [2021-06-05 12:20:49,483 INFO L226 Difference]: Without dead ends: 233730 [2021-06-05 12:20:49,484 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 392.7ms TimeCoverageRelationStatistics Valid=364, Invalid=1442, Unknown=0, NotChecked=0, Total=1806 [2021-06-05 12:20:54,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233730 states. [2021-06-05 12:20:56,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233730 to 161481. [2021-06-05 12:20:56,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161481 states, 161455 states have (on average 2.976098603326004) internal successors, (480506), 161480 states have internal predecessors, (480506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:57,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161481 states to 161481 states and 480506 transitions. [2021-06-05 12:20:57,581 INFO L78 Accepts]: Start accepts. Automaton has 161481 states and 480506 transitions. Word has length 70 [2021-06-05 12:20:57,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:20:57,581 INFO L482 AbstractCegarLoop]: Abstraction has 161481 states and 480506 transitions. [2021-06-05 12:20:57,581 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:57,581 INFO L276 IsEmpty]: Start isEmpty. Operand 161481 states and 480506 transitions. [2021-06-05 12:20:57,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-05 12:20:57,588 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:20:57,588 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:20:57,806 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:20:57,806 INFO L430 AbstractCegarLoop]: === Iteration 8 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:20:57,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:20:57,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1932949297, now seen corresponding path program 1 times [2021-06-05 12:20:57,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:20:57,807 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682834143] [2021-06-05 12:20:57,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:20:57,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:57,851 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-06-05 12:20:57,851 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:20:57,851 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682834143] [2021-06-05 12:20:57,852 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682834143] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:57,852 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855836938] [2021-06-05 12:20:57,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:20:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:57,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjunts are in the unsatisfiable core [2021-06-05 12:20:57,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:20:58,005 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-06-05 12:20:58,005 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855836938] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:58,005 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:20:58,005 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2021-06-05 12:20:58,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086079873] [2021-06-05 12:20:58,005 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 12:20:58,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:20:58,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 12:20:58,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-06-05 12:20:58,006 INFO L87 Difference]: Start difference. First operand 161481 states and 480506 transitions. Second operand has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:58,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:20:58,557 INFO L93 Difference]: Finished difference Result 161489 states and 480514 transitions. [2021-06-05 12:20:58,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 12:20:58,558 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-06-05 12:20:58,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:20:58,827 INFO L225 Difference]: With dead ends: 161489 [2021-06-05 12:20:58,827 INFO L226 Difference]: Without dead ends: 161489 [2021-06-05 12:20:58,829 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 64.3ms TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2021-06-05 12:21:03,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161489 states. [2021-06-05 12:21:04,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161489 to 161486. [2021-06-05 12:21:05,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161486 states, 161460 states have (on average 2.9760374086461043) internal successors, (480511), 161485 states have internal predecessors, (480511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:06,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161486 states to 161486 states and 480511 transitions. [2021-06-05 12:21:06,105 INFO L78 Accepts]: Start accepts. Automaton has 161486 states and 480511 transitions. Word has length 77 [2021-06-05 12:21:06,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:21:06,105 INFO L482 AbstractCegarLoop]: Abstraction has 161486 states and 480511 transitions. [2021-06-05 12:21:06,105 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:06,105 INFO L276 IsEmpty]: Start isEmpty. Operand 161486 states and 480511 transitions. [2021-06-05 12:21:06,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-06-05 12:21:06,117 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:21:06,117 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:21:06,332 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:21:06,332 INFO L430 AbstractCegarLoop]: === Iteration 9 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:21:06,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:21:06,332 INFO L82 PathProgramCache]: Analyzing trace with hash -135065762, now seen corresponding path program 2 times [2021-06-05 12:21:06,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:21:06,332 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380916588] [2021-06-05 12:21:06,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:21:06,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:06,391 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-06-05 12:21:06,391 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:21:06,391 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380916588] [2021-06-05 12:21:06,391 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380916588] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:06,391 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785341289] [2021-06-05 12:21:06,391 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:21:06,476 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:21:06,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:21:06,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 12:21:06,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:21:06,573 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-06-05 12:21:06,574 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785341289] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:06,574 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:21:06,574 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2021-06-05 12:21:06,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898414823] [2021-06-05 12:21:06,574 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 12:21:06,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:21:06,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 12:21:06,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 12:21:06,574 INFO L87 Difference]: Start difference. First operand 161486 states and 480511 transitions. Second operand has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:07,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:21:07,263 INFO L93 Difference]: Finished difference Result 161494 states and 480519 transitions. [2021-06-05 12:21:07,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 12:21:07,264 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-06-05 12:21:07,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:21:07,533 INFO L225 Difference]: With dead ends: 161494 [2021-06-05 12:21:07,533 INFO L226 Difference]: Without dead ends: 161494 [2021-06-05 12:21:07,533 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 97.6ms TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2021-06-05 12:21:12,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161494 states. [2021-06-05 12:21:13,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161494 to 161491. [2021-06-05 12:21:14,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161491 states, 161465 states have (on average 2.97597621775617) internal successors, (480516), 161490 states have internal predecessors, (480516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:14,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161491 states to 161491 states and 480516 transitions. [2021-06-05 12:21:14,535 INFO L78 Accepts]: Start accepts. Automaton has 161491 states and 480516 transitions. Word has length 82 [2021-06-05 12:21:14,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:21:14,535 INFO L482 AbstractCegarLoop]: Abstraction has 161491 states and 480516 transitions. [2021-06-05 12:21:14,535 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:14,535 INFO L276 IsEmpty]: Start isEmpty. Operand 161491 states and 480516 transitions. [2021-06-05 12:21:14,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-06-05 12:21:14,541 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:21:14,541 INFO L521 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:21:14,748 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:21:14,749 INFO L430 AbstractCegarLoop]: === Iteration 10 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:21:14,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:21:14,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1239446703, now seen corresponding path program 3 times [2021-06-05 12:21:14,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:21:14,749 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598660479] [2021-06-05 12:21:14,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:21:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:14,813 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-06-05 12:21:14,813 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:21:14,814 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598660479] [2021-06-05 12:21:14,814 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598660479] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:14,814 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809757171] [2021-06-05 12:21:14,814 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:21:14,913 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 12:21:14,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:21:14,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-05 12:21:14,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:21:15,610 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-05 12:21:15,610 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809757171] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:15,610 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:21:15,610 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7] total 18 [2021-06-05 12:21:15,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651297691] [2021-06-05 12:21:15,611 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 12:21:15,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:21:15,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 12:21:15,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2021-06-05 12:21:15,611 INFO L87 Difference]: Start difference. First operand 161491 states and 480516 transitions. Second operand has 18 states, 18 states have (on average 6.388888888888889) internal successors, (115), 18 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:15,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:21:15,909 INFO L93 Difference]: Finished difference Result 32342 states and 92964 transitions. [2021-06-05 12:21:15,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-05 12:21:15,909 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.388888888888889) internal successors, (115), 18 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-06-05 12:21:15,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:21:15,944 INFO L225 Difference]: With dead ends: 32342 [2021-06-05 12:21:15,945 INFO L226 Difference]: Without dead ends: 26222 [2021-06-05 12:21:15,945 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 216.2ms TimeCoverageRelationStatistics Valid=220, Invalid=772, Unknown=0, NotChecked=0, Total=992 [2021-06-05 12:21:16,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26222 states. [2021-06-05 12:21:16,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26222 to 26219. [2021-06-05 12:21:16,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26219 states, 26214 states have (on average 2.8616388189517052) internal successors, (75015), 26218 states have internal predecessors, (75015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:16,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26219 states to 26219 states and 75015 transitions. [2021-06-05 12:21:16,485 INFO L78 Accepts]: Start accepts. Automaton has 26219 states and 75015 transitions. Word has length 87 [2021-06-05 12:21:16,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:21:16,486 INFO L482 AbstractCegarLoop]: Abstraction has 26219 states and 75015 transitions. [2021-06-05 12:21:16,486 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 6.388888888888889) internal successors, (115), 18 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:16,486 INFO L276 IsEmpty]: Start isEmpty. Operand 26219 states and 75015 transitions. [2021-06-05 12:21:16,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-06-05 12:21:16,490 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:21:16,491 INFO L521 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:21:16,691 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2021-06-05 12:21:16,691 INFO L430 AbstractCegarLoop]: === Iteration 11 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:21:16,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:21:16,691 INFO L82 PathProgramCache]: Analyzing trace with hash -920529332, now seen corresponding path program 1 times [2021-06-05 12:21:16,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:21:16,691 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602172888] [2021-06-05 12:21:16,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:21:16,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:16,792 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:21:16,792 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:21:16,793 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602172888] [2021-06-05 12:21:16,793 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602172888] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:16,793 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838027968] [2021-06-05 12:21:16,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:21:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:16,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 14 conjunts are in the unsatisfiable core [2021-06-05 12:21:16,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:21:16,994 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:21:16,994 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838027968] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:16,994 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:21:16,994 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2021-06-05 12:21:16,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216742630] [2021-06-05 12:21:16,994 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 12:21:16,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:21:16,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 12:21:16,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-06-05 12:21:16,995 INFO L87 Difference]: Start difference. First operand 26219 states and 75015 transitions. Second operand has 17 states, 17 states have (on average 5.588235294117647) internal successors, (95), 17 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:17,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:21:17,191 INFO L93 Difference]: Finished difference Result 26227 states and 75023 transitions. [2021-06-05 12:21:17,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 12:21:17,192 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.588235294117647) internal successors, (95), 17 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-06-05 12:21:17,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:21:17,227 INFO L225 Difference]: With dead ends: 26227 [2021-06-05 12:21:17,227 INFO L226 Difference]: Without dead ends: 26227 [2021-06-05 12:21:17,228 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 172.4ms TimeCoverageRelationStatistics Valid=263, Invalid=549, Unknown=0, NotChecked=0, Total=812 [2021-06-05 12:21:17,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26227 states. [2021-06-05 12:21:17,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26227 to 26224. [2021-06-05 12:21:17,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26224 states, 26219 states have (on average 2.8612838018231055) internal successors, (75020), 26223 states have internal predecessors, (75020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:17,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26224 states to 26224 states and 75020 transitions. [2021-06-05 12:21:17,988 INFO L78 Accepts]: Start accepts. Automaton has 26224 states and 75020 transitions. Word has length 94 [2021-06-05 12:21:17,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:21:17,988 INFO L482 AbstractCegarLoop]: Abstraction has 26224 states and 75020 transitions. [2021-06-05 12:21:17,989 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 5.588235294117647) internal successors, (95), 17 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:17,989 INFO L276 IsEmpty]: Start isEmpty. Operand 26224 states and 75020 transitions. [2021-06-05 12:21:17,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-06-05 12:21:17,993 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:21:17,993 INFO L521 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:21:18,193 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:21:18,194 INFO L430 AbstractCegarLoop]: === Iteration 12 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:21:18,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:21:18,194 INFO L82 PathProgramCache]: Analyzing trace with hash -3342913, now seen corresponding path program 2 times [2021-06-05 12:21:18,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:21:18,194 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316236037] [2021-06-05 12:21:18,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:21:18,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:18,292 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:21:18,292 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:21:18,292 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316236037] [2021-06-05 12:21:18,292 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316236037] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:18,294 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566844773] [2021-06-05 12:21:18,294 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:21:18,394 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:21:18,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:21:18,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 16 conjunts are in the unsatisfiable core [2021-06-05 12:21:18,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:21:18,513 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:21:18,514 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566844773] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:18,514 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:21:18,514 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2021-06-05 12:21:18,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050525060] [2021-06-05 12:21:18,514 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 12:21:18,514 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:21:18,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 12:21:18,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2021-06-05 12:21:18,514 INFO L87 Difference]: Start difference. First operand 26224 states and 75020 transitions. Second operand has 19 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 19 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:18,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:21:18,732 INFO L93 Difference]: Finished difference Result 26232 states and 75028 transitions. [2021-06-05 12:21:18,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-05 12:21:18,732 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 19 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-06-05 12:21:18,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:21:18,765 INFO L225 Difference]: With dead ends: 26232 [2021-06-05 12:21:18,766 INFO L226 Difference]: Without dead ends: 26232 [2021-06-05 12:21:18,766 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 196.2ms TimeCoverageRelationStatistics Valid=340, Invalid=716, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 12:21:18,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26232 states. [2021-06-05 12:21:19,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26232 to 26229. [2021-06-05 12:21:19,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26229 states, 26224 states have (on average 2.8609289200732153) internal successors, (75025), 26228 states have internal predecessors, (75025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:19,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26229 states to 26229 states and 75025 transitions. [2021-06-05 12:21:19,352 INFO L78 Accepts]: Start accepts. Automaton has 26229 states and 75025 transitions. Word has length 99 [2021-06-05 12:21:19,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:21:19,352 INFO L482 AbstractCegarLoop]: Abstraction has 26229 states and 75025 transitions. [2021-06-05 12:21:19,352 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 19 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:19,352 INFO L276 IsEmpty]: Start isEmpty. Operand 26229 states and 75025 transitions. [2021-06-05 12:21:19,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-06-05 12:21:19,356 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:21:19,356 INFO L521 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:21:19,557 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-06-05 12:21:19,557 INFO L430 AbstractCegarLoop]: === Iteration 13 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:21:19,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:21:19,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1925216724, now seen corresponding path program 3 times [2021-06-05 12:21:19,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:21:19,557 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703185459] [2021-06-05 12:21:19,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:21:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:19,676 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:21:19,676 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:21:19,676 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703185459] [2021-06-05 12:21:19,676 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703185459] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:19,676 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53916759] [2021-06-05 12:21:19,676 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:21:19,741 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 12:21:19,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:21:19,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 13 conjunts are in the unsatisfiable core [2021-06-05 12:21:19,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:21:19,776 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 12:21:19,776 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:19,777 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:19,778 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:19,778 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:21:19,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-06-05 12:21:19,792 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:19,794 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:19,795 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:19,795 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:21:19,877 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:21:19,878 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 12:21:19,879 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:19,882 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:19,882 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:19,882 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:21:19,905 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:21:19,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:21:19,909 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:19,912 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:19,912 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:19,916 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:19,917 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:19,917 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-05 12:21:19,961 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:21:19,964 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:21:19,965 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:19,968 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:19,969 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:19,972 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:19,974 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:19,974 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:21:20,008 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-06-05 12:21:20,010 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:20,011 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:20,011 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:21:20,012 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-06-05 12:21:20,058 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-06-05 12:21:20,058 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53916759] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:20,058 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:21:20,058 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10] total 27 [2021-06-05 12:21:20,058 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027807046] [2021-06-05 12:21:20,058 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 12:21:20,059 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:21:20,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 12:21:20,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=585, Unknown=0, NotChecked=0, Total=702 [2021-06-05 12:21:20,059 INFO L87 Difference]: Start difference. First operand 26229 states and 75025 transitions. Second operand has 27 states, 27 states have (on average 5.7407407407407405) internal successors, (155), 27 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:20,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:21:20,934 INFO L93 Difference]: Finished difference Result 28298 states and 80205 transitions. [2021-06-05 12:21:20,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-06-05 12:21:20,934 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 5.7407407407407405) internal successors, (155), 27 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2021-06-05 12:21:20,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:21:20,963 INFO L225 Difference]: With dead ends: 28298 [2021-06-05 12:21:20,964 INFO L226 Difference]: Without dead ends: 24589 [2021-06-05 12:21:20,965 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 762 ImplicationChecksByTransitivity, 693.4ms TimeCoverageRelationStatistics Valid=735, Invalid=2925, Unknown=0, NotChecked=0, Total=3660 [2021-06-05 12:21:21,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24589 states. [2021-06-05 12:21:21,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24589 to 19607. [2021-06-05 12:21:21,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19607 states, 19604 states have (on average 2.831769026729239) internal successors, (55514), 19606 states have internal predecessors, (55514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:21,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19607 states to 19607 states and 55514 transitions. [2021-06-05 12:21:21,442 INFO L78 Accepts]: Start accepts. Automaton has 19607 states and 55514 transitions. Word has length 104 [2021-06-05 12:21:21,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:21:21,442 INFO L482 AbstractCegarLoop]: Abstraction has 19607 states and 55514 transitions. [2021-06-05 12:21:21,442 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 5.7407407407407405) internal successors, (155), 27 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:21,442 INFO L276 IsEmpty]: Start isEmpty. Operand 19607 states and 55514 transitions. [2021-06-05 12:21:21,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-06-05 12:21:21,446 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:21:21,446 INFO L521 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:21:21,647 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:21:21,647 INFO L430 AbstractCegarLoop]: === Iteration 14 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:21:21,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:21:21,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1026882883, now seen corresponding path program 1 times [2021-06-05 12:21:21,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:21:21,648 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032385879] [2021-06-05 12:21:21,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:21:21,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:21,787 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:21:21,787 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:21:21,787 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032385879] [2021-06-05 12:21:21,787 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032385879] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:21,787 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388511880] [2021-06-05 12:21:21,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:21:21,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:21,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 12:21:21,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:21:22,028 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:21:22,028 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388511880] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:22,028 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:21:22,028 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2021-06-05 12:21:22,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295711101] [2021-06-05 12:21:22,028 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 12:21:22,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:21:22,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 12:21:22,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2021-06-05 12:21:22,029 INFO L87 Difference]: Start difference. First operand 19607 states and 55514 transitions. Second operand has 23 states, 23 states have (on average 4.826086956521739) internal successors, (111), 23 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:22,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:21:22,291 INFO L93 Difference]: Finished difference Result 19612 states and 55519 transitions. [2021-06-05 12:21:22,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-05 12:21:22,291 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.826086956521739) internal successors, (111), 23 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2021-06-05 12:21:22,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:21:22,311 INFO L225 Difference]: With dead ends: 19612 [2021-06-05 12:21:22,312 INFO L226 Difference]: Without dead ends: 19612 [2021-06-05 12:21:22,312 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 280.8ms TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2021-06-05 12:21:22,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19612 states. [2021-06-05 12:21:22,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19612 to 19612. [2021-06-05 12:21:22,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19612 states, 19609 states have (on average 2.831301953184762) internal successors, (55519), 19611 states have internal predecessors, (55519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:22,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19612 states to 19612 states and 55519 transitions. [2021-06-05 12:21:22,793 INFO L78 Accepts]: Start accepts. Automaton has 19612 states and 55519 transitions. Word has length 110 [2021-06-05 12:21:22,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:21:22,794 INFO L482 AbstractCegarLoop]: Abstraction has 19612 states and 55519 transitions. [2021-06-05 12:21:22,794 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 4.826086956521739) internal successors, (111), 23 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:22,794 INFO L276 IsEmpty]: Start isEmpty. Operand 19612 states and 55519 transitions. [2021-06-05 12:21:22,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-06-05 12:21:22,798 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:21:22,798 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:21:22,998 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-06-05 12:21:22,998 INFO L430 AbstractCegarLoop]: === Iteration 15 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:21:22,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:21:22,999 INFO L82 PathProgramCache]: Analyzing trace with hash -620699978, now seen corresponding path program 2 times [2021-06-05 12:21:22,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:21:22,999 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344738863] [2021-06-05 12:21:22,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:21:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:23,136 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2021-06-05 12:21:23,136 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:21:23,136 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344738863] [2021-06-05 12:21:23,136 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344738863] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:23,136 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861494588] [2021-06-05 12:21:23,136 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:21:23,217 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:21:23,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:21:23,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 13 conjunts are in the unsatisfiable core [2021-06-05 12:21:23,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:21:23,235 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 12:21:23,235 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:23,236 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:23,237 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:23,237 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:21:23,241 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-06-05 12:21:23,242 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:23,244 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:23,246 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:23,246 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:21:23,322 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:21:23,323 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 12:21:23,324 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:23,326 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:23,327 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:23,327 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:21:23,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:21:23,350 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:21:23,351 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:23,354 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:23,354 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:23,357 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:23,358 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:23,358 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-05 12:21:23,381 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:21:23,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:21:23,385 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:23,387 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:23,388 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:23,391 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:23,393 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:23,393 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:21:23,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-06-05 12:21:23,421 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:23,423 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:23,423 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:21:23,424 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-06-05 12:21:23,448 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2021-06-05 12:21:23,448 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861494588] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:23,448 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:21:23,448 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2021-06-05 12:21:23,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391505855] [2021-06-05 12:21:23,449 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 12:21:23,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:21:23,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 12:21:23,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-06-05 12:21:23,450 INFO L87 Difference]: Start difference. First operand 19612 states and 55519 transitions. Second operand has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:23,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:21:23,780 INFO L93 Difference]: Finished difference Result 22519 states and 62589 transitions. [2021-06-05 12:21:23,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 12:21:23,781 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2021-06-05 12:21:23,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:21:23,801 INFO L225 Difference]: With dead ends: 22519 [2021-06-05 12:21:23,801 INFO L226 Difference]: Without dead ends: 19285 [2021-06-05 12:21:23,801 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 113 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 163.4ms TimeCoverageRelationStatistics Valid=158, Invalid=394, Unknown=0, NotChecked=0, Total=552 [2021-06-05 12:21:23,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19285 states. [2021-06-05 12:21:24,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19285 to 18907. [2021-06-05 12:21:24,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18907 states, 18904 states have (on average 2.7951227253491324) internal successors, (52839), 18906 states have internal predecessors, (52839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:24,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18907 states to 18907 states and 52839 transitions. [2021-06-05 12:21:24,149 INFO L78 Accepts]: Start accepts. Automaton has 18907 states and 52839 transitions. Word has length 115 [2021-06-05 12:21:24,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:21:24,149 INFO L482 AbstractCegarLoop]: Abstraction has 18907 states and 52839 transitions. [2021-06-05 12:21:24,149 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:24,149 INFO L276 IsEmpty]: Start isEmpty. Operand 18907 states and 52839 transitions. [2021-06-05 12:21:24,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-06-05 12:21:24,159 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:21:24,159 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:21:24,359 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:21:24,359 INFO L430 AbstractCegarLoop]: === Iteration 16 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:21:24,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:21:24,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1054784106, now seen corresponding path program 3 times [2021-06-05 12:21:24,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:21:24,360 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639307428] [2021-06-05 12:21:24,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:21:24,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:24,444 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2021-06-05 12:21:24,444 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:21:24,444 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639307428] [2021-06-05 12:21:24,444 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639307428] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:24,444 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716100414] [2021-06-05 12:21:24,444 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:21:24,519 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 12:21:24,519 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:21:24,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 14 conjunts are in the unsatisfiable core [2021-06-05 12:21:24,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:21:24,537 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 12:21:24,538 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:24,539 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:24,539 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:24,539 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:21:24,546 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-06-05 12:21:24,547 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:24,549 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:24,550 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:24,550 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:21:24,646 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:21:24,646 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 12:21:24,648 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:24,650 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:24,651 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:24,651 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:21:24,662 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:21:24,664 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:21:24,665 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:24,668 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:24,668 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:24,672 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:24,672 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:24,672 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-05 12:21:24,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:21:24,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:21:24,692 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:24,695 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:24,695 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:24,699 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:24,700 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:24,700 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-05 12:21:24,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:21:24,749 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:21:24,750 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:24,753 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:24,753 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:24,757 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:24,758 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:24,758 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:21:24,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-06-05 12:21:24,771 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:24,772 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:24,773 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:21:24,773 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-06-05 12:21:24,799 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2021-06-05 12:21:24,800 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716100414] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:24,800 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:21:24,800 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 15 [2021-06-05 12:21:24,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407865951] [2021-06-05 12:21:24,800 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 12:21:24,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:21:24,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 12:21:24,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-06-05 12:21:24,800 INFO L87 Difference]: Start difference. First operand 18907 states and 52839 transitions. Second operand has 15 states, 15 states have (on average 6.333333333333333) internal successors, (95), 15 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:25,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:21:25,233 INFO L93 Difference]: Finished difference Result 19051 states and 53115 transitions. [2021-06-05 12:21:25,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 12:21:25,234 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.333333333333333) internal successors, (95), 15 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2021-06-05 12:21:25,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:21:25,250 INFO L225 Difference]: With dead ends: 19051 [2021-06-05 12:21:25,251 INFO L226 Difference]: Without dead ends: 16100 [2021-06-05 12:21:25,251 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 122 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 163.8ms TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2021-06-05 12:21:25,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16100 states. [2021-06-05 12:21:25,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16100 to 15748. [2021-06-05 12:21:25,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15748 states, 15746 states have (on average 2.8055379143909565) internal successors, (44176), 15747 states have internal predecessors, (44176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:25,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15748 states to 15748 states and 44176 transitions. [2021-06-05 12:21:25,542 INFO L78 Accepts]: Start accepts. Automaton has 15748 states and 44176 transitions. Word has length 124 [2021-06-05 12:21:25,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:21:25,543 INFO L482 AbstractCegarLoop]: Abstraction has 15748 states and 44176 transitions. [2021-06-05 12:21:25,543 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 6.333333333333333) internal successors, (95), 15 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:25,543 INFO L276 IsEmpty]: Start isEmpty. Operand 15748 states and 44176 transitions. [2021-06-05 12:21:25,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-06-05 12:21:25,555 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:21:25,555 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:21:25,755 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-06-05 12:21:25,755 INFO L430 AbstractCegarLoop]: === Iteration 17 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:21:25,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:21:25,756 INFO L82 PathProgramCache]: Analyzing trace with hash -387248032, now seen corresponding path program 1 times [2021-06-05 12:21:25,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:21:25,756 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109784221] [2021-06-05 12:21:25,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:21:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:25,811 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:21:25,811 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:21:25,811 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109784221] [2021-06-05 12:21:25,811 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109784221] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:25,811 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371303458] [2021-06-05 12:21:25,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:21:25,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:25,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 11 conjunts are in the unsatisfiable core [2021-06-05 12:21:25,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:21:25,903 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 12:21:25,903 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:25,904 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:25,905 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:25,905 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:21:25,922 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:21:25,922 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 12:21:25,924 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:25,925 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:25,926 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:25,926 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2021-06-05 12:21:26,037 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 12:21:26,038 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:26,041 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:26,041 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:26,041 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2021-06-05 12:21:26,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 12:21:26,094 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-06-05 12:21:26,095 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:26,099 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:26,101 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 12:21:26,101 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:21 [2021-06-05 12:21:26,148 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:21:26,149 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371303458] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:21:26,149 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:21:26,149 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 9 [2021-06-05 12:21:26,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684308634] [2021-06-05 12:21:26,149 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 12:21:26,149 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:21:26,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 12:21:26,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:21:26,149 INFO L87 Difference]: Start difference. First operand 15748 states and 44176 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:26,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:21:26,333 INFO L93 Difference]: Finished difference Result 19312 states and 53323 transitions. [2021-06-05 12:21:26,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 12:21:26,334 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 135 [2021-06-05 12:21:26,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:21:26,354 INFO L225 Difference]: With dead ends: 19312 [2021-06-05 12:21:26,354 INFO L226 Difference]: Without dead ends: 18654 [2021-06-05 12:21:26,354 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 129 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 97.5ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-06-05 12:21:26,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18654 states. [2021-06-05 12:21:26,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18654 to 16652. [2021-06-05 12:21:26,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16652 states, 16648 states have (on average 2.7762493993272463) internal successors, (46219), 16651 states have internal predecessors, (46219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:26,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16652 states to 16652 states and 46219 transitions. [2021-06-05 12:21:26,657 INFO L78 Accepts]: Start accepts. Automaton has 16652 states and 46219 transitions. Word has length 135 [2021-06-05 12:21:26,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:21:26,657 INFO L482 AbstractCegarLoop]: Abstraction has 16652 states and 46219 transitions. [2021-06-05 12:21:26,658 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:26,658 INFO L276 IsEmpty]: Start isEmpty. Operand 16652 states and 46219 transitions. [2021-06-05 12:21:26,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-06-05 12:21:26,670 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:21:26,670 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:21:26,872 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-06-05 12:21:26,873 INFO L430 AbstractCegarLoop]: === Iteration 18 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:21:26,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:21:26,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1820370140, now seen corresponding path program 2 times [2021-06-05 12:21:26,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:21:26,873 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130538477] [2021-06-05 12:21:26,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:21:26,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:26,924 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2021-06-05 12:21:26,924 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:21:26,924 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130538477] [2021-06-05 12:21:26,924 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130538477] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:21:26,925 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:21:26,925 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 12:21:26,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930406841] [2021-06-05 12:21:26,925 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 12:21:26,926 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:21:26,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 12:21:26,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-05 12:21:26,926 INFO L87 Difference]: Start difference. First operand 16652 states and 46219 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:27,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:21:27,133 INFO L93 Difference]: Finished difference Result 14892 states and 41033 transitions. [2021-06-05 12:21:27,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 12:21:27,133 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 135 [2021-06-05 12:21:27,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:21:27,149 INFO L225 Difference]: With dead ends: 14892 [2021-06-05 12:21:27,149 INFO L226 Difference]: Without dead ends: 14540 [2021-06-05 12:21:27,149 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 126.0ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 12:21:27,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14540 states. [2021-06-05 12:21:27,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14540 to 13088. [2021-06-05 12:21:27,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13088 states, 13084 states have (on average 2.772852338734332) internal successors, (36280), 13087 states have internal predecessors, (36280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:27,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13088 states to 13088 states and 36280 transitions. [2021-06-05 12:21:27,383 INFO L78 Accepts]: Start accepts. Automaton has 13088 states and 36280 transitions. Word has length 135 [2021-06-05 12:21:27,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:21:27,383 INFO L482 AbstractCegarLoop]: Abstraction has 13088 states and 36280 transitions. [2021-06-05 12:21:27,383 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:27,383 INFO L276 IsEmpty]: Start isEmpty. Operand 13088 states and 36280 transitions. [2021-06-05 12:21:27,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-06-05 12:21:27,395 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:21:27,395 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:21:27,395 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-06-05 12:21:27,395 INFO L430 AbstractCegarLoop]: === Iteration 19 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:21:27,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:21:27,396 INFO L82 PathProgramCache]: Analyzing trace with hash -194206221, now seen corresponding path program 1 times [2021-06-05 12:21:27,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:21:27,396 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360703643] [2021-06-05 12:21:27,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:21:27,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:27,616 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:21:27,616 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:21:27,616 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360703643] [2021-06-05 12:21:27,616 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360703643] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:27,616 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602264438] [2021-06-05 12:21:27,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:21:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:27,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 24 conjunts are in the unsatisfiable core [2021-06-05 12:21:27,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:21:27,715 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 12:21:27,716 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:27,717 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:27,717 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:27,717 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:21:27,736 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 12:21:27,736 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 12:21:27,738 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:27,742 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:27,743 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:27,743 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2021-06-05 12:21:27,764 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-06-05 12:21:27,765 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:27,769 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:27,770 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:27,770 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:21 [2021-06-05 12:21:27,886 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 12:21:27,886 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 12:21:27,888 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:27,893 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:27,893 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:27,893 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:19 [2021-06-05 12:21:27,923 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:21:27,927 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:21:27,928 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:27,931 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:27,931 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:27,937 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:27,938 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:27,938 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:19 [2021-06-05 12:21:27,990 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:21:27,994 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:21:27,995 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:27,998 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:27,999 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:28,006 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:28,007 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:28,007 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:14 [2021-06-05 12:21:28,054 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 12:21:28,055 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:28,060 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:28,060 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:28,060 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2021-06-05 12:21:28,090 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-06-05 12:21:28,091 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:28,097 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:28,098 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:28,098 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2021-06-05 12:21:28,134 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2021-06-05 12:21:28,135 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:28,140 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:28,141 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 12:21:28,141 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2021-06-05 12:21:28,193 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-06-05 12:21:28,194 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:28,199 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:28,202 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2021-06-05 12:21:28,202 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:43, output treesize:32 [2021-06-05 12:21:28,256 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-06-05 12:21:28,256 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2021-06-05 12:21:28,257 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:28,262 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:28,263 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 12:21:28,264 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:16 [2021-06-05 12:21:30,277 WARN L860 $PredicateComparison]: unable to prove that (exists ((t_funThread2of2ForFork0_~p~0.offset Int) (|t_funThread2of2ForFork0_#t~post38| Int)) (and (not (= t_funThread2of2ForFork0_~p~0.offset c_t_funThread1of2ForFork0_~p~0.offset)) (= (select |c_#memory_int| c_t_funThread1of2ForFork0_~p~0.base) (store ((as const (Array Int Int)) 0) t_funThread2of2ForFork0_~p~0.offset (+ |t_funThread2of2ForFork0_#t~post38| 1))))) is different from true [2021-06-05 12:21:30,324 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 12:21:30,325 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:30,328 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:30,330 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-06-05 12:21:30,330 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:23, output treesize:16 [2021-06-05 12:21:31,104 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:21:31,104 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602264438] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:31,104 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:21:31,104 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2021-06-05 12:21:31,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158974011] [2021-06-05 12:21:31,104 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-05 12:21:31,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:21:31,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-05 12:21:31,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=700, Unknown=2, NotChecked=54, Total=870 [2021-06-05 12:21:31,105 INFO L87 Difference]: Start difference. First operand 13088 states and 36280 transitions. Second operand has 30 states, 30 states have (on average 5.733333333333333) internal successors, (172), 30 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:33,884 WARN L205 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2021-06-05 12:21:37,295 WARN L205 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-05 12:22:44,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:22:44,517 INFO L93 Difference]: Finished difference Result 21679 states and 59188 transitions. [2021-06-05 12:22:44,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-06-05 12:22:44,517 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.733333333333333) internal successors, (172), 30 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2021-06-05 12:22:44,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:22:44,538 INFO L225 Difference]: With dead ends: 21679 [2021-06-05 12:22:44,538 INFO L226 Difference]: Without dead ends: 21118 [2021-06-05 12:22:44,539 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 126 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1015 ImplicationChecksByTransitivity, 25250.1ms TimeCoverageRelationStatistics Valid=682, Invalid=3085, Unknown=19, NotChecked=120, Total=3906 [2021-06-05 12:22:44,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21118 states. [2021-06-05 12:22:44,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21118 to 14492. [2021-06-05 12:22:44,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14492 states, 14488 states have (on average 2.769464384318056) internal successors, (40124), 14491 states have internal predecessors, (40124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:44,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14492 states to 14492 states and 40124 transitions. [2021-06-05 12:22:44,804 INFO L78 Accepts]: Start accepts. Automaton has 14492 states and 40124 transitions. Word has length 138 [2021-06-05 12:22:44,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:22:44,805 INFO L482 AbstractCegarLoop]: Abstraction has 14492 states and 40124 transitions. [2021-06-05 12:22:44,805 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 5.733333333333333) internal successors, (172), 30 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:44,805 INFO L276 IsEmpty]: Start isEmpty. Operand 14492 states and 40124 transitions. [2021-06-05 12:22:44,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-06-05 12:22:44,815 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:22:44,815 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:22:45,015 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:22:45,016 INFO L430 AbstractCegarLoop]: === Iteration 20 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:22:45,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:22:45,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1839384835, now seen corresponding path program 2 times [2021-06-05 12:22:45,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:22:45,016 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894696957] [2021-06-05 12:22:45,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:22:45,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:22:45,392 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:22:45,393 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:22:45,393 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894696957] [2021-06-05 12:22:45,393 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894696957] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:22:45,393 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488431795] [2021-06-05 12:22:45,393 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:22:45,474 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:22:45,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:22:45,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 12:22:45,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:22:45,497 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 12:22:45,497 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:45,499 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:45,499 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:45,499 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:22:45,518 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 12:22:45,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 12:22:45,520 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:45,525 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:45,526 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:45,526 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2021-06-05 12:22:45,549 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-06-05 12:22:45,550 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:45,556 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:45,557 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:45,557 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:21 [2021-06-05 12:22:45,684 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 12:22:45,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 12:22:45,687 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:45,692 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:45,693 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:45,693 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:19 [2021-06-05 12:22:45,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:22:45,727 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:22:45,727 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:45,731 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:45,731 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:45,737 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:45,738 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:45,738 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:19 [2021-06-05 12:22:45,794 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:22:45,798 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:22:45,799 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:45,802 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:45,803 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:45,810 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:45,812 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:45,812 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:14 [2021-06-05 12:22:45,852 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 12:22:45,852 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:45,857 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:45,858 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:45,858 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2021-06-05 12:22:45,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-06-05 12:22:45,898 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:45,904 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:45,906 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 12:22:45,907 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:30 [2021-06-05 12:22:46,015 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-06-05 12:22:46,016 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2021-06-05 12:22:46,017 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:46,022 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:46,023 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:46,024 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:14 [2021-06-05 12:22:46,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2021-06-05 12:22:46,056 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:46,059 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:46,061 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 12:22:46,061 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:16 [2021-06-05 12:22:48,078 WARN L860 $PredicateComparison]: unable to prove that (exists ((t_funThread2of2ForFork0_~p~0.offset Int) (|t_funThread2of2ForFork0_#t~post38| Int)) (and (not (= t_funThread2of2ForFork0_~p~0.offset c_t_funThread1of2ForFork0_~p~0.offset)) (= (select |c_#memory_int| c_t_funThread1of2ForFork0_~p~0.base) (store ((as const (Array Int Int)) 0) t_funThread2of2ForFork0_~p~0.offset (+ |t_funThread2of2ForFork0_#t~post38| 1))))) is different from true [2021-06-05 12:22:48,132 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 12:22:48,133 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:48,136 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:48,138 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-06-05 12:22:48,138 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:23, output treesize:16 [2021-06-05 12:22:48,895 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:22:48,895 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488431795] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:22:48,895 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:22:48,895 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 30 [2021-06-05 12:22:48,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570183825] [2021-06-05 12:22:48,895 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-05 12:22:48,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:22:48,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-05 12:22:48,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=708, Unknown=2, NotChecked=54, Total=870 [2021-06-05 12:22:48,896 INFO L87 Difference]: Start difference. First operand 14492 states and 40124 transitions. Second operand has 30 states, 30 states have (on average 5.433333333333334) internal successors, (163), 30 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:50,877 WARN L205 SmtUtils]: Spent 865.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2021-06-05 12:25:04,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:25:04,142 INFO L93 Difference]: Finished difference Result 19551 states and 53835 transitions. [2021-06-05 12:25:04,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-05 12:25:04,142 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.433333333333334) internal successors, (163), 30 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2021-06-05 12:25:04,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:25:04,162 INFO L225 Difference]: With dead ends: 19551 [2021-06-05 12:25:04,163 INFO L226 Difference]: Without dead ends: 18606 [2021-06-05 12:25:04,163 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 127 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 55887.8ms TimeCoverageRelationStatistics Valid=563, Invalid=2270, Unknown=33, NotChecked=104, Total=2970 [2021-06-05 12:25:04,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18606 states. [2021-06-05 12:25:04,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18606 to 15709. [2021-06-05 12:25:04,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15709 states, 15705 states have (on average 2.773893664438077) internal successors, (43564), 15708 states have internal predecessors, (43564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:25:04,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15709 states to 15709 states and 43564 transitions. [2021-06-05 12:25:04,446 INFO L78 Accepts]: Start accepts. Automaton has 15709 states and 43564 transitions. Word has length 138 [2021-06-05 12:25:04,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:25:04,446 INFO L482 AbstractCegarLoop]: Abstraction has 15709 states and 43564 transitions. [2021-06-05 12:25:04,446 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 5.433333333333334) internal successors, (163), 30 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:25:04,446 INFO L276 IsEmpty]: Start isEmpty. Operand 15709 states and 43564 transitions. [2021-06-05 12:25:04,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-06-05 12:25:04,458 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:25:04,458 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:25:04,658 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2021-06-05 12:25:04,659 INFO L430 AbstractCegarLoop]: === Iteration 21 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:25:04,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:25:04,659 INFO L82 PathProgramCache]: Analyzing trace with hash -924706075, now seen corresponding path program 1 times [2021-06-05 12:25:04,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:25:04,659 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661742250] [2021-06-05 12:25:04,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:25:04,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:25:04,888 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:25:04,888 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:25:04,888 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661742250] [2021-06-05 12:25:04,888 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661742250] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:25:04,888 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248591606] [2021-06-05 12:25:04,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:25:04,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:25:04,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 19 conjunts are in the unsatisfiable core [2021-06-05 12:25:04,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:25:04,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 12:25:04,985 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:25:04,986 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:25:04,986 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:25:04,986 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:25:04,991 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-06-05 12:25:04,992 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:25:04,995 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:25:04,996 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:25:04,996 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:25:05,082 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:25:05,082 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 12:25:05,084 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:25:05,087 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:25:05,087 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:25:05,087 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:25:05,098 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:25:05,102 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:25:05,103 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:25:05,106 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:25:05,107 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:25:05,111 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:25:05,112 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:25:05,113 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-05 12:25:05,143 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:25:05,146 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:25:05,147 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:25:05,150 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:25:05,151 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:25:05,156 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:25:05,157 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:25:05,157 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:29, output treesize:10 [2021-06-05 12:25:05,195 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 12:25:05,196 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:25:05,201 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:25:05,202 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:25:05,202 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2021-06-05 12:25:05,233 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-06-05 12:25:05,233 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 12:25:05,235 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:25:05,239 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:25:05,239 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:25:05,240 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:14 [2021-06-05 12:25:05,334 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2021-06-05 12:25:05,334 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:25:05,338 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:25:05,341 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 12:25:05,341 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:16 [2021-06-05 12:25:07,348 WARN L860 $PredicateComparison]: unable to prove that (exists ((t_funThread1of2ForFork0_~p~0.offset Int) (|t_funThread1of2ForFork0_#t~post38| Int)) (and (= (store ((as const (Array Int Int)) 0) t_funThread1of2ForFork0_~p~0.offset (+ |t_funThread1of2ForFork0_#t~post38| 1)) (select |c_#memory_int| c_t_funThread2of2ForFork0_~p~0.base)) (not (= c_t_funThread2of2ForFork0_~p~0.offset t_funThread1of2ForFork0_~p~0.offset)))) is different from true [2021-06-05 12:25:07,386 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 12:25:07,387 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:25:07,390 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:25:07,392 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-06-05 12:25:07,392 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:23, output treesize:16 [2021-06-05 12:25:08,153 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:25:08,154 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248591606] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:25:08,154 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:25:08,154 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 23 [2021-06-05 12:25:08,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301975776] [2021-06-05 12:25:08,154 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 12:25:08,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:25:08,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 12:25:08,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=390, Unknown=2, NotChecked=40, Total=506 [2021-06-05 12:25:08,155 INFO L87 Difference]: Start difference. First operand 15709 states and 43564 transitions. Second operand has 23 states, 23 states have (on average 5.217391304347826) internal successors, (120), 23 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:25:11,826 WARN L205 SmtUtils]: Spent 2.42 s on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2021-06-05 12:26:48,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:26:48,478 INFO L93 Difference]: Finished difference Result 18949 states and 52172 transitions. [2021-06-05 12:26:48,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-05 12:26:48,479 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.217391304347826) internal successors, (120), 23 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2021-06-05 12:26:48,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:26:48,499 INFO L225 Difference]: With dead ends: 18949 [2021-06-05 12:26:48,500 INFO L226 Difference]: Without dead ends: 18729 [2021-06-05 12:26:48,500 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 132 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 45948.9ms TimeCoverageRelationStatistics Valid=377, Invalid=1662, Unknown=35, NotChecked=88, Total=2162 [2021-06-05 12:26:48,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18729 states. [2021-06-05 12:26:48,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18729 to 16570. [2021-06-05 12:26:48,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16570 states, 16566 states have (on average 2.769407219606423) internal successors, (45878), 16569 states have internal predecessors, (45878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:26:48,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16570 states to 16570 states and 45878 transitions. [2021-06-05 12:26:48,781 INFO L78 Accepts]: Start accepts. Automaton has 16570 states and 45878 transitions. Word has length 138 [2021-06-05 12:26:48,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:26:48,781 INFO L482 AbstractCegarLoop]: Abstraction has 16570 states and 45878 transitions. [2021-06-05 12:26:48,781 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 5.217391304347826) internal successors, (120), 23 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:26:48,781 INFO L276 IsEmpty]: Start isEmpty. Operand 16570 states and 45878 transitions. [2021-06-05 12:26:48,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-06-05 12:26:48,796 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:26:48,796 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:26:48,996 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:26:48,997 INFO L430 AbstractCegarLoop]: === Iteration 22 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:26:48,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:26:48,997 INFO L82 PathProgramCache]: Analyzing trace with hash 963341595, now seen corresponding path program 2 times [2021-06-05 12:26:48,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:26:48,997 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101045686] [2021-06-05 12:26:48,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:26:49,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:26:49,319 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:26:49,320 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:26:49,320 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101045686] [2021-06-05 12:26:49,320 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101045686] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:26:49,320 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880186664] [2021-06-05 12:26:49,320 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:26:49,413 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:26:49,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:26:49,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 12:26:49,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:26:49,426 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 12:26:49,427 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:26:49,428 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:26:49,428 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:26:49,429 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:26:49,448 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 12:26:49,448 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 12:26:49,449 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:26:49,453 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:26:49,454 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:26:49,454 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2021-06-05 12:26:49,473 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-06-05 12:26:49,474 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:26:49,479 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:26:49,480 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:26:49,480 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:21 [2021-06-05 12:26:49,618 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 12:26:49,618 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 12:26:49,620 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:26:49,625 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:26:49,626 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:26:49,626 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:19 [2021-06-05 12:26:49,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:26:49,659 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:26:49,660 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:26:49,663 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:26:49,664 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:26:49,670 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:26:49,671 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:26:49,671 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:19 [2021-06-05 12:26:49,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:26:49,728 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:26:49,728 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:26:49,732 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:26:49,732 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:26:49,740 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:26:49,741 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:26:49,741 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:14 [2021-06-05 12:26:49,795 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 12:26:49,796 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:26:49,801 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:26:49,802 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:26:49,802 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2021-06-05 12:26:49,838 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-06-05 12:26:49,839 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:26:49,846 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:26:49,848 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 12:26:49,848 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:30 [2021-06-05 12:26:49,904 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2021-06-05 12:26:49,905 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:26:49,911 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:26:49,914 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2021-06-05 12:26:49,914 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:40, output treesize:32 [2021-06-05 12:26:50,384 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-06-05 12:26:50,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2021-06-05 12:26:50,386 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:26:50,390 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:26:50,392 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 12:26:50,392 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:16 [2021-06-05 12:26:52,407 WARN L860 $PredicateComparison]: unable to prove that (exists ((t_funThread1of2ForFork0_~p~0.offset Int) (|t_funThread1of2ForFork0_#t~post38| Int)) (and (= (store ((as const (Array Int Int)) 0) t_funThread1of2ForFork0_~p~0.offset (+ |t_funThread1of2ForFork0_#t~post38| 1)) (select |c_#memory_int| c_t_funThread2of2ForFork0_~p~0.base)) (not (= c_t_funThread2of2ForFork0_~p~0.offset t_funThread1of2ForFork0_~p~0.offset)))) is different from true [2021-06-05 12:26:52,462 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 12:26:52,463 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:26:52,467 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:26:52,468 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-06-05 12:26:52,468 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:23, output treesize:16 [2021-06-05 12:26:53,225 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:26:53,225 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880186664] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:26:53,225 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:26:53,225 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 30 [2021-06-05 12:26:53,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81397946] [2021-06-05 12:26:53,225 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-05 12:26:53,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:26:53,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-05 12:26:53,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=712, Unknown=3, NotChecked=54, Total=870 [2021-06-05 12:26:53,226 INFO L87 Difference]: Start difference. First operand 16570 states and 45878 transitions. Second operand has 30 states, 30 states have (on average 5.433333333333334) internal successors, (163), 30 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:26:55,737 WARN L205 SmtUtils]: Spent 926.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2021-06-05 12:26:57,967 WARN L205 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2021-06-05 12:29:17,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:29:17,187 INFO L93 Difference]: Finished difference Result 19594 states and 53910 transitions. [2021-06-05 12:29:17,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-06-05 12:29:17,189 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.433333333333334) internal successors, (163), 30 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2021-06-05 12:29:17,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:29:17,210 INFO L225 Difference]: With dead ends: 19594 [2021-06-05 12:29:17,211 INFO L226 Difference]: Without dead ends: 19384 [2021-06-05 12:29:17,211 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 127 SyntacticMatches, 9 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 953 ImplicationChecksByTransitivity, 58643.4ms TimeCoverageRelationStatistics Valid=625, Invalid=2763, Unknown=38, NotChecked=114, Total=3540 [2021-06-05 12:29:17,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19384 states. [2021-06-05 12:29:17,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19384 to 16603. [2021-06-05 12:29:17,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16603 states, 16599 states have (on average 2.76968492077836) internal successors, (45974), 16602 states have internal predecessors, (45974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:29:17,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16603 states to 16603 states and 45974 transitions. [2021-06-05 12:29:17,494 INFO L78 Accepts]: Start accepts. Automaton has 16603 states and 45974 transitions. Word has length 138 [2021-06-05 12:29:17,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:29:17,494 INFO L482 AbstractCegarLoop]: Abstraction has 16603 states and 45974 transitions. [2021-06-05 12:29:17,494 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 5.433333333333334) internal successors, (163), 30 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:29:17,495 INFO L276 IsEmpty]: Start isEmpty. Operand 16603 states and 45974 transitions. [2021-06-05 12:29:17,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-06-05 12:29:17,509 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:29:17,509 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:29:17,716 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2021-06-05 12:29:17,717 INFO L430 AbstractCegarLoop]: === Iteration 23 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:29:17,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:29:17,717 INFO L82 PathProgramCache]: Analyzing trace with hash -999250315, now seen corresponding path program 3 times [2021-06-05 12:29:17,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:29:17,717 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557202811] [2021-06-05 12:29:17,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:29:17,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:29:17,926 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:29:17,927 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:29:17,927 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557202811] [2021-06-05 12:29:17,927 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557202811] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:29:17,927 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201249430] [2021-06-05 12:29:17,927 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:29:18,009 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 12:29:18,009 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:29:18,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 24 conjunts are in the unsatisfiable core [2021-06-05 12:29:18,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:29:18,022 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 12:29:18,022 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:29:18,024 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:18,024 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:29:18,024 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:29:18,045 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 12:29:18,046 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 12:29:18,047 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:29:18,051 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:18,051 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:29:18,051 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2021-06-05 12:29:18,071 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-06-05 12:29:18,071 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:29:18,076 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:18,077 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:29:18,077 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:21 [2021-06-05 12:29:18,184 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 12:29:18,185 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 12:29:18,186 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:29:18,191 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:18,192 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:29:18,192 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:19 [2021-06-05 12:29:18,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:29:18,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:29:18,225 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:29:18,228 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:18,229 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:29:18,235 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:18,236 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:29:18,236 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:19 [2021-06-05 12:29:18,288 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:29:18,292 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:29:18,293 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:29:18,296 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:18,297 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:29:18,304 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:18,306 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:29:18,306 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:14 [2021-06-05 12:29:18,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 12:29:18,345 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:29:18,350 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:18,351 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:29:18,351 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2021-06-05 12:29:18,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-06-05 12:29:18,385 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:29:18,391 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:18,392 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:29:18,392 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2021-06-05 12:29:18,428 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2021-06-05 12:29:18,429 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:29:18,436 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:18,437 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 12:29:18,437 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2021-06-05 12:29:18,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-06-05 12:29:18,904 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:29:18,910 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:18,913 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2021-06-05 12:29:18,913 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:43, output treesize:32 [2021-06-05 12:29:18,964 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-06-05 12:29:18,964 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2021-06-05 12:29:18,966 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:29:18,970 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:18,973 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 12:29:18,973 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:16 [2021-06-05 12:29:20,987 WARN L860 $PredicateComparison]: unable to prove that (exists ((t_funThread1of2ForFork0_~p~0.offset Int) (|t_funThread1of2ForFork0_#t~post38| Int)) (and (= (store ((as const (Array Int Int)) 0) t_funThread1of2ForFork0_~p~0.offset (+ |t_funThread1of2ForFork0_#t~post38| 1)) (select |c_#memory_int| c_t_funThread2of2ForFork0_~p~0.base)) (not (= c_t_funThread2of2ForFork0_~p~0.offset t_funThread1of2ForFork0_~p~0.offset)))) is different from true [2021-06-05 12:29:21,028 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 12:29:21,029 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:29:21,033 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:29:21,035 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-06-05 12:29:21,035 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:23, output treesize:16 [2021-06-05 12:29:21,794 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:29:21,795 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201249430] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:29:21,795 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:29:21,795 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 29 [2021-06-05 12:29:21,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449314826] [2021-06-05 12:29:21,795 INFO L462 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-06-05 12:29:21,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:29:21,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-06-05 12:29:21,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=659, Unknown=3, NotChecked=52, Total=812 [2021-06-05 12:29:21,796 INFO L87 Difference]: Start difference. First operand 16603 states and 45974 transitions. Second operand has 29 states, 29 states have (on average 5.620689655172414) internal successors, (163), 29 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:29:25,335 WARN L205 SmtUtils]: Spent 1.82 s on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2021-06-05 12:29:28,137 WARN L205 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2021-06-05 12:33:02,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:33:02,748 INFO L93 Difference]: Finished difference Result 25612 states and 69831 transitions. [2021-06-05 12:33:02,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-06-05 12:33:02,750 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 5.620689655172414) internal successors, (163), 29 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2021-06-05 12:33:02,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:33:02,776 INFO L225 Difference]: With dead ends: 25612 [2021-06-05 12:33:02,776 INFO L226 Difference]: Without dead ends: 24906 [2021-06-05 12:33:02,777 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 126 SyntacticMatches, 5 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1238 ImplicationChecksByTransitivity, 78846.8ms TimeCoverageRelationStatistics Valid=804, Invalid=3576, Unknown=46, NotChecked=130, Total=4556 [2021-06-05 12:33:02,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24906 states. [2021-06-05 12:33:03,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24906 to 17322. [2021-06-05 12:33:03,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17322 states, 17318 states have (on average 2.768853216306733) internal successors, (47951), 17321 states have internal predecessors, (47951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:33:03,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17322 states to 17322 states and 47951 transitions. [2021-06-05 12:33:03,087 INFO L78 Accepts]: Start accepts. Automaton has 17322 states and 47951 transitions. Word has length 138 [2021-06-05 12:33:03,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:33:03,087 INFO L482 AbstractCegarLoop]: Abstraction has 17322 states and 47951 transitions. [2021-06-05 12:33:03,087 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 5.620689655172414) internal successors, (163), 29 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:33:03,087 INFO L276 IsEmpty]: Start isEmpty. Operand 17322 states and 47951 transitions. [2021-06-05 12:33:03,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-06-05 12:33:03,102 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:33:03,102 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:33:03,313 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2021-06-05 12:33:03,313 INFO L430 AbstractCegarLoop]: === Iteration 24 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:33:03,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:33:03,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1315774173, now seen corresponding path program 4 times [2021-06-05 12:33:03,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:33:03,314 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111143376] [2021-06-05 12:33:03,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:33:03,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:33:03,528 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:33:03,528 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:33:03,528 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111143376] [2021-06-05 12:33:03,529 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111143376] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:33:03,529 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831129787] [2021-06-05 12:33:03,529 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:33:03,636 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 12:33:03,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:33:03,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 19 conjunts are in the unsatisfiable core [2021-06-05 12:33:03,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:33:03,667 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 12:33:03,668 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:33:03,669 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:33:03,669 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:33:03,669 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:33:03,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-06-05 12:33:03,674 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:33:03,677 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:33:03,677 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:33:03,677 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:33:03,749 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:33:03,749 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 12:33:03,750 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:33:03,753 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:33:03,754 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:33:03,754 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:33:03,765 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:33:03,768 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:33:03,768 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:33:03,772 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:33:03,772 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:33:03,776 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:33:03,777 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:33:03,777 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-05 12:33:03,806 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:33:03,810 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:33:03,810 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:33:03,874 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:33:03,875 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:33:03,880 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:33:03,881 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:33:03,881 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:29, output treesize:10 [2021-06-05 12:33:03,900 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 12:33:03,901 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:33:03,918 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:33:03,919 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:33:03,919 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2021-06-05 12:33:03,944 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-06-05 12:33:03,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 12:33:03,960 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:33:03,964 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:33:03,964 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:33:03,965 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:14 [2021-06-05 12:33:04,001 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2021-06-05 12:33:04,002 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:33:04,005 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:33:04,007 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 12:33:04,007 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:16 [2021-06-05 12:33:06,028 WARN L860 $PredicateComparison]: unable to prove that (exists ((t_funThread1of2ForFork0_~p~0.offset Int) (|t_funThread1of2ForFork0_#t~post38| Int)) (and (= (store ((as const (Array Int Int)) 0) t_funThread1of2ForFork0_~p~0.offset (+ |t_funThread1of2ForFork0_#t~post38| 1)) (select |c_#memory_int| c_t_funThread2of2ForFork0_~p~0.base)) (not (= c_t_funThread2of2ForFork0_~p~0.offset t_funThread1of2ForFork0_~p~0.offset)))) is different from true [2021-06-05 12:33:06,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 12:33:06,064 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:33:06,068 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:33:06,070 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-06-05 12:33:06,070 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:23, output treesize:16 [2021-06-05 12:33:06,811 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:33:06,811 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831129787] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:33:06,811 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:33:06,811 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2021-06-05 12:33:06,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088219876] [2021-06-05 12:33:06,812 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 12:33:06,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:33:06,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 12:33:06,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=292, Unknown=2, NotChecked=34, Total=380 [2021-06-05 12:33:06,812 INFO L87 Difference]: Start difference. First operand 17322 states and 47951 transitions. Second operand has 20 states, 20 states have (on average 5.9) internal successors, (118), 20 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:33:07,736 WARN L205 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 23 Received shutdown request... [2021-06-05 12:33:30,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 12:33:30,255 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:33:30,255 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-05 12:33:30,256 INFO L315 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT (1/2) [2021-06-05 12:33:30,257 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 12:33:30,257 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 12:33:30,257 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 12:33:30,257 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 12:33:30,257 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 12:33:30,257 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 12:33:30,257 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 12:33:30,257 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 12:33:30,257 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == InUseError======== [2021-06-05 12:33:30,258 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 211 places, 251 transitions, 520 flow [2021-06-05 12:33:30,259 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-05 12:33:30,259 INFO L315 ceAbstractionStarter]: Result for error location InUseError was TIMEOUT (2/2) [2021-06-05 12:33:30,259 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2021-06-05 12:33:30,260 WARN L196 ceAbstractionStarter]: Timeout [2021-06-05 12:33:30,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 12:33:30 BasicIcfg [2021-06-05 12:33:30,261 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 12:33:30,261 INFO L168 Benchmark]: Toolchain (without parser) took 861755.64 ms. Allocated memory was 362.8 MB in the beginning and 15.1 GB in the end (delta: 14.7 GB). Free memory was 324.8 MB in the beginning and 7.4 GB in the end (delta: -7.1 GB). Peak memory consumption was 7.6 GB. Max. memory is 16.0 GB. [2021-06-05 12:33:30,261 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 362.8 MB. Free memory was 343.3 MB in the beginning and 343.2 MB in the end (delta: 69.3 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 12:33:30,261 INFO L168 Benchmark]: CACSL2BoogieTranslator took 597.45 ms. Allocated memory is still 362.8 MB. Free memory was 324.6 MB in the beginning and 298.9 MB in the end (delta: 25.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 16.0 GB. [2021-06-05 12:33:30,261 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.57 ms. Allocated memory is still 362.8 MB. Free memory was 298.9 MB in the beginning and 296.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 12:33:30,261 INFO L168 Benchmark]: Boogie Preprocessor took 20.76 ms. Allocated memory is still 362.8 MB. Free memory was 296.8 MB in the beginning and 294.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 12:33:30,261 INFO L168 Benchmark]: RCFGBuilder took 543.91 ms. Allocated memory is still 362.8 MB. Free memory was 294.7 MB in the beginning and 257.9 MB in the end (delta: 36.8 MB). Peak memory consumption was 37.7 MB. Max. memory is 16.0 GB. [2021-06-05 12:33:30,261 INFO L168 Benchmark]: TraceAbstraction took 860532.56 ms. Allocated memory was 362.8 MB in the beginning and 15.1 GB in the end (delta: 14.7 GB). Free memory was 256.9 MB in the beginning and 7.4 GB in the end (delta: -7.2 GB). Peak memory consumption was 7.6 GB. Max. memory is 16.0 GB. [2021-06-05 12:33:30,262 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09 ms. Allocated memory is still 362.8 MB. Free memory was 343.3 MB in the beginning and 343.2 MB in the end (delta: 69.3 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 597.45 ms. Allocated memory is still 362.8 MB. Free memory was 324.6 MB in the beginning and 298.9 MB in the end (delta: 25.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 49.57 ms. Allocated memory is still 362.8 MB. Free memory was 298.9 MB in the beginning and 296.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 20.76 ms. Allocated memory is still 362.8 MB. Free memory was 296.8 MB in the beginning and 294.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 543.91 ms. Allocated memory is still 362.8 MB. Free memory was 294.7 MB in the beginning and 257.9 MB in the end (delta: 36.8 MB). Peak memory consumption was 37.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 860532.56 ms. Allocated memory was 362.8 MB in the beginning and 15.1 GB in the end (delta: 14.7 GB). Free memory was 256.9 MB in the beginning and 7.4 GB in the end (delta: -7.2 GB). Peak memory consumption was 7.6 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 922]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (17322states) and FLOYD_HOARE automaton (currently 18 states, 20 states before enhancement),while ReachableStatesComputation was computing reachable states (13104 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 922]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (17322states) and FLOYD_HOARE automaton (currently 18 states, 20 states before enhancement),while ReachableStatesComputation was computing reachable states (13104 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 946]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing initial abstraction,while PetriNet2FiniteAutomaton was constructing automaton for Petri net that has has 211 places, 251 transitions, 520 flow. Already constructed 2 states. Currently 1 states in worklist.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 207 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5820.8ms, OverallIterations: 10, TraceHistogramMax: 5, EmptinessCheckTime: 25.9ms, AutomataDifference: 1087.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 84.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1076 SDtfs, 823 SDslu, 3255 SDs, 0 SdLazy, 515 SolverSat, 45 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 301.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 665 GetRequests, 538 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 906.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=3441occurred in iteration=0, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 221.9ms AutomataMinimizationTime, 10 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 142.7ms SsaConstructionTime, 277.0ms SatisfiabilityAnalysisTime, 1693.4ms InterpolantComputationTime, 1190 NumberOfCodeBlocks, 1155 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1172 ConstructedInterpolants, 2 QuantifiedInterpolants, 2708 SizeOfPredicates, 44 NumberOfNonLiveVariables, 1197 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 18 InterpolantComputations, 4 PerfectInterpolantSequences, 113/310 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 261 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 849100.0ms, OverallIterations: 24, TraceHistogramMax: 10, EmptinessCheckTime: 358.7ms, AutomataDifference: 711592.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 37996.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 6371 SDtfs, 13303 SDslu, 39341 SDs, 0 SdLazy, 8112 SolverSat, 691 SolverUnsat, 226 SolverUnknown, 0 SolverNotchecked, 435907.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2776 GetRequests, 2071 SyntacticMatches, 37 SemanticMatches, 668 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 6829 ImplicationChecksByTransitivity, 283045.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=185097occurred in iteration=0, InterpolantAutomatonStates: 440, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 66680.9ms AutomataMinimizationTime, 23 MinimizatonAttempts, 103486 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 296.5ms SsaConstructionTime, 668.8ms SatisfiabilityAnalysisTime, 26144.5ms InterpolantComputationTime, 4531 NumberOfCodeBlocks, 4381 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 4486 ConstructedInterpolants, 75 QuantifiedInterpolants, 35473 SizeOfPredicates, 224 NumberOfNonLiveVariables, 4215 ConjunctsInSsa, 285 ConjunctsInUnsatCore, 45 InterpolantComputations, 6 PerfectInterpolantSequences, 4867/6038 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 3 procedures, 207 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5477.9ms, OverallIterations: 12, TraceHistogramMax: 10, EmptinessCheckTime: 8.1ms, AutomataDifference: 1122.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 38.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1085 SDtfs, 180 SDslu, 7611 SDs, 0 SdLazy, 620 SolverSat, 67 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 242.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 815 GetRequests, 607 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1112 ImplicationChecksByTransitivity, 1259.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=3441occurred in iteration=0, InterpolantAutomatonStates: 167, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 87.1ms AutomataMinimizationTime, 11 MinimizatonAttempts, 27 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 99.0ms SsaConstructionTime, 271.6ms SatisfiabilityAnalysisTime, 1426.6ms InterpolantComputationTime, 1403 NumberOfCodeBlocks, 1389 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 1290 ConstructedInterpolants, 0 QuantifiedInterpolants, 2228 SizeOfPredicates, 90 NumberOfNonLiveVariables, 1232 ConjunctsInSsa, 108 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 100/1390 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 2 thread instances CFG has 4 procedures, 261 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 1.8ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown