/usr/bin/java -Xmx8000000000 -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.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-a47a088281b0b97d17910950432b7c5b5bc3adeb-a47a088 [2021-07-13 19:09:39,134 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-13 19:09:39,135 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-13 19:09:39,153 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-13 19:09:39,154 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-13 19:09:39,155 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-13 19:09:39,156 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-13 19:09:39,159 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-13 19:09:39,160 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-13 19:09:39,160 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-13 19:09:39,161 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-13 19:09:39,162 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-13 19:09:39,162 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-13 19:09:39,163 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-13 19:09:39,164 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-13 19:09:39,164 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-13 19:09:39,165 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-13 19:09:39,166 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-13 19:09:39,167 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-13 19:09:39,168 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-13 19:09:39,169 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-13 19:09:39,170 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-13 19:09:39,171 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-13 19:09:39,172 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-13 19:09:39,174 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-13 19:09:39,174 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-13 19:09:39,174 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-13 19:09:39,175 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-13 19:09:39,175 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-13 19:09:39,176 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-13 19:09:39,176 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-13 19:09:39,176 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-13 19:09:39,177 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-13 19:09:39,178 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-13 19:09:39,179 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-13 19:09:39,179 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-13 19:09:39,179 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-13 19:09:39,179 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-13 19:09:39,180 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-13 19:09:39,180 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-13 19:09:39,181 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-13 19:09:39,181 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2021-07-13 19:09:39,204 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-13 19:09:39,204 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-13 19:09:39,204 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-07-13 19:09:39,204 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-07-13 19:09:39,205 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-13 19:09:39,205 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-13 19:09:39,205 INFO L138 SettingsManager]: * Use SBE=true [2021-07-13 19:09:39,206 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-13 19:09:39,206 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-13 19:09:39,206 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-13 19:09:39,206 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-13 19:09:39,206 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-13 19:09:39,206 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-07-13 19:09:39,206 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-07-13 19:09:39,206 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-07-13 19:09:39,206 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-13 19:09:39,207 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-13 19:09:39,207 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-13 19:09:39,207 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-07-13 19:09:39,207 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-13 19:09:39,207 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-13 19:09:39,207 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-07-13 19:09:39,207 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-07-13 19:09:39,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-13 19:09:39,207 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-13 19:09:39,208 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-07-13 19:09:39,208 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-07-13 19:09:39,208 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-13 19:09:39,208 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-07-13 19:09:39,208 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-07-13 19:09:39,208 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-07-13 19:09:39,208 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-07-13 19:09:39,463 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-13 19:09:39,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-13 19:09:39,478 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-13 19:09:39,478 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-13 19:09:39,479 INFO L275 PluginConnector]: CDTParser initialized [2021-07-13 19:09:39,479 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i [2021-07-13 19:09:39,522 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ab66558b/28ac91a468db40d0bf5b200a5fe47ebb/FLAG2c91a758d [2021-07-13 19:09:39,954 INFO L306 CDTParser]: Found 1 translation units. [2021-07-13 19:09:39,955 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i [2021-07-13 19:09:39,966 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ab66558b/28ac91a468db40d0bf5b200a5fe47ebb/FLAG2c91a758d [2021-07-13 19:09:39,974 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ab66558b/28ac91a468db40d0bf5b200a5fe47ebb [2021-07-13 19:09:39,982 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-13 19:09:39,983 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-07-13 19:09:39,987 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-13 19:09:39,987 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-13 19:09:39,993 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-13 19:09:39,993 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 07:09:39" (1/1) ... [2021-07-13 19:09:39,994 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fc89946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:09:39, skipping insertion in model container [2021-07-13 19:09:39,994 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 07:09:39" (1/1) ... [2021-07-13 19:09:39,998 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-13 19:09:40,043 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-13 19:09:40,332 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_71-funloop_racing.i[41060,41073] [2021-07-13 19:09:40,364 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-13 19:09:40,380 INFO L203 MainTranslator]: Completed pre-run [2021-07-13 19:09:40,410 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_71-funloop_racing.i[41060,41073] [2021-07-13 19:09:40,416 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-13 19:09:40,465 INFO L208 MainTranslator]: Completed translation [2021-07-13 19:09:40,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:09:40 WrapperNode [2021-07-13 19:09:40,466 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-13 19:09:40,467 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-13 19:09:40,467 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-13 19:09:40,467 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-13 19:09:40,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:09:40" (1/1) ... [2021-07-13 19:09:40,498 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:09:40" (1/1) ... [2021-07-13 19:09:40,527 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-13 19:09:40,528 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-13 19:09:40,528 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-13 19:09:40,529 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-13 19:09:40,534 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:09:40" (1/1) ... [2021-07-13 19:09:40,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:09:40" (1/1) ... [2021-07-13 19:09:40,547 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:09:40" (1/1) ... [2021-07-13 19:09:40,547 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:09:40" (1/1) ... [2021-07-13 19:09:40,553 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:09:40" (1/1) ... [2021-07-13 19:09:40,562 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:09:40" (1/1) ... [2021-07-13 19:09:40,563 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:09:40" (1/1) ... [2021-07-13 19:09:40,565 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-13 19:09:40,566 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-13 19:09:40,566 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-13 19:09:40,566 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-13 19:09:40,566 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:09:40" (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-07-13 19:09:40,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-13 19:09:40,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-07-13 19:09:40,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-07-13 19:09:40,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-07-13 19:09:40,613 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-07-13 19:09:40,614 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2021-07-13 19:09:40,615 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2021-07-13 19:09:40,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-13 19:09:40,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-13 19:09:40,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-13 19:09:40,616 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-07-13 19:09:41,001 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-13 19:09:41,001 INFO L299 CfgBuilder]: Removed 49 assume(true) statements. [2021-07-13 19:09:41,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 07:09:41 BoogieIcfgContainer [2021-07-13 19:09:41,002 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-13 19:09:41,004 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-07-13 19:09:41,004 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-07-13 19:09:41,005 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-07-13 19:09:41,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 07:09:39" (1/3) ... [2021-07-13 19:09:41,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6af9d352 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 07:09:41, skipping insertion in model container [2021-07-13 19:09:41,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 07:09:40" (2/3) ... [2021-07-13 19:09:41,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6af9d352 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 07:09:41, skipping insertion in model container [2021-07-13 19:09:41,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 07:09:41" (3/3) ... [2021-07-13 19:09:41,007 INFO L111 eAbstractionObserver]: Analyzing ICFG 28-race_reach_71-funloop_racing.i [2021-07-13 19:09:41,011 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-07-13 19:09:41,011 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-07-13 19:09:41,011 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2021-07-13 19:09:41,012 INFO L474 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-07-13 19:09:41,037 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,038 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,038 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,038 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,038 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,038 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,038 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,038 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,038 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,038 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,039 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,039 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,039 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,039 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,039 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,039 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,039 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,039 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,039 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,039 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,039 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,039 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,039 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,040 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,040 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,040 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,040 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,040 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,041 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,041 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,041 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,041 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,041 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,041 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,041 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,041 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,041 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,041 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,042 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,042 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,042 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,042 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,042 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,042 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,042 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,042 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,042 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,042 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,042 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,042 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,042 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,042 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,042 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,042 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,043 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,043 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,043 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,043 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,043 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,043 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,043 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,044 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,044 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,044 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,044 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,044 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,044 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,044 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,044 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,044 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,045 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,045 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,045 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,045 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,045 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,045 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,045 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,045 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,045 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,045 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,045 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,045 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,045 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,045 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,046 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,047 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,047 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,047 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,047 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,047 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,047 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,047 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,047 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,047 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,048 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,048 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,048 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,048 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,049 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,050 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,050 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,052 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,052 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,053 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,054 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,057 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,057 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,057 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,057 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,057 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,057 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,058 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,058 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,058 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,058 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,058 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,058 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,058 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,058 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,058 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,058 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,058 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,058 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,058 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,058 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,058 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,059 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,059 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,059 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,059 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,059 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,059 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,059 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,059 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,059 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,059 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,059 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,059 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,059 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,059 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,059 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,060 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,060 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,060 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,060 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,060 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,060 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,060 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,060 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,060 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,060 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,060 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,060 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,060 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,060 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,061 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,061 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,061 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,061 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,061 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,061 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,061 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,061 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,061 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,063 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,063 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,063 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,063 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,063 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,063 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,063 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,063 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,063 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,063 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,063 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,064 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,064 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,064 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,064 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,064 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,064 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,064 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,064 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,064 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,064 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,064 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 19:09:41,071 INFO L149 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2021-07-13 19:09:41,088 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-13 19:09:41,108 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-13 19:09:41,108 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-13 19:09:41,108 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-13 19:09:41,108 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-13 19:09:41,108 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-13 19:09:41,108 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-13 19:09:41,108 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-13 19:09:41,109 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == t_funThread1of1ForFork0======== [2021-07-13 19:09:41,130 INFO L110 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 194 places, 236 transitions, 480 flow [2021-07-13 19:09:41,259 INFO L132 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5569 states, 5563 states have (on average 2.4786985439511056) internal successors, (13789), 5568 states have internal predecessors, (13789), 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-07-13 19:09:41,273 INFO L276 IsEmpty]: Start isEmpty. Operand has 5569 states, 5563 states have (on average 2.4786985439511056) internal successors, (13789), 5568 states have internal predecessors, (13789), 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-07-13 19:09:41,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-07-13 19:09:41,291 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:09:41,292 INFO L508 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-07-13 19:09:41,292 INFO L430 AbstractCegarLoop]: === Iteration 1 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:09:41,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:09:41,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1269470051, now seen corresponding path program 1 times [2021-07-13 19:09:41,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:09:41,302 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054726011] [2021-07-13 19:09:41,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:09:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:09:41,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 19:09:41,455 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:09:41,455 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054726011] [2021-07-13 19:09:41,455 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054726011] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 19:09:41,455 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 19:09:41,455 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-13 19:09:41,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828762520] [2021-07-13 19:09:41,458 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-07-13 19:09:41,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:09:41,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-07-13 19:09:41,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-07-13 19:09:41,477 INFO L87 Difference]: Start difference. First operand has 5569 states, 5563 states have (on average 2.4786985439511056) internal successors, (13789), 5568 states have internal predecessors, (13789), 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 23.5) internal successors, (47), 2 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-07-13 19:09:41,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:09:41,519 INFO L93 Difference]: Finished difference Result 5361 states and 10895 transitions. [2021-07-13 19:09:41,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-13 19:09:41,520 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 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-07-13 19:09:41,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:09:41,551 INFO L225 Difference]: With dead ends: 5361 [2021-07-13 19:09:41,552 INFO L226 Difference]: Without dead ends: 5331 [2021-07-13 19:09:41,555 INFO L764 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-07-13 19:09:41,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5331 states. [2021-07-13 19:09:41,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5331 to 5331. [2021-07-13 19:09:41,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5331 states, 5326 states have (on average 2.034923019151333) internal successors, (10838), 5330 states have internal predecessors, (10838), 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-07-13 19:09:41,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5331 states to 5331 states and 10838 transitions. [2021-07-13 19:09:41,812 INFO L78 Accepts]: Start accepts. Automaton has 5331 states and 10838 transitions. Word has length 47 [2021-07-13 19:09:41,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:09:41,812 INFO L482 AbstractCegarLoop]: Abstraction has 5331 states and 10838 transitions. [2021-07-13 19:09:41,813 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 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-07-13 19:09:41,813 INFO L276 IsEmpty]: Start isEmpty. Operand 5331 states and 10838 transitions. [2021-07-13 19:09:41,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-07-13 19:09:41,815 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:09:41,815 INFO L508 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-07-13 19:09:41,815 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-07-13 19:09:41,815 INFO L430 AbstractCegarLoop]: === Iteration 2 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:09:41,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:09:41,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1962571748, now seen corresponding path program 1 times [2021-07-13 19:09:41,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:09:41,818 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681311806] [2021-07-13 19:09:41,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:09:41,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:09:41,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 19:09:41,871 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:09:41,871 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681311806] [2021-07-13 19:09:41,871 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681311806] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 19:09:41,871 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 19:09:41,871 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-13 19:09:41,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317797151] [2021-07-13 19:09:41,872 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-13 19:09:41,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:09:41,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-13 19:09:41,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-13 19:09:41,873 INFO L87 Difference]: Start difference. First operand 5331 states and 10838 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-07-13 19:09:41,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:09:41,910 INFO L93 Difference]: Finished difference Result 5335 states and 10842 transitions. [2021-07-13 19:09:41,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-13 19:09:41,911 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-07-13 19:09:41,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:09:41,929 INFO L225 Difference]: With dead ends: 5335 [2021-07-13 19:09:41,929 INFO L226 Difference]: Without dead ends: 5335 [2021-07-13 19:09:41,929 INFO L764 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-07-13 19:09:41,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5335 states. [2021-07-13 19:09:42,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5335 to 5332. [2021-07-13 19:09:42,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5332 states, 5327 states have (on average 2.0347287403792005) internal successors, (10839), 5331 states have internal predecessors, (10839), 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-07-13 19:09:42,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5332 states to 5332 states and 10839 transitions. [2021-07-13 19:09:42,097 INFO L78 Accepts]: Start accepts. Automaton has 5332 states and 10839 transitions. Word has length 47 [2021-07-13 19:09:42,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:09:42,097 INFO L482 AbstractCegarLoop]: Abstraction has 5332 states and 10839 transitions. [2021-07-13 19:09:42,097 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-07-13 19:09:42,097 INFO L276 IsEmpty]: Start isEmpty. Operand 5332 states and 10839 transitions. [2021-07-13 19:09:42,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-07-13 19:09:42,100 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:09:42,100 INFO L508 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] [2021-07-13 19:09:42,101 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-07-13 19:09:42,101 INFO L430 AbstractCegarLoop]: === Iteration 3 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:09:42,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:09:42,101 INFO L82 PathProgramCache]: Analyzing trace with hash -2115124251, now seen corresponding path program 1 times [2021-07-13 19:09:42,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:09:42,101 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307637333] [2021-07-13 19:09:42,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:09:42,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:09:42,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 19:09:42,190 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:09:42,190 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307637333] [2021-07-13 19:09:42,190 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307637333] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:09:42,190 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135027379] [2021-07-13 19:09:42,191 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-07-13 19:09:42,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:09:42,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2021-07-13 19:09:42,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-13 19:09:42,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 19:09:42,365 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135027379] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:09:42,365 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-13 19:09:42,365 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-07-13 19:09:42,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193330251] [2021-07-13 19:09:42,365 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-13 19:09:42,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:09:42,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-13 19:09:42,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-07-13 19:09:42,366 INFO L87 Difference]: Start difference. First operand 5332 states and 10839 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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-07-13 19:09:42,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:09:42,419 INFO L93 Difference]: Finished difference Result 5340 states and 10847 transitions. [2021-07-13 19:09:42,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-13 19:09:42,420 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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 52 [2021-07-13 19:09:42,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:09:42,437 INFO L225 Difference]: With dead ends: 5340 [2021-07-13 19:09:42,437 INFO L226 Difference]: Without dead ends: 5340 [2021-07-13 19:09:42,437 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 26.4ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-07-13 19:09:42,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5340 states. [2021-07-13 19:09:42,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5340 to 5337. [2021-07-13 19:09:42,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5337 states, 5332 states have (on average 2.0337584396099024) internal successors, (10844), 5336 states have internal predecessors, (10844), 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-07-13 19:09:42,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5337 states to 5337 states and 10844 transitions. [2021-07-13 19:09:42,582 INFO L78 Accepts]: Start accepts. Automaton has 5337 states and 10844 transitions. Word has length 52 [2021-07-13 19:09:42,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:09:42,582 INFO L482 AbstractCegarLoop]: Abstraction has 5337 states and 10844 transitions. [2021-07-13 19:09:42,583 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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-07-13 19:09:42,583 INFO L276 IsEmpty]: Start isEmpty. Operand 5337 states and 10844 transitions. [2021-07-13 19:09:42,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-07-13 19:09:42,584 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:09:42,584 INFO L508 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] [2021-07-13 19:09:42,800 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-07-13 19:09:42,800 INFO L430 AbstractCegarLoop]: === Iteration 4 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:09:42,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:09:42,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1189007492, now seen corresponding path program 2 times [2021-07-13 19:09:42,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:09:42,801 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016959877] [2021-07-13 19:09:42,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:09:42,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:09:42,885 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 19:09:42,885 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:09:42,885 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016959877] [2021-07-13 19:09:42,885 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016959877] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:09:42,885 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292726020] [2021-07-13 19:09:42,885 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 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-07-13 19:09:42,956 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-07-13 19:09:42,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-13 19:09:42,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 14 conjunts are in the unsatisfiable core [2021-07-13 19:09:42,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-13 19:09:42,997 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-07-13 19:09:43,000 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:09:43,001 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:09:43,001 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:09:43,001 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-07-13 19:09:43,015 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-07-13 19:09:43,016 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:09:43,018 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:09:43,019 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:09:43,019 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-07-13 19:09:43,101 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-07-13 19:09:43,101 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-07-13 19:09:43,105 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:09:43,108 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:09:43,109 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:09:43,109 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-07-13 19:09:43,144 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-07-13 19:09:43,148 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-07-13 19:09:43,149 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-13 19:09:43,152 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:09:43,153 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:09:43,157 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:09:43,160 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:09:43,160 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-07-13 19:09:43,216 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-07-13 19:09:43,217 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:09:43,219 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:09:43,219 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-07-13 19:09:43,219 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-07-13 19:09:43,273 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-07-13 19:09:43,274 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292726020] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 19:09:43,274 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-07-13 19:09:43,274 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 16 [2021-07-13 19:09:43,274 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265469012] [2021-07-13 19:09:43,274 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-07-13 19:09:43,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:09:43,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-07-13 19:09:43,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-07-13 19:09:43,276 INFO L87 Difference]: Start difference. First operand 5337 states and 10844 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 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-07-13 19:09:44,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:09:44,199 INFO L93 Difference]: Finished difference Result 15159 states and 30816 transitions. [2021-07-13 19:09:44,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-07-13 19:09:44,200 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 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-07-13 19:09:44,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:09:44,270 INFO L225 Difference]: With dead ends: 15159 [2021-07-13 19:09:44,270 INFO L226 Difference]: Without dead ends: 15159 [2021-07-13 19:09:44,271 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 478.7ms TimeCoverageRelationStatistics Valid=389, Invalid=1503, Unknown=0, NotChecked=0, Total=1892 [2021-07-13 19:09:44,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15159 states. [2021-07-13 19:09:44,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15159 to 7811. [2021-07-13 19:09:44,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7811 states, 7806 states have (on average 2.0397130412503204) internal successors, (15922), 7810 states have internal predecessors, (15922), 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-07-13 19:09:44,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7811 states to 7811 states and 15922 transitions. [2021-07-13 19:09:44,462 INFO L78 Accepts]: Start accepts. Automaton has 7811 states and 15922 transitions. Word has length 57 [2021-07-13 19:09:44,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:09:44,462 INFO L482 AbstractCegarLoop]: Abstraction has 7811 states and 15922 transitions. [2021-07-13 19:09:44,462 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 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-07-13 19:09:44,462 INFO L276 IsEmpty]: Start isEmpty. Operand 7811 states and 15922 transitions. [2021-07-13 19:09:44,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-07-13 19:09:44,465 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:09:44,465 INFO L508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:09:44,680 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:09:44,681 INFO L430 AbstractCegarLoop]: === Iteration 5 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:09:44,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:09:44,681 INFO L82 PathProgramCache]: Analyzing trace with hash 259410582, now seen corresponding path program 1 times [2021-07-13 19:09:44,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:09:44,681 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837059407] [2021-07-13 19:09:44,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:09:44,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:09:44,754 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-07-13 19:09:44,754 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:09:44,754 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837059407] [2021-07-13 19:09:44,754 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837059407] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:09:44,754 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955665924] [2021-07-13 19:09:44,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-07-13 19:09:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:09:44,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjunts are in the unsatisfiable core [2021-07-13 19:09:44,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-13 19:09:44,904 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-07-13 19:09:44,905 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955665924] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:09:44,905 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-13 19:09:44,905 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-07-13 19:09:44,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832139896] [2021-07-13 19:09:44,905 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-13 19:09:44,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:09:44,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-13 19:09:44,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-07-13 19:09:44,906 INFO L87 Difference]: Start difference. First operand 7811 states and 15922 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 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-07-13 19:09:45,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:09:45,001 INFO L93 Difference]: Finished difference Result 7819 states and 15930 transitions. [2021-07-13 19:09:45,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-13 19:09:45,001 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 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 66 [2021-07-13 19:09:45,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:09:45,018 INFO L225 Difference]: With dead ends: 7819 [2021-07-13 19:09:45,018 INFO L226 Difference]: Without dead ends: 7819 [2021-07-13 19:09:45,018 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 46.6ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-07-13 19:09:45,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7819 states. [2021-07-13 19:09:45,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7819 to 7816. [2021-07-13 19:09:45,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7816 states, 7811 states have (on average 2.039047497119447) internal successors, (15927), 7815 states have internal predecessors, (15927), 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-07-13 19:09:45,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7816 states to 7816 states and 15927 transitions. [2021-07-13 19:09:45,185 INFO L78 Accepts]: Start accepts. Automaton has 7816 states and 15927 transitions. Word has length 66 [2021-07-13 19:09:45,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:09:45,186 INFO L482 AbstractCegarLoop]: Abstraction has 7816 states and 15927 transitions. [2021-07-13 19:09:45,186 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 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-07-13 19:09:45,186 INFO L276 IsEmpty]: Start isEmpty. Operand 7816 states and 15927 transitions. [2021-07-13 19:09:45,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-07-13 19:09:45,189 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:09:45,189 INFO L508 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] [2021-07-13 19:09:45,404 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:09:45,405 INFO L430 AbstractCegarLoop]: === Iteration 6 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:09:45,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:09:45,405 INFO L82 PathProgramCache]: Analyzing trace with hash -219589387, now seen corresponding path program 2 times [2021-07-13 19:09:45,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:09:45,406 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168477411] [2021-07-13 19:09:45,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:09:45,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:09:45,478 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-07-13 19:09:45,478 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:09:45,478 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168477411] [2021-07-13 19:09:45,479 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168477411] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:09:45,479 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064065377] [2021-07-13 19:09:45,479 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 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-07-13 19:09:45,565 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-07-13 19:09:45,565 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-13 19:09:45,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 8 conjunts are in the unsatisfiable core [2021-07-13 19:09:45,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-13 19:09:45,686 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-07-13 19:09:45,686 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064065377] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:09:45,687 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-13 19:09:45,687 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2021-07-13 19:09:45,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388810858] [2021-07-13 19:09:45,687 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-07-13 19:09:45,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:09:45,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-07-13 19:09:45,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-07-13 19:09:45,688 INFO L87 Difference]: Start difference. First operand 7816 states and 15927 transitions. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 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-07-13 19:09:45,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:09:45,775 INFO L93 Difference]: Finished difference Result 7824 states and 15935 transitions. [2021-07-13 19:09:45,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-13 19:09:45,776 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 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 71 [2021-07-13 19:09:45,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:09:45,792 INFO L225 Difference]: With dead ends: 7824 [2021-07-13 19:09:45,792 INFO L226 Difference]: Without dead ends: 7824 [2021-07-13 19:09:45,793 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 72.1ms TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2021-07-13 19:09:45,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7824 states. [2021-07-13 19:09:45,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7824 to 7821. [2021-07-13 19:09:45,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7821 states, 7816 states have (on average 2.0383828045035823) internal successors, (15932), 7820 states have internal predecessors, (15932), 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-07-13 19:09:45,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7821 states to 7821 states and 15932 transitions. [2021-07-13 19:09:45,972 INFO L78 Accepts]: Start accepts. Automaton has 7821 states and 15932 transitions. Word has length 71 [2021-07-13 19:09:45,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:09:45,972 INFO L482 AbstractCegarLoop]: Abstraction has 7821 states and 15932 transitions. [2021-07-13 19:09:45,972 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 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-07-13 19:09:45,972 INFO L276 IsEmpty]: Start isEmpty. Operand 7821 states and 15932 transitions. [2021-07-13 19:09:45,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-07-13 19:09:45,975 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:09:45,975 INFO L508 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] [2021-07-13 19:09:46,188 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:09:46,189 INFO L430 AbstractCegarLoop]: === Iteration 7 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:09:46,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:09:46,189 INFO L82 PathProgramCache]: Analyzing trace with hash -236392970, now seen corresponding path program 3 times [2021-07-13 19:09:46,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:09:46,190 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789178943] [2021-07-13 19:09:46,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:09:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:09:46,259 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-07-13 19:09:46,259 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:09:46,259 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789178943] [2021-07-13 19:09:46,259 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789178943] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:09:46,259 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872885417] [2021-07-13 19:09:46,259 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 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-07-13 19:09:46,336 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-07-13 19:09:46,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-13 19:09:46,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 15 conjunts are in the unsatisfiable core [2021-07-13 19:09:46,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-13 19:09:46,392 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-07-13 19:09:46,393 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:09:46,394 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:09:46,395 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:09:46,395 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-07-13 19:09:46,406 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-07-13 19:09:46,407 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:09:46,409 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:09:46,410 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:09:46,410 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-07-13 19:09:46,466 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-07-13 19:09:46,466 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-07-13 19:09:46,468 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:09:46,471 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:09:46,471 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:09:46,471 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-07-13 19:09:46,502 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-07-13 19:09:46,506 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-07-13 19:09:46,507 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-13 19:09:46,510 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:09:46,511 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:09:46,515 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:09:46,516 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:09:46,516 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-07-13 19:09:46,591 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-07-13 19:09:46,596 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-07-13 19:09:46,597 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-13 19:09:46,600 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:09:46,600 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:09:46,604 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:09:46,606 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:09:46,606 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-07-13 19:09:46,623 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-07-13 19:09:46,624 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:09:46,625 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:09:46,627 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-07-13 19:09:46,627 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-07-13 19:09:46,672 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-07-13 19:09:46,673 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872885417] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:09:46,673 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-13 19:09:46,673 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-07-13 19:09:46,673 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896651956] [2021-07-13 19:09:46,673 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-07-13 19:09:46,673 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:09:46,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-07-13 19:09:46,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2021-07-13 19:09:46,674 INFO L87 Difference]: Start difference. First operand 7821 states and 15932 transitions. Second operand has 20 states, 20 states have (on average 5.95) internal successors, (119), 20 states have internal predecessors, (119), 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-07-13 19:09:47,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:09:47,978 INFO L93 Difference]: Finished difference Result 15227 states and 30937 transitions. [2021-07-13 19:09:47,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-07-13 19:09:47,989 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.95) internal successors, (119), 20 states have internal predecessors, (119), 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 76 [2021-07-13 19:09:47,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:09:48,033 INFO L225 Difference]: With dead ends: 15227 [2021-07-13 19:09:48,033 INFO L226 Difference]: Without dead ends: 15227 [2021-07-13 19:09:48,034 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 638.7ms TimeCoverageRelationStatistics Valid=481, Invalid=2599, Unknown=0, NotChecked=0, Total=3080 [2021-07-13 19:09:48,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15227 states. [2021-07-13 19:09:48,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15227 to 7798. [2021-07-13 19:09:48,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7798 states, 7793 states have (on average 2.03913768766842) internal successors, (15891), 7797 states have internal predecessors, (15891), 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-07-13 19:09:48,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7798 states to 7798 states and 15891 transitions. [2021-07-13 19:09:48,249 INFO L78 Accepts]: Start accepts. Automaton has 7798 states and 15891 transitions. Word has length 76 [2021-07-13 19:09:48,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:09:48,249 INFO L482 AbstractCegarLoop]: Abstraction has 7798 states and 15891 transitions. [2021-07-13 19:09:48,249 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 5.95) internal successors, (119), 20 states have internal predecessors, (119), 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-07-13 19:09:48,249 INFO L276 IsEmpty]: Start isEmpty. Operand 7798 states and 15891 transitions. [2021-07-13 19:09:48,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-07-13 19:09:48,259 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:09:48,259 INFO L508 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-13 19:09:48,472 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-07-13 19:09:48,473 INFO L430 AbstractCegarLoop]: === Iteration 8 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:09:48,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:09:48,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1814809251, now seen corresponding path program 1 times [2021-07-13 19:09:48,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:09:48,473 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104603830] [2021-07-13 19:09:48,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:09:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:09:48,567 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-07-13 19:09:48,568 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:09:48,568 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104603830] [2021-07-13 19:09:48,568 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104603830] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:09:48,568 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169600276] [2021-07-13 19:09:48,568 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-07-13 19:09:48,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:09:48,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 2 conjunts are in the unsatisfiable core [2021-07-13 19:09:48,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-13 19:09:48,845 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-07-13 19:09:48,845 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169600276] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 19:09:48,845 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-07-13 19:09:48,846 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-07-13 19:09:48,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864924052] [2021-07-13 19:09:48,847 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-13 19:09:48,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:09:48,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-13 19:09:48,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-07-13 19:09:48,848 INFO L87 Difference]: Start difference. First operand 7798 states and 15891 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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-07-13 19:09:48,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:09:48,898 INFO L93 Difference]: Finished difference Result 10950 states and 22347 transitions. [2021-07-13 19:09:48,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-13 19:09:48,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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 89 [2021-07-13 19:09:48,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:09:48,935 INFO L225 Difference]: With dead ends: 10950 [2021-07-13 19:09:48,935 INFO L226 Difference]: Without dead ends: 10950 [2021-07-13 19:09:48,935 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 10.7ms TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-07-13 19:09:49,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10950 states. [2021-07-13 19:09:49,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10950 to 7872. [2021-07-13 19:09:49,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7872 states, 7867 states have (on average 2.0390237701792295) internal successors, (16041), 7871 states have internal predecessors, (16041), 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-07-13 19:09:49,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7872 states to 7872 states and 16041 transitions. [2021-07-13 19:09:49,222 INFO L78 Accepts]: Start accepts. Automaton has 7872 states and 16041 transitions. Word has length 89 [2021-07-13 19:09:49,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:09:49,223 INFO L482 AbstractCegarLoop]: Abstraction has 7872 states and 16041 transitions. [2021-07-13 19:09:49,223 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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-07-13 19:09:49,223 INFO L276 IsEmpty]: Start isEmpty. Operand 7872 states and 16041 transitions. [2021-07-13 19:09:49,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-07-13 19:09:49,227 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:09:49,227 INFO L508 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-13 19:09:49,448 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:09:49,449 INFO L430 AbstractCegarLoop]: === Iteration 9 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:09:49,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:09:49,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1681592716, now seen corresponding path program 1 times [2021-07-13 19:09:49,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:09:49,449 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272288804] [2021-07-13 19:09:49,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:09:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:09:49,489 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-07-13 19:09:49,489 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:09:49,489 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272288804] [2021-07-13 19:09:49,489 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272288804] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:09:49,489 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897390088] [2021-07-13 19:09:49,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-07-13 19:09:49,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:09:49,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 12 conjunts are in the unsatisfiable core [2021-07-13 19:09:49,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-13 19:09:49,812 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-07-13 19:09:49,813 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897390088] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:09:49,813 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-13 19:09:49,813 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13] total 16 [2021-07-13 19:09:49,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167460573] [2021-07-13 19:09:49,813 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-07-13 19:09:49,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:09:49,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-07-13 19:09:49,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2021-07-13 19:09:49,814 INFO L87 Difference]: Start difference. First operand 7872 states and 16041 transitions. Second operand has 16 states, 16 states have (on average 8.0625) internal successors, (129), 16 states have internal predecessors, (129), 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-07-13 19:09:49,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:09:49,988 INFO L93 Difference]: Finished difference Result 874 states and 1637 transitions. [2021-07-13 19:09:49,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-07-13 19:09:49,988 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 8.0625) internal successors, (129), 16 states have internal predecessors, (129), 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-07-13 19:09:49,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:09:49,989 INFO L225 Difference]: With dead ends: 874 [2021-07-13 19:09:49,989 INFO L226 Difference]: Without dead ends: 874 [2021-07-13 19:09:49,990 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 214.6ms TimeCoverageRelationStatistics Valid=195, Invalid=561, Unknown=0, NotChecked=0, Total=756 [2021-07-13 19:09:49,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2021-07-13 19:09:49,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 871. [2021-07-13 19:09:49,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 870 states have (on average 1.8781609195402298) internal successors, (1634), 870 states have internal predecessors, (1634), 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-07-13 19:09:50,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1634 transitions. [2021-07-13 19:09:50,000 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1634 transitions. Word has length 94 [2021-07-13 19:09:50,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:09:50,000 INFO L482 AbstractCegarLoop]: Abstraction has 871 states and 1634 transitions. [2021-07-13 19:09:50,000 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 8.0625) internal successors, (129), 16 states have internal predecessors, (129), 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-07-13 19:09:50,000 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1634 transitions. [2021-07-13 19:09:50,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-07-13 19:09:50,002 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:09:50,002 INFO L508 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:09:50,209 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:09:50,209 INFO L430 AbstractCegarLoop]: === Iteration 10 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:09:50,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:09:50,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1506381164, now seen corresponding path program 1 times [2021-07-13 19:09:50,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:09:50,210 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373132394] [2021-07-13 19:09:50,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:09:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:09:50,322 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-07-13 19:09:50,322 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:09:50,322 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373132394] [2021-07-13 19:09:50,322 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373132394] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:09:50,322 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850040232] [2021-07-13 19:09:50,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-07-13 19:09:50,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:09:50,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 14 conjunts are in the unsatisfiable core [2021-07-13 19:09:50,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-13 19:09:50,555 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-07-13 19:09:50,555 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850040232] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:09:50,555 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-13 19:09:50,555 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2021-07-13 19:09:50,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570992599] [2021-07-13 19:09:50,556 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-07-13 19:09:50,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:09:50,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-07-13 19:09:50,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-07-13 19:09:50,557 INFO L87 Difference]: Start difference. First operand 871 states and 1634 transitions. Second operand has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 17 states have internal predecessors, (109), 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-07-13 19:09:50,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:09:50,693 INFO L93 Difference]: Finished difference Result 879 states and 1642 transitions. [2021-07-13 19:09:50,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-07-13 19:09:50,694 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 17 states have internal predecessors, (109), 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 111 [2021-07-13 19:09:50,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:09:50,695 INFO L225 Difference]: With dead ends: 879 [2021-07-13 19:09:50,695 INFO L226 Difference]: Without dead ends: 879 [2021-07-13 19:09:50,695 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 169.2ms TimeCoverageRelationStatistics Valid=263, Invalid=549, Unknown=0, NotChecked=0, Total=812 [2021-07-13 19:09:50,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2021-07-13 19:09:50,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 876. [2021-07-13 19:09:50,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 875 states have (on average 1.8731428571428572) internal successors, (1639), 875 states have internal predecessors, (1639), 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-07-13 19:09:50,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1639 transitions. [2021-07-13 19:09:50,706 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1639 transitions. Word has length 111 [2021-07-13 19:09:50,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:09:50,706 INFO L482 AbstractCegarLoop]: Abstraction has 876 states and 1639 transitions. [2021-07-13 19:09:50,706 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 17 states have internal predecessors, (109), 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-07-13 19:09:50,706 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1639 transitions. [2021-07-13 19:09:50,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-07-13 19:09:50,708 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:09:50,708 INFO L508 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:09:50,920 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-07-13 19:09:50,921 INFO L430 AbstractCegarLoop]: === Iteration 11 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:09:50,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:09:50,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1064749419, now seen corresponding path program 2 times [2021-07-13 19:09:50,921 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:09:50,921 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018847040] [2021-07-13 19:09:50,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:09:50,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:09:51,061 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-07-13 19:09:51,061 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:09:51,062 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018847040] [2021-07-13 19:09:51,062 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018847040] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:09:51,062 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263829245] [2021-07-13 19:09:51,062 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 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-07-13 19:09:51,141 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-07-13 19:09:51,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-13 19:09:51,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 16 conjunts are in the unsatisfiable core [2021-07-13 19:09:51,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-13 19:09:51,269 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-07-13 19:09:51,269 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263829245] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:09:51,269 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-13 19:09:51,269 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2021-07-13 19:09:51,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153314541] [2021-07-13 19:09:51,270 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-07-13 19:09:51,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:09:51,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-07-13 19:09:51,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2021-07-13 19:09:51,270 INFO L87 Difference]: Start difference. First operand 876 states and 1639 transitions. Second operand has 19 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 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-07-13 19:09:51,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:09:51,424 INFO L93 Difference]: Finished difference Result 884 states and 1647 transitions. [2021-07-13 19:09:51,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-07-13 19:09:51,424 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 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 116 [2021-07-13 19:09:51,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:09:51,426 INFO L225 Difference]: With dead ends: 884 [2021-07-13 19:09:51,426 INFO L226 Difference]: Without dead ends: 884 [2021-07-13 19:09:51,426 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 199.3ms TimeCoverageRelationStatistics Valid=340, Invalid=716, Unknown=0, NotChecked=0, Total=1056 [2021-07-13 19:09:51,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2021-07-13 19:09:51,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 881. [2021-07-13 19:09:51,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 880 states have (on average 1.8681818181818182) internal successors, (1644), 880 states have internal predecessors, (1644), 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-07-13 19:09:51,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1644 transitions. [2021-07-13 19:09:51,451 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1644 transitions. Word has length 116 [2021-07-13 19:09:51,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:09:51,451 INFO L482 AbstractCegarLoop]: Abstraction has 881 states and 1644 transitions. [2021-07-13 19:09:51,451 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 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-07-13 19:09:51,451 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1644 transitions. [2021-07-13 19:09:51,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-07-13 19:09:51,452 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:09:51,452 INFO L508 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:09:51,664 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:09:51,665 INFO L430 AbstractCegarLoop]: === Iteration 12 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:09:51,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:09:51,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1056584908, now seen corresponding path program 3 times [2021-07-13 19:09:51,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:09:51,665 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861114175] [2021-07-13 19:09:51,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:09:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:09:51,792 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-07-13 19:09:51,792 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:09:51,792 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861114175] [2021-07-13 19:09:51,792 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861114175] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:09:51,792 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447552892] [2021-07-13 19:09:51,793 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 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-07-13 19:09:51,863 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-07-13 19:09:51,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-13 19:09:51,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 28 conjunts are in the unsatisfiable core [2021-07-13 19:09:51,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-13 19:09:51,884 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-07-13 19:09:51,885 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:09:51,886 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:09:51,887 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:09:51,887 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-07-13 19:09:51,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 7 treesize of output 6 [2021-07-13 19:09:51,900 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:09:51,903 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:09:51,904 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:09:51,904 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-07-13 19:09:51,982 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-07-13 19:09:51,983 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-07-13 19:09:51,984 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:09:51,987 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:09:51,988 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:09:51,989 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-07-13 19:09:52,022 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-07-13 19:09:52,026 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-07-13 19:09:52,027 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-13 19:09:52,030 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:09:52,030 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:09:52,034 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:09:52,036 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:09:52,036 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-07-13 19:09:52,154 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2021-07-13 19:09:52,155 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:09:52,159 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:09:52,159 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:09:52,159 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:18 [2021-07-13 19:09:52,235 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 32 treesize of output 25 [2021-07-13 19:09:52,236 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:09:52,238 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:09:52,239 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-07-13 19:09:52,239 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:12 [2021-07-13 19:09:52,313 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-07-13 19:09:52,314 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:09:52,315 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:09:52,315 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-07-13 19:09:52,316 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-07-13 19:09:52,375 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2021-07-13 19:09:52,376 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447552892] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:09:52,376 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-13 19:09:52,376 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 35 [2021-07-13 19:09:52,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622719588] [2021-07-13 19:09:52,376 INFO L462 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-07-13 19:09:52,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:09:52,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-07-13 19:09:52,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1044, Unknown=0, NotChecked=0, Total=1190 [2021-07-13 19:09:52,377 INFO L87 Difference]: Start difference. First operand 881 states and 1644 transitions. Second operand has 35 states, 35 states have (on average 5.285714285714286) internal successors, (185), 35 states have internal predecessors, (185), 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-07-13 19:09:53,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:09:53,998 INFO L93 Difference]: Finished difference Result 1884 states and 3499 transitions. [2021-07-13 19:09:53,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-07-13 19:09:53,998 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 5.285714285714286) internal successors, (185), 35 states have internal predecessors, (185), 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 121 [2021-07-13 19:09:53,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:09:54,002 INFO L225 Difference]: With dead ends: 1884 [2021-07-13 19:09:54,002 INFO L226 Difference]: Without dead ends: 1590 [2021-07-13 19:09:54,004 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2426 ImplicationChecksByTransitivity, 1433.2ms TimeCoverageRelationStatistics Valid=1233, Invalid=7887, Unknown=0, NotChecked=0, Total=9120 [2021-07-13 19:09:54,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2021-07-13 19:09:54,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 885. [2021-07-13 19:09:54,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 884 states have (on average 1.8484162895927603) internal successors, (1634), 884 states have internal predecessors, (1634), 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-07-13 19:09:54,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1634 transitions. [2021-07-13 19:09:54,019 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1634 transitions. Word has length 121 [2021-07-13 19:09:54,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:09:54,019 INFO L482 AbstractCegarLoop]: Abstraction has 885 states and 1634 transitions. [2021-07-13 19:09:54,019 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 35 states, 35 states have (on average 5.285714285714286) internal successors, (185), 35 states have internal predecessors, (185), 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-07-13 19:09:54,019 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1634 transitions. [2021-07-13 19:09:54,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-07-13 19:09:54,020 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:09:54,021 INFO L508 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 2, 2, 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, 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-07-13 19:09:54,236 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:09:54,237 INFO L430 AbstractCegarLoop]: === Iteration 13 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:09:54,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:09:54,237 INFO L82 PathProgramCache]: Analyzing trace with hash -697132275, now seen corresponding path program 1 times [2021-07-13 19:09:54,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:09:54,238 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254078253] [2021-07-13 19:09:54,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:09:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:09:54,411 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-07-13 19:09:54,411 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:09:54,411 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254078253] [2021-07-13 19:09:54,411 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254078253] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:09:54,411 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896312103] [2021-07-13 19:09:54,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-07-13 19:09:54,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:09:54,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 20 conjunts are in the unsatisfiable core [2021-07-13 19:09:54,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-13 19:09:54,635 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-07-13 19:09:54,635 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896312103] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:09:54,635 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-13 19:09:54,635 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2021-07-13 19:09:54,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803395390] [2021-07-13 19:09:54,636 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-07-13 19:09:54,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:09:54,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-07-13 19:09:54,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2021-07-13 19:09:54,637 INFO L87 Difference]: Start difference. First operand 885 states and 1634 transitions. Second operand has 23 states, 23 states have (on average 5.608695652173913) internal successors, (129), 23 states have internal predecessors, (129), 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-07-13 19:09:54,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:09:54,873 INFO L93 Difference]: Finished difference Result 890 states and 1639 transitions. [2021-07-13 19:09:54,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-07-13 19:09:54,873 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.608695652173913) internal successors, (129), 23 states have internal predecessors, (129), 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-07-13 19:09:54,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:09:54,874 INFO L225 Difference]: With dead ends: 890 [2021-07-13 19:09:54,874 INFO L226 Difference]: Without dead ends: 890 [2021-07-13 19:09:54,875 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 304.5ms TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2021-07-13 19:09:54,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2021-07-13 19:09:54,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 890. [2021-07-13 19:09:54,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 889 states have (on average 1.843644544431946) internal successors, (1639), 889 states have internal predecessors, (1639), 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-07-13 19:09:54,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1639 transitions. [2021-07-13 19:09:54,885 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1639 transitions. Word has length 135 [2021-07-13 19:09:54,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:09:54,885 INFO L482 AbstractCegarLoop]: Abstraction has 890 states and 1639 transitions. [2021-07-13 19:09:54,885 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 5.608695652173913) internal successors, (129), 23 states have internal predecessors, (129), 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-07-13 19:09:54,885 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1639 transitions. [2021-07-13 19:09:54,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-07-13 19:09:54,887 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:09:54,887 INFO L508 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 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, 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-07-13 19:09:55,100 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-07-13 19:09:55,101 INFO L430 AbstractCegarLoop]: === Iteration 14 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:09:55,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:09:55,101 INFO L82 PathProgramCache]: Analyzing trace with hash 434744334, now seen corresponding path program 2 times [2021-07-13 19:09:55,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:09:55,101 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955423982] [2021-07-13 19:09:55,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:09:55,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:09:55,476 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-07-13 19:09:55,476 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:09:55,476 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955423982] [2021-07-13 19:09:55,476 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955423982] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:09:55,476 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262807157] [2021-07-13 19:09:55,476 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 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-07-13 19:09:55,580 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-07-13 19:09:55,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-13 19:09:55,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 27 conjunts are in the unsatisfiable core [2021-07-13 19:09:55,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-13 19:09:55,600 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-07-13 19:09:55,601 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:09:55,602 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:09:55,602 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:09:55,602 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-07-13 19:09:55,607 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-07-13 19:09:55,608 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:09:55,610 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:09:55,611 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:09:55,611 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-07-13 19:09:55,692 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-07-13 19:09:55,692 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-07-13 19:09:55,693 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:09:55,696 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:09:55,696 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:09:55,696 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-07-13 19:09:55,709 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-07-13 19:09:55,720 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-07-13 19:09:55,720 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-13 19:09:55,723 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:09:55,723 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:09:55,727 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:09:55,728 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:09:55,728 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-07-13 19:09:55,811 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2021-07-13 19:09:55,812 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:09:55,817 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:09:55,818 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-07-13 19:09:55,818 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2021-07-13 19:09:56,750 WARN L205 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2021-07-13 19:09:56,773 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 27 treesize of output 27 [2021-07-13 19:09:56,777 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-07-13 19:09:56,778 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-13 19:09:56,782 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:09:56,783 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:09:56,790 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:09:56,791 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-07-13 19:09:56,791 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:41, output treesize:22 [2021-07-13 19:09:57,999 WARN L205 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2021-07-13 19:09:58,050 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 25 treesize of output 20 [2021-07-13 19:09:58,051 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:09:58,054 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:09:58,056 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-07-13 19:09:58,056 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:19 [2021-07-13 19:09:58,536 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (t_funThread1of1ForFork0_cache_entry_addref_~entry.offset Int)) (and (<= t_funThread1of1ForFork0_cache_entry_addref_~entry.offset (+ |c_~#cache~0.offset| (* 28 c_t_funThread1of1ForFork0_~i~0))) (= (select |c_#memory_int| |c_~#cache~0.base|) (store ((as const (Array Int Int)) 0) t_funThread1of1ForFork0_cache_entry_addref_~entry.offset (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1)))))) is different from true [2021-07-13 19:09:59,209 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int)) (and (<= aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 |c_t_funThread1of1ForFork0_#t~post43|) (< aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) (<= 0 aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102) (= (select |c_#memory_int| |c_~#cache~0.base|) (store ((as const (Array Int Int)) 0) (+ (* aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 (- 1)) (* aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) |c_~#cache~0.offset|) (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1)))))) is different from true [2021-07-13 19:09:59,821 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int)) (and (< aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) (<= 0 aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102) (= (select |c_#memory_int| |c_~#cache~0.base|) (store ((as const (Array Int Int)) 0) (+ (* aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 (- 1)) (* aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) |c_~#cache~0.offset|) (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1)))) (<= (+ aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 1) c_t_funThread1of1ForFork0_~i~0))) is different from true [2021-07-13 19:10:00,310 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (|aux_div_~#cache~0.offset_103| Int) (aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (|aux_mod_~#cache~0.offset_103| Int)) (and (< aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) (< |aux_mod_~#cache~0.offset_103| 28) (<= 0 |aux_mod_~#cache~0.offset_103|) (<= 0 aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102) (= (store ((as const (Array Int Int)) 0) (+ (* aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 (- 1)) (* |aux_div_~#cache~0.offset_103| (- 28)) (* aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| (* |aux_mod_~#cache~0.offset_103| (- 1))) (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1))) (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base|)) (<= (+ aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 1) |aux_div_~#cache~0.offset_103|))) is different from true [2021-07-13 19:10:00,842 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (|aux_div_~#cache~0.offset_103| Int) (aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (|t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| Int) (|aux_mod_~#cache~0.offset_103| Int)) (and (= (select |c_#memory_int| c_t_funThread1of1ForFork0_cache_entry_addref_~entry.base) (store ((as const (Array Int Int)) 0) (+ (* aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 (- 1)) (* |aux_div_~#cache~0.offset_103| (- 28)) (* aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| (* |aux_mod_~#cache~0.offset_103| (- 1))) (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1)))) (< aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) (<= |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| c_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset) (< |aux_mod_~#cache~0.offset_103| 28) (<= 0 |aux_mod_~#cache~0.offset_103|) (<= 0 aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102) (<= (+ aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 1) |aux_div_~#cache~0.offset_103|))) is different from true [2021-07-13 19:10:01,015 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 32 treesize of output 28 [2021-07-13 19:10:01,016 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:10:01,026 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:10:01,036 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2021-07-13 19:10:01,036 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:52, output treesize:45 [2021-07-13 19:10:01,107 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 8 not checked. [2021-07-13 19:10:01,107 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262807157] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:10:01,107 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-13 19:10:01,107 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 29 [2021-07-13 19:10:01,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656104672] [2021-07-13 19:10:01,108 INFO L462 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-07-13 19:10:01,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:10:01,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-07-13 19:10:01,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=462, Unknown=10, NotChecked=240, Total=812 [2021-07-13 19:10:01,108 INFO L87 Difference]: Start difference. First operand 890 states and 1639 transitions. Second operand has 29 states, 29 states have (on average 5.310344827586207) internal successors, (154), 29 states have internal predecessors, (154), 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-07-13 19:10:02,032 WARN L205 SmtUtils]: Spent 634.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 28 [2021-07-13 19:10:04,898 WARN L205 SmtUtils]: Spent 415.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2021-07-13 19:10:31,404 WARN L205 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2021-07-13 19:10:44,590 WARN L205 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 51 DAG size of output: 36 [2021-07-13 19:10:57,076 WARN L205 SmtUtils]: Spent 724.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 29 [2021-07-13 19:11:04,899 WARN L205 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2021-07-13 19:11:22,532 WARN L205 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-07-13 19:12:10,119 WARN L205 SmtUtils]: Spent 858.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 33 [2021-07-13 19:12:25,367 WARN L205 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2021-07-13 19:12:50,037 WARN L205 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-07-13 19:12:50,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:12:50,274 INFO L93 Difference]: Finished difference Result 3426 states and 6532 transitions. [2021-07-13 19:12:50,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-07-13 19:12:50,275 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 5.310344827586207) internal successors, (154), 29 states have internal predecessors, (154), 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 140 [2021-07-13 19:12:50,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:12:50,279 INFO L225 Difference]: With dead ends: 3426 [2021-07-13 19:12:50,279 INFO L226 Difference]: Without dead ends: 3426 [2021-07-13 19:12:50,280 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 131 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1484 ImplicationChecksByTransitivity, 132146.7ms TimeCoverageRelationStatistics Valid=945, Invalid=3926, Unknown=119, NotChecked=710, Total=5700 [2021-07-13 19:12:50,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3426 states. [2021-07-13 19:12:50,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3426 to 1348. [2021-07-13 19:12:50,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 1347 states have (on average 1.8708240534521159) internal successors, (2520), 1347 states have internal predecessors, (2520), 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-07-13 19:12:50,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 2520 transitions. [2021-07-13 19:12:50,307 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 2520 transitions. Word has length 140 [2021-07-13 19:12:50,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:12:50,307 INFO L482 AbstractCegarLoop]: Abstraction has 1348 states and 2520 transitions. [2021-07-13 19:12:50,307 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 5.310344827586207) internal successors, (154), 29 states have internal predecessors, (154), 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-07-13 19:12:50,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 2520 transitions. [2021-07-13 19:12:50,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-07-13 19:12:50,309 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:12:50,309 INFO L508 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 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, 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-07-13 19:12:50,509 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-07-13 19:12:50,510 INFO L430 AbstractCegarLoop]: === Iteration 15 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:12:50,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:12:50,510 INFO L82 PathProgramCache]: Analyzing trace with hash 37532416, now seen corresponding path program 3 times [2021-07-13 19:12:50,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:12:50,510 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798751691] [2021-07-13 19:12:50,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:12:50,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:12:50,903 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-07-13 19:12:50,904 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:12:50,904 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798751691] [2021-07-13 19:12:50,904 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798751691] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:12:50,904 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495956723] [2021-07-13 19:12:50,904 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 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-07-13 19:12:50,992 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-07-13 19:12:50,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-13 19:12:50,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 35 conjunts are in the unsatisfiable core [2021-07-13 19:12:50,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-13 19:12:51,020 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-07-13 19:12:51,020 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:12:51,023 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:12:51,024 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:12:51,024 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-07-13 19:12:51,047 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-07-13 19:12:51,048 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:12:51,052 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:12:51,053 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:12:51,053 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2021-07-13 19:12:51,158 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-07-13 19:12:51,158 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-07-13 19:12:51,159 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:12:51,163 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:12:51,164 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:12:51,164 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2021-07-13 19:12:51,191 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-07-13 19:12:51,194 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-07-13 19:12:51,195 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-13 19:12:51,198 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:12:51,199 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:12:51,204 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:12:51,205 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:12:51,205 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:14 [2021-07-13 19:12:51,315 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2021-07-13 19:12:51,316 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:12:51,324 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:12:51,326 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-07-13 19:12:51,326 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2021-07-13 19:12:51,962 WARN L205 SmtUtils]: Spent 327.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2021-07-13 19:12:52,012 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 33 treesize of output 28 [2021-07-13 19:12:52,014 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:12:52,019 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:12:52,025 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-07-13 19:12:52,025 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:26 [2021-07-13 19:12:52,692 WARN L205 SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2021-07-13 19:12:53,076 WARN L205 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2021-07-13 19:12:53,441 WARN L205 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2021-07-13 19:12:53,454 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 27 treesize of output 27 [2021-07-13 19:12:53,458 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-07-13 19:12:53,459 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-13 19:12:53,462 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:12:53,463 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:12:53,469 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:12:53,471 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-07-13 19:12:53,471 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:37, output treesize:18 [2021-07-13 19:12:53,826 WARN L205 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2021-07-13 19:12:54,203 WARN L205 SmtUtils]: Spent 338.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2021-07-13 19:12:54,579 WARN L205 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2021-07-13 19:12:54,664 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 23 treesize of output 19 [2021-07-13 19:12:54,665 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:12:54,685 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:12:54,690 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-07-13 19:12:54,690 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:25 [2021-07-13 19:12:54,772 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-07-13 19:12:54,773 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495956723] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:12:54,773 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-13 19:12:54,773 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2021-07-13 19:12:54,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273093047] [2021-07-13 19:12:54,773 INFO L462 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-07-13 19:12:54,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:12:54,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-07-13 19:12:54,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=911, Unknown=2, NotChecked=0, Total=1056 [2021-07-13 19:12:54,774 INFO L87 Difference]: Start difference. First operand 1348 states and 2520 transitions. Second operand has 33 states, 33 states have (on average 5.333333333333333) internal successors, (176), 33 states have internal predecessors, (176), 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-07-13 19:13:03,481 WARN L205 SmtUtils]: Spent 681.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2021-07-13 19:13:04,627 WARN L205 SmtUtils]: Spent 716.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2021-07-13 19:13:05,345 WARN L205 SmtUtils]: Spent 701.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2021-07-13 19:13:06,953 WARN L205 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2021-07-13 19:13:07,789 WARN L205 SmtUtils]: Spent 783.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2021-07-13 19:13:08,659 WARN L205 SmtUtils]: Spent 829.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2021-07-13 19:13:09,458 WARN L205 SmtUtils]: Spent 716.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2021-07-13 19:13:10,953 WARN L205 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2021-07-13 19:13:12,255 WARN L205 SmtUtils]: Spent 1.24 s on a formula simplification that was a NOOP. DAG size: 39 [2021-07-13 19:13:13,815 WARN L205 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2021-07-13 19:13:16,634 WARN L205 SmtUtils]: Spent 1.31 s on a formula simplification that was a NOOP. DAG size: 41 [2021-07-13 19:13:18,172 WARN L205 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2021-07-13 19:13:20,054 WARN L205 SmtUtils]: Spent 1.29 s on a formula simplification that was a NOOP. DAG size: 43 [2021-07-13 19:13:21,389 WARN L205 SmtUtils]: Spent 1.26 s on a formula simplification that was a NOOP. DAG size: 45 [2021-07-13 19:13:22,829 WARN L205 SmtUtils]: Spent 1.39 s on a formula simplification that was a NOOP. DAG size: 43 [2021-07-13 19:13:23,787 WARN L205 SmtUtils]: Spent 353.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2021-07-13 19:13:24,712 WARN L205 SmtUtils]: Spent 343.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2021-07-13 19:13:26,056 WARN L205 SmtUtils]: Spent 1.31 s on a formula simplification that was a NOOP. DAG size: 45 [2021-07-13 19:13:26,438 WARN L205 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2021-07-13 19:13:27,833 WARN L205 SmtUtils]: Spent 343.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2021-07-13 19:13:28,629 WARN L205 SmtUtils]: Spent 708.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2021-07-13 19:13:30,483 WARN L205 SmtUtils]: Spent 705.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2021-07-13 19:13:31,727 WARN L205 SmtUtils]: Spent 1.21 s on a formula simplification that was a NOOP. DAG size: 42 [2021-07-13 19:13:33,098 WARN L205 SmtUtils]: Spent 1.27 s on a formula simplification that was a NOOP. DAG size: 44 [2021-07-13 19:13:34,368 WARN L205 SmtUtils]: Spent 1.24 s on a formula simplification that was a NOOP. DAG size: 46 [2021-07-13 19:13:34,729 WARN L205 SmtUtils]: Spent 329.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2021-07-13 19:13:34,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:13:34,741 INFO L93 Difference]: Finished difference Result 3218 states and 6033 transitions. [2021-07-13 19:13:34,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-07-13 19:13:34,741 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 5.333333333333333) internal successors, (176), 33 states have internal predecessors, (176), 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 140 [2021-07-13 19:13:34,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:13:34,755 INFO L225 Difference]: With dead ends: 3218 [2021-07-13 19:13:34,755 INFO L226 Difference]: Without dead ends: 3218 [2021-07-13 19:13:34,756 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 126 SyntacticMatches, 3 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1766 ImplicationChecksByTransitivity, 30603.9ms TimeCoverageRelationStatistics Valid=1142, Invalid=4860, Unknown=4, NotChecked=0, Total=6006 [2021-07-13 19:13:34,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3218 states. [2021-07-13 19:13:34,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3218 to 1614. [2021-07-13 19:13:34,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1614 states, 1613 states have (on average 1.8691878487290763) internal successors, (3015), 1613 states have internal predecessors, (3015), 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-07-13 19:13:34,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 3015 transitions. [2021-07-13 19:13:34,779 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 3015 transitions. Word has length 140 [2021-07-13 19:13:34,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:13:34,779 INFO L482 AbstractCegarLoop]: Abstraction has 1614 states and 3015 transitions. [2021-07-13 19:13:34,779 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 33 states, 33 states have (on average 5.333333333333333) internal successors, (176), 33 states have internal predecessors, (176), 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-07-13 19:13:34,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 3015 transitions. [2021-07-13 19:13:34,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-07-13 19:13:34,782 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:13:34,782 INFO L508 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 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, 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-07-13 19:13:35,000 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-07-13 19:13:35,001 INFO L430 AbstractCegarLoop]: === Iteration 16 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 19:13:35,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:13:35,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1937316018, now seen corresponding path program 4 times [2021-07-13 19:13:35,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:13:35,004 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333387031] [2021-07-13 19:13:35,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:13:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:13:35,388 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-07-13 19:13:35,388 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:13:35,388 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333387031] [2021-07-13 19:13:35,388 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333387031] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:13:35,388 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602921655] [2021-07-13 19:13:35,388 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 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-07-13 19:13:35,488 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-07-13 19:13:35,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-13 19:13:35,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 27 conjunts are in the unsatisfiable core [2021-07-13 19:13:35,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-13 19:13:35,519 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-07-13 19:13:35,520 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:13:35,521 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:13:35,522 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:13:35,522 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-07-13 19:13:35,539 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-07-13 19:13:35,540 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:13:35,543 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:13:35,544 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:13:35,544 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-07-13 19:13:35,626 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-07-13 19:13:35,627 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-07-13 19:13:35,628 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:13:35,631 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:13:35,632 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:13:35,632 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-07-13 19:13:35,643 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-07-13 19:13:35,646 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-07-13 19:13:35,647 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-13 19:13:35,650 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:13:35,651 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:13:35,655 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:13:35,656 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:13:35,656 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-07-13 19:13:35,744 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2021-07-13 19:13:35,745 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:13:35,751 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:13:35,752 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-07-13 19:13:35,752 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2021-07-13 19:13:36,737 WARN L205 SmtUtils]: Spent 341.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2021-07-13 19:13:36,779 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 25 treesize of output 20 [2021-07-13 19:13:36,780 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:13:36,786 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:13:36,788 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-07-13 19:13:36,788 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:23 [2021-07-13 19:13:40,361 WARN L205 SmtUtils]: Spent 751.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2021-07-13 19:13:46,755 WARN L205 SmtUtils]: Spent 636.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2021-07-13 19:13:56,410 WARN L205 SmtUtils]: Spent 639.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2021-07-13 19:13:57,826 WARN L205 SmtUtils]: Spent 459.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2021-07-13 19:14:00,922 WARN L205 SmtUtils]: Spent 634.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2021-07-13 19:14:00,973 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 40 treesize of output 40 [2021-07-13 19:14:00,978 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-07-13 19:14:00,978 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-13 19:14:00,983 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:14:00,983 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-13 19:14:00,997 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:14:01,005 INFO L550 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2021-07-13 19:14:01,005 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:64, output treesize:45 [2021-07-13 19:14:01,576 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (|aux_div_~#cache~0.offset_103| Int) (aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (|t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| Int) (|aux_mod_~#cache~0.offset_103| Int)) (and (= (select |c_#memory_int| c_t_funThread1of1ForFork0_cache_entry_addref_~entry.base) (store ((as const (Array Int Int)) 0) (+ (* aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 (- 1)) (* |aux_div_~#cache~0.offset_103| (- 28)) (* aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| (* |aux_mod_~#cache~0.offset_103| (- 1))) (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1)))) (< aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) (<= |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| c_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset) (< |aux_mod_~#cache~0.offset_103| 28) (<= 0 |aux_mod_~#cache~0.offset_103|) (<= 0 aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102) (<= (+ aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 1) |aux_div_~#cache~0.offset_103|))) is different from true [2021-07-13 19:14:01,736 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 32 treesize of output 28 [2021-07-13 19:14:01,737 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-13 19:14:01,747 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-13 19:14:01,756 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2021-07-13 19:14:01,756 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:52, output treesize:45 [2021-07-13 19:14:01,820 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 3 not checked. [2021-07-13 19:14:01,820 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602921655] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-13 19:14:01,820 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-13 19:14:01,820 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 29 [2021-07-13 19:14:01,820 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925412062] [2021-07-13 19:14:01,821 INFO L462 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-07-13 19:14:01,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:14:01,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-07-13 19:14:01,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=614, Unknown=31, NotChecked=52, Total=812 [2021-07-13 19:14:01,822 INFO L87 Difference]: Start difference. First operand 1614 states and 3015 transitions. Second operand has 29 states, 29 states have (on average 5.310344827586207) internal successors, (154), 29 states have internal predecessors, (154), 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-07-13 19:14:20,083 WARN L205 SmtUtils]: Spent 675.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2021-07-13 19:14:44,533 WARN L205 SmtUtils]: Spent 5.29 s on a formula simplification that was a NOOP. DAG size: 64 [2021-07-13 19:14:51,900 WARN L205 SmtUtils]: Spent 817.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2021-07-13 19:15:02,092 WARN L205 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2021-07-13 19:15:09,039 WARN L205 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2021-07-13 19:15:23,971 WARN L205 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2021-07-13 19:15:32,466 WARN L205 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2021-07-13 19:15:45,520 WARN L205 SmtUtils]: Spent 1.37 s on a formula simplification that was a NOOP. DAG size: 50 [2021-07-13 19:15:48,364 WARN L205 SmtUtils]: Spent 2.82 s on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2021-07-13 19:16:19,347 WARN L205 SmtUtils]: Spent 3.66 s on a formula simplification that was a NOOP. DAG size: 59 [2021-07-13 19:16:23,701 WARN L205 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2021-07-13 19:16:34,094 WARN L205 SmtUtils]: Spent 358.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2021-07-13 19:16:48,714 WARN L205 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2021-07-13 19:18:08,960 WARN L205 SmtUtils]: Spent 4.69 s on a formula simplification that was a NOOP. DAG size: 61 [2021-07-13 19:18:35,498 WARN L205 SmtUtils]: Spent 6.73 s on a formula simplification. DAG size of input: 94 DAG size of output: 84 [2021-07-13 19:18:45,449 WARN L205 SmtUtils]: Spent 4.19 s on a formula simplification that was a NOOP. DAG size: 63 [2021-07-13 19:19:16,030 WARN L205 SmtUtils]: Spent 3.03 s on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2021-07-13 19:19:49,295 WARN L205 SmtUtils]: Spent 4.20 s on a formula simplification. DAG size of input: 88 DAG size of output: 86 [2021-07-13 19:20:11,658 WARN L205 SmtUtils]: Spent 4.24 s on a formula simplification that was a NOOP. DAG size: 65 [2021-07-13 19:21:07,202 WARN L205 SmtUtils]: Spent 4.81 s on a formula simplification that was a NOOP. DAG size: 63 [2021-07-13 19:23:26,708 WARN L205 SmtUtils]: Spent 2.75 s on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2021-07-13 19:23:57,569 WARN L205 SmtUtils]: Spent 7.32 s on a formula simplification. DAG size of input: 96 DAG size of output: 86 Received shutdown request... [2021-07-13 19:24:21,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-07-13 19:24:22,124 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-13 19:24:22,124 WARN L547 AbstractCegarLoop]: Verification canceled [2021-07-13 19:24:22,124 INFO L301 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was TIMEOUT (1/2) [2021-07-13 19:24:22,126 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-07-13 19:24:22,126 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-13 19:24:22,126 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-13 19:24:22,126 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-13 19:24:22,126 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-13 19:24:22,126 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-13 19:24:22,126 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-13 19:24:22,126 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-13 19:24:22,127 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-07-13 19:24:22,128 INFO L110 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 194 places, 236 transitions, 480 flow [2021-07-13 19:24:22,129 WARN L547 AbstractCegarLoop]: Verification canceled [2021-07-13 19:24:22,129 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was TIMEOUT (2/2) [2021-07-13 19:24:22,129 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-07-13 19:24:22,130 WARN L196 ceAbstractionStarter]: Timeout [2021-07-13 19:24:22,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 07:24:22 BasicIcfg [2021-07-13 19:24:22,130 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-07-13 19:24:22,131 INFO L168 Benchmark]: Toolchain (without parser) took 882148.01 ms. Allocated memory was 185.6 MB in the beginning and 756.0 MB in the end (delta: 570.4 MB). Free memory was 148.2 MB in the beginning and 352.8 MB in the end (delta: -204.7 MB). Peak memory consumption was 366.7 MB. Max. memory is 8.0 GB. [2021-07-13 19:24:22,131 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 185.6 MB. Free memory is still 166.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-07-13 19:24:22,131 INFO L168 Benchmark]: CACSL2BoogieTranslator took 479.87 ms. Allocated memory is still 185.6 MB. Free memory was 148.0 MB in the beginning and 151.2 MB in the end (delta: -3.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 8.0 GB. [2021-07-13 19:24:22,131 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.46 ms. Allocated memory is still 185.6 MB. Free memory was 151.2 MB in the beginning and 148.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-07-13 19:24:22,131 INFO L168 Benchmark]: Boogie Preprocessor took 37.03 ms. Allocated memory is still 185.6 MB. Free memory was 148.5 MB in the beginning and 145.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-07-13 19:24:22,131 INFO L168 Benchmark]: RCFGBuilder took 436.68 ms. Allocated memory is still 185.6 MB. Free memory was 145.9 MB in the beginning and 102.9 MB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 8.0 GB. [2021-07-13 19:24:22,131 INFO L168 Benchmark]: TraceAbstraction took 881126.94 ms. Allocated memory was 185.6 MB in the beginning and 756.0 MB in the end (delta: 570.4 MB). Free memory was 102.4 MB in the beginning and 352.8 MB in the end (delta: -250.4 MB). Peak memory consumption was 321.1 MB. Max. memory is 8.0 GB. [2021-07-13 19:24:22,131 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.15 ms. Allocated memory is still 185.6 MB. Free memory is still 166.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 479.87 ms. Allocated memory is still 185.6 MB. Free memory was 148.0 MB in the beginning and 151.2 MB in the end (delta: -3.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 60.46 ms. Allocated memory is still 185.6 MB. Free memory was 151.2 MB in the beginning and 148.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 37.03 ms. Allocated memory is still 185.6 MB. Free memory was 148.5 MB in the beginning and 145.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 436.68 ms. Allocated memory is still 185.6 MB. Free memory was 145.9 MB in the beginning and 102.9 MB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 881126.94 ms. Allocated memory was 185.6 MB in the beginning and 756.0 MB in the end (delta: 570.4 MB). Free memory was 102.4 MB in the beginning and 352.8 MB in the end (delta: -250.4 MB). Peak memory consumption was 321.1 MB. Max. memory is 8.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 (1614states) and FLOYD_HOARE automaton (currently 43 states, 29 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 922]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing initial abstraction,while PetriNet2FiniteAutomaton was constructing automaton for Petri net that has has 194 places, 236 transitions, 480 flow. Already constructed 2 states. Currently 1 states in worklist.. - TimeoutResultAtElement [Line: 922]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing initial abstraction,while PetriNet2FiniteAutomaton was constructing automaton for Petri net that has has 194 places, 236 transitions, 480 flow. Already constructed 2 states. Currently 1 states in worklist.. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t_funThread1of1ForFork0 with 1 thread instances CFG has 3 procedures, 246 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 881017.8ms, OverallIterations: 16, TraceHistogramMax: 10, EmptinessCheckTime: 71.4ms, AutomataDifference: 834478.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 150.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3531 SDtfs, 12188 SDslu, 25201 SDs, 0 SdLazy, 5769 SolverSat, 616 SolverUnsat, 544 SolverUnknown, 0 SolverNotchecked, 475917.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1909 GetRequests, 1332 SyntacticMatches, 9 SemanticMatches, 567 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 8864 ImplicationChecksByTransitivity, 385414.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=7872occurred in iteration=8, InterpolantAutomatonStates: 373, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1715.9ms AutomataMinimizationTime, 15 MinimizatonAttempts, 22263 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 258.4ms SsaConstructionTime, 569.1ms SatisfiabilityAnalysisTime, 40013.3ms InterpolantComputationTime, 2910 NumberOfCodeBlocks, 2805 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 2880 ConstructedInterpolants, 99 QuantifiedInterpolants, 20391 SizeOfPredicates, 181 NumberOfNonLiveVariables, 2778 ConjunctsInSsa, 228 ConjunctsInUnsatCore, 30 InterpolantComputations, 4 PerfectInterpolantSequences, 1870/2996 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 errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 3 procedures, 246 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 2.6ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2.2ms, 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