/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/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7707f89-m [2022-11-16 01:47:01,944 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 01:47:01,946 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 01:47:01,970 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 01:47:01,971 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 01:47:01,973 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 01:47:01,975 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 01:47:01,977 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 01:47:01,978 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 01:47:01,981 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 01:47:01,982 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 01:47:01,983 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 01:47:01,983 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 01:47:01,985 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 01:47:01,986 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 01:47:01,986 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 01:47:01,987 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 01:47:01,988 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 01:47:01,989 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 01:47:01,994 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 01:47:01,995 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 01:47:01,996 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 01:47:01,997 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 01:47:01,997 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 01:47:02,003 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 01:47:02,003 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 01:47:02,003 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 01:47:02,004 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 01:47:02,004 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 01:47:02,005 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 01:47:02,005 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 01:47:02,006 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 01:47:02,007 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 01:47:02,007 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 01:47:02,008 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 01:47:02,008 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 01:47:02,009 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 01:47:02,009 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 01:47:02,009 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 01:47:02,009 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 01:47:02,010 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 01:47:02,011 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2022-11-16 01:47:02,035 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 01:47:02,035 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 01:47:02,035 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 01:47:02,035 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 01:47:02,036 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 01:47:02,036 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 01:47:02,036 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 01:47:02,036 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 01:47:02,036 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 01:47:02,036 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 01:47:02,036 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 01:47:02,036 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 01:47:02,037 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 01:47:02,037 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 01:47:02,037 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 01:47:02,037 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 01:47:02,037 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 01:47:02,037 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 01:47:02,037 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 01:47:02,037 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 01:47:02,037 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 01:47:02,037 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 01:47:02,037 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 01:47:02,037 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-16 01:47:02,037 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 01:47:02,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 01:47:02,038 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 01:47:02,038 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 01:47:02,038 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 01:47:02,038 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 01:47:02,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 01:47:02,038 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 01:47:02,038 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-16 01:47:02,038 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 01:47:02,038 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-16 01:47:02,038 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-16 01:47:02,038 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION [2022-11-16 01:47:02,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 01:47:02,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 01:47:02,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 01:47:02,250 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 01:47:02,250 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 01:47:02,251 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c [2022-11-16 01:47:02,294 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dd2de537/dbed484789dd4143aa8f238554706fb4/FLAGfcda6076a [2022-11-16 01:47:02,688 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 01:47:02,689 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c [2022-11-16 01:47:02,695 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dd2de537/dbed484789dd4143aa8f238554706fb4/FLAGfcda6076a [2022-11-16 01:47:02,708 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dd2de537/dbed484789dd4143aa8f238554706fb4 [2022-11-16 01:47:02,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 01:47:02,711 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-11-16 01:47:02,713 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 01:47:02,713 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 01:47:02,715 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 01:47:02,716 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:47:02" (1/1) ... [2022-11-16 01:47:02,717 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1005aa24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:47:02, skipping insertion in model container [2022-11-16 01:47:02,717 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:47:02" (1/1) ... [2022-11-16 01:47:02,721 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 01:47:02,733 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 01:47:02,894 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c[2553,2566] [2022-11-16 01:47:02,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 01:47:02,916 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 01:47:02,948 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c[2553,2566] [2022-11-16 01:47:02,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 01:47:02,961 INFO L208 MainTranslator]: Completed translation [2022-11-16 01:47:02,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:47:02 WrapperNode [2022-11-16 01:47:02,961 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 01:47:02,962 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 01:47:02,962 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 01:47:02,962 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 01:47:02,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:47:02" (1/1) ... [2022-11-16 01:47:02,980 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:47:02" (1/1) ... [2022-11-16 01:47:03,001 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 101 [2022-11-16 01:47:03,002 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 01:47:03,003 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 01:47:03,003 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 01:47:03,003 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 01:47:03,008 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:47:02" (1/1) ... [2022-11-16 01:47:03,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:47:02" (1/1) ... [2022-11-16 01:47:03,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:47:02" (1/1) ... [2022-11-16 01:47:03,021 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:47:02" (1/1) ... [2022-11-16 01:47:03,030 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:47:02" (1/1) ... [2022-11-16 01:47:03,033 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:47:02" (1/1) ... [2022-11-16 01:47:03,033 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:47:02" (1/1) ... [2022-11-16 01:47:03,034 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:47:02" (1/1) ... [2022-11-16 01:47:03,036 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 01:47:03,036 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 01:47:03,036 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 01:47:03,036 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 01:47:03,043 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:47:02" (1/1) ... [2022-11-16 01:47:03,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 01:47:03,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 01:47:03,065 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 01:47:03,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 01:47:03,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 01:47:03,117 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-16 01:47:03,117 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-16 01:47:03,118 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-16 01:47:03,118 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-16 01:47:03,118 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-16 01:47:03,118 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-16 01:47:03,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 01:47:03,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 01:47:03,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 01:47:03,118 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 01:47:03,118 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 01:47:03,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 01:47:03,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 01:47:03,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 01:47:03,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 01:47:03,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 01:47:03,120 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 01:47:03,209 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 01:47:03,210 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 01:47:03,401 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 01:47:03,440 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 01:47:03,441 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-16 01:47:03,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 01:47:03 BoogieIcfgContainer [2022-11-16 01:47:03,442 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 01:47:03,444 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 01:47:03,444 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 01:47:03,446 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 01:47:03,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 01:47:02" (1/3) ... [2022-11-16 01:47:03,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e00d5f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:47:03, skipping insertion in model container [2022-11-16 01:47:03,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:47:02" (2/3) ... [2022-11-16 01:47:03,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e00d5f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:47:03, skipping insertion in model container [2022-11-16 01:47:03,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 01:47:03" (3/3) ... [2022-11-16 01:47:03,448 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array.wvr.c [2022-11-16 01:47:03,453 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 01:47:03,459 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 01:47:03,459 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 01:47:03,459 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 01:47:03,518 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-16 01:47:03,558 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 01:47:03,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-16 01:47:03,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 01:47:03,591 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-16 01:47:03,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-16 01:47:03,644 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-16 01:47:03,674 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2022-11-16 01:47:03,678 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@10b4575e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 01:47:03,678 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 01:47:03,939 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 01:47:03,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 01:47:03,943 INFO L85 PathProgramCache]: Analyzing trace with hash -990075498, now seen corresponding path program 1 times [2022-11-16 01:47:03,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 01:47:03,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161220241] [2022-11-16 01:47:03,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:47:03,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 01:47:04,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:47:04,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 01:47:04,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 01:47:04,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161220241] [2022-11-16 01:47:04,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161220241] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 01:47:04,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 01:47:04,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 01:47:04,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658370652] [2022-11-16 01:47:04,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 01:47:04,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 01:47:04,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 01:47:04,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 01:47:04,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 01:47:04,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:04,208 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 01:47:04,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 54.5) internal successors, (109), 2 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) [2022-11-16 01:47:04,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:04,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:04,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 01:47:04,238 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 01:47:04,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 01:47:04,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1421486002, now seen corresponding path program 1 times [2022-11-16 01:47:04,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 01:47:04,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780989125] [2022-11-16 01:47:04,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:47:04,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 01:47:04,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:47:04,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 01:47:04,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 01:47:04,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780989125] [2022-11-16 01:47:04,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780989125] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 01:47:04,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 01:47:04,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 01:47:04,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941797314] [2022-11-16 01:47:04,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 01:47:04,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 01:47:04,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 01:47:04,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 01:47:04,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-16 01:47:04,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:04,642 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 01:47:04,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 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) [2022-11-16 01:47:04,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:04,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:04,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:04,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:47:04,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 01:47:04,861 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 01:47:04,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 01:47:04,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1997378296, now seen corresponding path program 1 times [2022-11-16 01:47:04,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 01:47:04,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702728458] [2022-11-16 01:47:04,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:47:04,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 01:47:04,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:47:05,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 01:47:05,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 01:47:05,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702728458] [2022-11-16 01:47:05,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702728458] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 01:47:05,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637726048] [2022-11-16 01:47:05,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:47:05,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 01:47:05,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 01:47:05,097 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 01:47:05,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 01:47:05,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:47:05,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 01:47:05,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 01:47:05,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 01:47:05,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 01:47:05,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 01:47:05,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637726048] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-16 01:47:05,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-16 01:47:05,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-11-16 01:47:05,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680881010] [2022-11-16 01:47:05,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 01:47:05,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 01:47:05,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 01:47:05,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 01:47:05,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-11-16 01:47:05,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:05,500 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 01:47:05,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 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) [2022-11-16 01:47:05,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:05,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:47:05,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:05,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:05,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:47:05,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:47:05,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-16 01:47:05,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-11-16 01:47:05,809 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 01:47:05,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 01:47:05,809 INFO L85 PathProgramCache]: Analyzing trace with hash -488176783, now seen corresponding path program 1 times [2022-11-16 01:47:05,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 01:47:05,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75278048] [2022-11-16 01:47:05,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:47:05,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 01:47:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:47:05,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 01:47:05,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 01:47:05,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75278048] [2022-11-16 01:47:05,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75278048] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 01:47:05,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224616273] [2022-11-16 01:47:05,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:47:05,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 01:47:05,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 01:47:05,993 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 01:47:05,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 01:47:06,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:47:06,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 01:47:06,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 01:47:06,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 01:47:06,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 01:47:06,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 01:47:06,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224616273] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-16 01:47:06,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-16 01:47:06,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-11-16 01:47:06,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808081918] [2022-11-16 01:47:06,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 01:47:06,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 01:47:06,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 01:47:06,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 01:47:06,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-11-16 01:47:06,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:06,365 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 01:47:06,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 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) [2022-11-16 01:47:06,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:06,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:47:06,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:47:06,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:06,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:06,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:47:06,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:47:06,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:47:06,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 01:47:06,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 01:47:06,688 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 01:47:06,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 01:47:06,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1789324920, now seen corresponding path program 1 times [2022-11-16 01:47:06,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 01:47:06,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628866918] [2022-11-16 01:47:06,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:47:06,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 01:47:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:47:07,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 01:47:07,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 01:47:07,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628866918] [2022-11-16 01:47:07,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628866918] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 01:47:07,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938616950] [2022-11-16 01:47:07,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:47:07,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 01:47:07,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 01:47:07,749 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 01:47:07,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 01:47:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:47:07,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-16 01:47:07,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 01:47:08,892 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 01:47:08,894 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 01:47:08,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 36 [2022-11-16 01:47:08,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 01:47:08,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 01:47:09,171 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 01:47:09,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 51 [2022-11-16 01:47:09,712 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 01:47:09,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938616950] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 01:47:09,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 01:47:09,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 24, 18] total 57 [2022-11-16 01:47:09,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796488747] [2022-11-16 01:47:09,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 01:47:09,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-11-16 01:47:09,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 01:47:09,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-11-16 01:47:09,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=2714, Unknown=0, NotChecked=0, Total=3192 [2022-11-16 01:47:09,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:09,718 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 01:47:09,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 5.473684210526316) internal successors, (312), 57 states have internal predecessors, (312), 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) [2022-11-16 01:47:09,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:09,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:47:09,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:47:09,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:47:09,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:11,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:11,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:47:11,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:47:11,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:47:11,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-16 01:47:11,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 01:47:11,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 01:47:11,965 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 01:47:11,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 01:47:11,965 INFO L85 PathProgramCache]: Analyzing trace with hash -250359855, now seen corresponding path program 2 times [2022-11-16 01:47:11,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 01:47:11,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894030587] [2022-11-16 01:47:11,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:47:11,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 01:47:11,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:47:12,258 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 01:47:12,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 01:47:12,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894030587] [2022-11-16 01:47:12,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894030587] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 01:47:12,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898838802] [2022-11-16 01:47:12,258 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 01:47:12,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 01:47:12,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 01:47:12,260 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 01:47:12,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 01:47:12,339 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 01:47:12,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 01:47:12,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-16 01:47:12,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 01:47:12,688 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 01:47:12,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 01:47:12,923 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 01:47:12,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898838802] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 01:47:12,923 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 01:47:12,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 30 [2022-11-16 01:47:12,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914908476] [2022-11-16 01:47:12,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 01:47:12,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-16 01:47:12,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 01:47:12,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-16 01:47:12,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=723, Unknown=0, NotChecked=0, Total=870 [2022-11-16 01:47:12,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:12,926 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 01:47:12,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.266666666666667) internal successors, (218), 30 states have internal predecessors, (218), 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) [2022-11-16 01:47:12,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:12,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:47:12,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:47:12,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:47:12,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-11-16 01:47:12,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:13,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:13,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:47:13,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:47:13,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 01:47:13,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-16 01:47:13,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-16 01:47:13,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 01:47:13,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 01:47:13,805 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 01:47:13,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 01:47:13,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1892771466, now seen corresponding path program 1 times [2022-11-16 01:47:13,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 01:47:13,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828869240] [2022-11-16 01:47:13,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:47:13,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 01:47:13,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:47:14,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 01:47:14,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 01:47:14,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828869240] [2022-11-16 01:47:14,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828869240] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 01:47:14,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653372352] [2022-11-16 01:47:14,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:47:14,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 01:47:14,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 01:47:14,016 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 01:47:14,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 01:47:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:47:14,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-16 01:47:14,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 01:47:14,297 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 01:47:14,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 01:47:14,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 01:47:14,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653372352] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 01:47:14,497 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 01:47:14,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2022-11-16 01:47:14,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146713126] [2022-11-16 01:47:14,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 01:47:14,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-16 01:47:14,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 01:47:14,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-16 01:47:14,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2022-11-16 01:47:14,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:14,499 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 01:47:14,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 7.518518518518518) internal successors, (203), 27 states have internal predecessors, (203), 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) [2022-11-16 01:47:14,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:14,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:47:14,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:47:14,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-16 01:47:14,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-11-16 01:47:14,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-16 01:47:14,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:15,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:15,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:47:15,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:47:15,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 01:47:15,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-16 01:47:15,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-16 01:47:15,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 01:47:15,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 01:47:15,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 01:47:15,338 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 01:47:15,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 01:47:15,338 INFO L85 PathProgramCache]: Analyzing trace with hash -165325407, now seen corresponding path program 3 times [2022-11-16 01:47:15,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 01:47:15,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648639021] [2022-11-16 01:47:15,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:47:15,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 01:47:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:47:15,482 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 01:47:15,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 01:47:15,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648639021] [2022-11-16 01:47:15,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648639021] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 01:47:15,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318858722] [2022-11-16 01:47:15,483 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 01:47:15,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 01:47:15,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 01:47:15,484 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 01:47:15,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 01:47:15,634 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-16 01:47:15,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 01:47:15,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 01:47:15,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 01:47:15,773 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 01:47:15,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 01:47:15,886 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 01:47:15,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318858722] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 01:47:15,886 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 01:47:15,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2022-11-16 01:47:15,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621331230] [2022-11-16 01:47:15,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 01:47:15,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-16 01:47:15,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 01:47:15,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-16 01:47:15,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2022-11-16 01:47:15,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:15,889 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 01:47:15,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 9.2) internal successors, (230), 25 states have internal predecessors, (230), 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) [2022-11-16 01:47:15,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:15,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:47:15,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:47:15,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-16 01:47:15,890 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2022-11-16 01:47:15,890 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-16 01:47:15,890 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-16 01:47:15,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:16,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:16,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:47:16,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:47:16,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 01:47:16,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-16 01:47:16,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-16 01:47:16,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 01:47:16,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 01:47:16,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-16 01:47:17,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 01:47:17,044 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 01:47:17,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 01:47:17,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1516468592, now seen corresponding path program 4 times [2022-11-16 01:47:17,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 01:47:17,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344540072] [2022-11-16 01:47:17,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:47:17,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 01:47:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:47:18,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 01:47:18,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 01:47:18,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344540072] [2022-11-16 01:47:18,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344540072] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 01:47:18,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17863207] [2022-11-16 01:47:18,150 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 01:47:18,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 01:47:18,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 01:47:18,151 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 01:47:18,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 01:47:18,251 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 01:47:18,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 01:47:18,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 01:47:18,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 01:47:19,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 01:47:19,179 INFO L350 Elim1Store]: Elim1 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 35 treesize of output 33 [2022-11-16 01:47:19,527 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 01:47:19,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 41 [2022-11-16 01:47:19,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 01:47:19,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 01:47:20,415 WARN L833 $PredicateComparison]: unable to prove that (and (or (= c_~max1~0 c_~max2~0) (forall ((~M~0 Int) (v_ArrVal_253 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< c_~max2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_253) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))))) (forall ((~M~0 Int) (v_ArrVal_253 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_253) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= c_~max1~0 .cse0) (not (< c_~max2~0 .cse0)))))) is different from false [2022-11-16 01:47:20,447 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 01:47:20,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 161 treesize of output 149 [2022-11-16 01:47:20,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 90 treesize of output 84 [2022-11-16 01:47:20,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 84 treesize of output 72 [2022-11-16 01:47:21,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 01:47:21,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17863207] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 01:47:21,722 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 01:47:21,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27, 27] total 67 [2022-11-16 01:47:21,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509789303] [2022-11-16 01:47:21,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 01:47:21,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-11-16 01:47:21,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 01:47:21,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-11-16 01:47:21,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=477, Invalid=3816, Unknown=1, NotChecked=128, Total=4422 [2022-11-16 01:47:21,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:21,725 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 01:47:21,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 4.492537313432836) internal successors, (301), 67 states have internal predecessors, (301), 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) [2022-11-16 01:47:21,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:21,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:47:21,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:47:21,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-16 01:47:21,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2022-11-16 01:47:21,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-16 01:47:21,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-16 01:47:21,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-16 01:47:21,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:23,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:23,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:47:23,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:47:23,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 01:47:23,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-16 01:47:23,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-16 01:47:23,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 01:47:23,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 01:47:23,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-16 01:47:23,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-16 01:47:24,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-16 01:47:24,070 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 01:47:24,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 01:47:24,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1420844820, now seen corresponding path program 5 times [2022-11-16 01:47:24,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 01:47:24,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598617478] [2022-11-16 01:47:24,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:47:24,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 01:47:24,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:47:25,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 01:47:25,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 01:47:25,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598617478] [2022-11-16 01:47:25,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598617478] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 01:47:25,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949157794] [2022-11-16 01:47:25,262 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 01:47:25,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 01:47:25,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 01:47:25,263 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 01:47:25,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 01:47:25,367 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 01:47:25,367 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 01:47:25,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-16 01:47:25,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 01:47:25,876 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 11 [2022-11-16 01:47:26,297 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 5 [2022-11-16 01:47:26,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 01:47:26,542 INFO L350 Elim1Store]: Elim1 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 35 treesize of output 33 [2022-11-16 01:47:26,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 01:47:26,674 INFO L350 Elim1Store]: Elim1 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 35 treesize of output 33 [2022-11-16 01:47:27,017 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 01:47:27,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 41 [2022-11-16 01:47:27,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 01:47:27,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 01:47:27,931 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_290 (Array Int Int)) (~M~0 Int) (v_ArrVal_289 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< c_~max2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))))) (= c_~max1~0 c_~max2~0)) (forall ((v_ArrVal_290 (Array Int Int)) (~M~0 Int) (v_ArrVal_289 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (not (< c_~max2~0 .cse0)) (= c_~max1~0 .cse0))))) is different from false [2022-11-16 01:47:30,326 WARN L833 $PredicateComparison]: unable to prove that (or (not (< c_thread1Thread1of1ForFork2_~i~0 c_~N~0)) (let ((.cse3 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))))) (let ((.cse1 (forall ((v_ArrVal_290 (Array Int Int)) (~M~0 Int) (v_ArrVal_289 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< c_~max2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))))) (.cse0 (< c_~max1~0 .cse3))) (and (or .cse0 (and (or .cse1 (= c_~max1~0 c_~max2~0)) (forall ((v_ArrVal_290 (Array Int Int)) (~M~0 Int) (v_ArrVal_289 (Array Int Int))) (let ((.cse2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (not (< c_~max2~0 .cse2)) (= c_~max1~0 .cse2)))))) (or (and (forall ((v_ArrVal_290 (Array Int Int)) (~M~0 Int) (v_ArrVal_289 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= .cse3 .cse4) (not (< c_~max2~0 .cse4))))) (or .cse1 (= .cse3 c_~max2~0))) (not .cse0)))))) is different from false [2022-11-16 01:47:30,393 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (let ((.cse3 (< c_~max1~0 .cse0)) (.cse2 (forall ((v_ArrVal_290 (Array Int Int)) (~M~0 Int) (v_ArrVal_289 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< c_~max2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))))))) (and (or (and (forall ((v_ArrVal_290 (Array Int Int)) (~M~0 Int) (v_ArrVal_289 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (<= (+ 2 ~M~0) c_~N~0) (= .cse0 .cse1) (not (< ~M~0 c_~N~0)) (not (< c_~max2~0 .cse1))))) (or (= .cse0 c_~max2~0) .cse2)) (not .cse3)) (or .cse3 (and (or .cse2 (= c_~max1~0 c_~max2~0)) (forall ((v_ArrVal_290 (Array Int Int)) (~M~0 Int) (v_ArrVal_289 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (not (< c_~max2~0 .cse4)) (= c_~max1~0 .cse4))))))))) (not (< 0 c_~N~0))) is different from false [2022-11-16 01:47:30,845 WARN L833 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (and (or (= c_~max1~0 c_~max2~0) (forall ((v_ArrVal_290 (Array Int Int)) (~M~0 Int) (v_ArrVal_289 (Array Int Int)) (v_ArrVal_288 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_288))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< c_~max1~0 (select (select .cse0 c_~A~0.base) c_~A~0.offset)) (< c_~max2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))))))) (forall ((v_ArrVal_288 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_288))) (or (forall ((v_ArrVal_290 (Array Int Int)) (~M~0 Int) (v_ArrVal_289 (Array Int Int))) (let ((.cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (<= (+ 2 ~M~0) c_~N~0) (= c_~max1~0 .cse1) (not (< ~M~0 c_~N~0)) (not (< c_~max2~0 .cse1))))) (< c_~max1~0 (select (select .cse2 c_~A~0.base) c_~A~0.offset))))) (forall ((v_ArrVal_288 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_288))) (let ((.cse4 (select (select .cse3 c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_290 (Array Int Int)) (~M~0 Int) (v_ArrVal_289 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< c_~max2~0 (select (select (store (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))))) (not (< c_~max1~0 .cse4)) (= .cse4 c_~max2~0))))) (forall ((v_ArrVal_288 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_288))) (let ((.cse5 (select (select .cse7 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max1~0 .cse5)) (forall ((v_ArrVal_290 (Array Int Int)) (~M~0 Int) (v_ArrVal_289 (Array Int Int))) (let ((.cse6 (select (select (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (<= (+ 2 ~M~0) c_~N~0) (= .cse5 .cse6) (not (< ~M~0 c_~N~0)) (not (< c_~max2~0 .cse6))))))))))) is different from false [2022-11-16 01:47:31,512 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_288 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_288))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (not (< c_~max1~0 .cse0)) (= c_~max2~0 .cse0) (forall ((v_ArrVal_290 (Array Int Int)) (~M~0 Int) (v_ArrVal_289 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< c_~max2~0 (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))))))))) (forall ((v_ArrVal_288 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_288))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (not (< c_~max1~0 .cse2)) (forall ((v_ArrVal_290 (Array Int Int)) (~M~0 Int) (v_ArrVal_289 (Array Int Int))) (let ((.cse3 (select (select (store (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (= .cse3 .cse2) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (not (< c_~max2~0 .cse3))))))))) (forall ((v_ArrVal_288 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_288))) (or (< c_~max1~0 (select (select .cse5 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (forall ((v_ArrVal_290 (Array Int Int)) (~M~0 Int) (v_ArrVal_289 (Array Int Int))) (let ((.cse6 (select (select (store (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= c_~max1~0 .cse6) (not (< c_~max2~0 .cse6)))))))) (or (forall ((v_ArrVal_290 (Array Int Int)) (~M~0 Int) (v_ArrVal_289 (Array Int Int)) (v_ArrVal_288 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_288))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< c_~max1~0 (select (select .cse7 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (< c_~max2~0 (select (select (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))))) (= c_~max1~0 c_~max2~0))) (not (< 0 c_~N~0))) is different from false [2022-11-16 01:47:31,676 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_288 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_288))) (or (forall ((v_ArrVal_290 (Array Int Int)) (~M~0 Int) (v_ArrVal_289 (Array Int Int))) (let ((.cse0 (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (not (< c_~max2~0 .cse0)) (= .cse0 c_~max1~0)))) (< c_~max1~0 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))) (forall ((v_ArrVal_288 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_288))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (forall ((v_ArrVal_290 (Array Int Int)) (~M~0 Int) (v_ArrVal_289 (Array Int Int))) (or (< c_~max2~0 (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)))) (not (< c_~max1~0 .cse3)) (= c_~max2~0 .cse3))))) (forall ((v_ArrVal_288 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_288))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (forall ((v_ArrVal_290 (Array Int Int)) (~M~0 Int) (v_ArrVal_289 (Array Int Int))) (let ((.cse4 (select (select (store (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (<= (+ 2 ~M~0) c_~N~0) (= .cse4 .cse5) (not (< ~M~0 c_~N~0)) (not (< c_~max2~0 .cse4))))) (not (< c_~max1~0 .cse5)))))) (or (= c_~max1~0 c_~max2~0) (forall ((v_ArrVal_290 (Array Int Int)) (~M~0 Int) (v_ArrVal_289 (Array Int Int)) (v_ArrVal_288 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_288))) (or (< c_~max2~0 (select (select (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< c_~max1~0 (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))))) (not (< 0 c_~N~0))) is different from false [2022-11-16 01:47:31,763 WARN L833 $PredicateComparison]: unable to prove that (or (and (or (= c_~max1~0 c_~max2~0) (forall ((v_ArrVal_290 (Array Int Int)) (~M~0 Int) (v_ArrVal_289 (Array Int Int)) (v_ArrVal_288 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_288))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< c_~max1~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (forall ((v_ArrVal_288 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_288))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_290 (Array Int Int)) (~M~0 Int) (v_ArrVal_289 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< c_~max2~0 (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (not (< c_~max1~0 .cse2)) (= c_~max2~0 .cse2))))) (forall ((v_ArrVal_288 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_288))) (or (forall ((v_ArrVal_290 (Array Int Int)) (~M~0 Int) (v_ArrVal_289 (Array Int Int))) (let ((.cse3 (select (select (store (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< c_~max2~0 .cse3)) (not (< ~M~0 c_~N~0)) (= c_~max1~0 .cse3)))) (< c_~max1~0 (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (forall ((v_ArrVal_288 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_288))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_290 (Array Int Int)) (~M~0 Int) (v_ArrVal_289 (Array Int Int))) (let ((.cse5 (select (select (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< c_~max2~0 .cse5)) (not (< ~M~0 c_~N~0)) (= .cse5 .cse6)))) (not (< c_~max1~0 .cse6))))))) (not (< 0 c_~N~0))) is different from false [2022-11-16 01:47:31,835 WARN L833 $PredicateComparison]: unable to prove that (or (and (or (= c_~max1~0 c_~max2~0) (forall ((v_ArrVal_290 (Array Int Int)) (~M~0 Int) (v_ArrVal_289 (Array Int Int)) (v_ArrVal_288 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_288))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< c_~max1~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (forall ((v_ArrVal_288 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_288))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_290 (Array Int Int)) (~M~0 Int) (v_ArrVal_289 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< c_~max2~0 (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (not (< c_~max1~0 .cse2)) (= c_~max2~0 .cse2))))) (forall ((v_ArrVal_288 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_288))) (or (forall ((v_ArrVal_290 (Array Int Int)) (~M~0 Int) (v_ArrVal_289 (Array Int Int))) (let ((.cse3 (select (select (store (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< c_~max2~0 .cse3)) (not (< ~M~0 c_~N~0)) (= c_~max1~0 .cse3)))) (< c_~max1~0 (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (forall ((v_ArrVal_288 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_288))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_290 (Array Int Int)) (~M~0 Int) (v_ArrVal_289 (Array Int Int))) (let ((.cse5 (select (select (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< c_~max2~0 .cse5)) (not (< ~M~0 c_~N~0)) (= .cse5 .cse6)))) (not (< c_~max1~0 .cse6))))))) (not (< 0 c_~N~0)) (< |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) is different from false [2022-11-16 01:47:31,968 WARN L833 $PredicateComparison]: unable to prove that (or (and (or (= c_~max1~0 c_~max2~0) (forall ((v_ArrVal_290 (Array Int Int)) (~M~0 Int) (v_ArrVal_289 (Array Int Int)) (v_ArrVal_288 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_288))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< c_~max1~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (forall ((v_ArrVal_288 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_288))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_290 (Array Int Int)) (~M~0 Int) (v_ArrVal_289 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< c_~max2~0 (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (not (< c_~max1~0 .cse2)) (= c_~max2~0 .cse2))))) (forall ((v_ArrVal_288 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_288))) (or (forall ((v_ArrVal_290 (Array Int Int)) (~M~0 Int) (v_ArrVal_289 (Array Int Int))) (let ((.cse3 (select (select (store (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< c_~max2~0 .cse3)) (not (< ~M~0 c_~N~0)) (= c_~max1~0 .cse3)))) (< c_~max1~0 (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (forall ((v_ArrVal_288 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_288))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_290 (Array Int Int)) (~M~0 Int) (v_ArrVal_289 (Array Int Int))) (let ((.cse5 (select (select (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< c_~max2~0 .cse5)) (not (< ~M~0 c_~N~0)) (= .cse5 .cse6)))) (not (< c_~max1~0 .cse6))))))) (not (< 0 c_~N~0)) (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) is different from false [2022-11-16 01:47:32,030 WARN L833 $PredicateComparison]: unable to prove that (or (and (or (= c_~max1~0 c_~max2~0) (forall ((v_ArrVal_290 (Array Int Int)) (~M~0 Int) (v_ArrVal_289 (Array Int Int)) (v_ArrVal_288 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_288))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< c_~max1~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (forall ((v_ArrVal_288 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_288))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_290 (Array Int Int)) (~M~0 Int) (v_ArrVal_289 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< c_~max2~0 (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (not (< c_~max1~0 .cse2)) (= c_~max2~0 .cse2))))) (forall ((v_ArrVal_288 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_288))) (or (forall ((v_ArrVal_290 (Array Int Int)) (~M~0 Int) (v_ArrVal_289 (Array Int Int))) (let ((.cse3 (select (select (store (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< c_~max2~0 .cse3)) (not (< ~M~0 c_~N~0)) (= c_~max1~0 .cse3)))) (< c_~max1~0 (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (forall ((v_ArrVal_288 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_288))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_290 (Array Int Int)) (~M~0 Int) (v_ArrVal_289 (Array Int Int))) (let ((.cse5 (select (select (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< c_~max2~0 .cse5)) (not (< ~M~0 c_~N~0)) (= .cse5 .cse6)))) (not (< c_~max1~0 .cse6))))))) (not (< 0 c_~N~0)) (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) is different from false [2022-11-16 01:47:32,114 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 01:47:32,114 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 43 [2022-11-16 01:47:32,122 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 01:47:32,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 319 treesize of output 309 [2022-11-16 01:47:32,131 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 01:47:32,131 INFO L350 Elim1Store]: Elim1 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 156 treesize of output 152 [2022-11-16 01:47:32,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 270 treesize of output 222 [2022-11-16 01:47:32,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 222 treesize of output 198 [2022-11-16 01:47:32,291 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 01:47:32,292 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 72 [2022-11-16 01:47:32,300 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 01:47:32,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1040 treesize of output 934 [2022-11-16 01:47:32,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 904 treesize of output 760 [2022-11-16 01:47:32,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 760 treesize of output 688 [2022-11-16 01:47:32,342 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 01:47:32,342 INFO L350 Elim1Store]: Elim1 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 708 treesize of output 648 [2022-11-16 01:47:32,801 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 01:47:32,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 1 [2022-11-16 01:47:32,807 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 01:47:32,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 1 [2022-11-16 01:47:33,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-16 01:47:33,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949157794] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 01:47:33,288 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 01:47:33,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31, 31] total 76 [2022-11-16 01:47:33,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332608273] [2022-11-16 01:47:33,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 01:47:33,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-11-16 01:47:33,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 01:47:33,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-11-16 01:47:33,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=519, Invalid=3790, Unknown=21, NotChecked=1370, Total=5700 [2022-11-16 01:47:33,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:33,291 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 01:47:33,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 3.986842105263158) internal successors, (303), 76 states have internal predecessors, (303), 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) [2022-11-16 01:47:33,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:33,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:47:33,291 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:47:33,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-16 01:47:33,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2022-11-16 01:47:33,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-16 01:47:33,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-16 01:47:33,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-16 01:47:33,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-11-16 01:47:33,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:39,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:39,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:47:39,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:47:39,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 01:47:39,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-16 01:47:39,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-16 01:47:39,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-16 01:47:39,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-16 01:47:39,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-16 01:47:39,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-16 01:47:39,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-16 01:47:39,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-16 01:47:39,645 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 01:47:39,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 01:47:39,645 INFO L85 PathProgramCache]: Analyzing trace with hash -2006761502, now seen corresponding path program 6 times [2022-11-16 01:47:39,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 01:47:39,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037134635] [2022-11-16 01:47:39,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:47:39,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 01:47:39,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:47:39,848 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 01:47:39,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 01:47:39,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037134635] [2022-11-16 01:47:39,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037134635] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 01:47:39,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085155470] [2022-11-16 01:47:39,849 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-16 01:47:39,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 01:47:39,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 01:47:39,850 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 01:47:39,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-16 01:47:39,968 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-11-16 01:47:39,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 01:47:39,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-16 01:47:39,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 01:47:40,193 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 01:47:40,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 01:47:40,414 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 01:47:40,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085155470] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 01:47:40,415 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 01:47:40,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 29 [2022-11-16 01:47:40,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355530542] [2022-11-16 01:47:40,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 01:47:40,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-16 01:47:40,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 01:47:40,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-16 01:47:40,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2022-11-16 01:47:40,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:40,416 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 01:47:40,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.103448275862069) internal successors, (206), 29 states have internal predecessors, (206), 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) [2022-11-16 01:47:40,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:40,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:47:40,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:47:40,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-16 01:47:40,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2022-11-16 01:47:40,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-11-16 01:47:40,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-16 01:47:40,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-16 01:47:40,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-11-16 01:47:40,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2022-11-16 01:47:40,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:41,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:47:41,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:47:41,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:47:41,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 01:47:41,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-16 01:47:41,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-16 01:47:41,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-16 01:47:41,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-16 01:47:41,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-16 01:47:41,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-16 01:47:41,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-16 01:47:41,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-16 01:47:41,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-16 01:47:41,591 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 01:47:41,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 01:47:41,591 INFO L85 PathProgramCache]: Analyzing trace with hash 326209330, now seen corresponding path program 7 times [2022-11-16 01:47:41,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 01:47:41,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293626930] [2022-11-16 01:47:41,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:47:41,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 01:47:41,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:47:43,576 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 01:47:43,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 01:47:43,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293626930] [2022-11-16 01:47:43,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293626930] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 01:47:43,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402094037] [2022-11-16 01:47:43,577 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-16 01:47:43,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 01:47:43,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 01:47:43,578 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 01:47:43,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-16 01:47:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:47:43,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-16 01:47:43,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 01:47:45,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 01:47:45,201 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 01:47:45,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 160 treesize of output 104 [2022-11-16 01:47:45,862 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 01:47:45,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 01:48:06,919 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 01:48:06,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 18 select indices, 18 select index equivalence classes, 0 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 153 case distinctions, treesize of input 485 treesize of output 2059 [2022-11-16 01:58:26,603 WARN L718 sPolynomialRelations]: Constructing 262144(two to the power of 18 dual juncts. [2022-11-16 01:59:03,425 WARN L233 SmtUtils]: Spent 6.44s on a formula simplification. DAG size of input: 671 DAG size of output: 513 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2022-11-16 02:01:20,536 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-11-16 02:01:20,543 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-16 02:01:20,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-16 02:01:20,572 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-16 02:01:20,572 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-16 02:01:20,572 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-16 02:01:20,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-16 02:01:20,748 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 140 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 36ms.. [2022-11-16 02:01:20,772 INFO L444 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1] [2022-11-16 02:01:20,773 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was TIMEOUT (1/4) [2022-11-16 02:01:20,774 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 02:01:20,775 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 02:01:20,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 02:01:20 BasicIcfg [2022-11-16 02:01:20,777 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 02:01:20,778 INFO L158 Benchmark]: Toolchain (without parser) took 858066.48ms. Allocated memory was 185.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 130.4MB in the beginning and 770.5MB in the end (delta: -640.1MB). Peak memory consumption was 749.3MB. Max. memory is 8.0GB. [2022-11-16 02:01:20,778 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 185.6MB. Free memory is still 147.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-11-16 02:01:20,778 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.39ms. Allocated memory is still 185.6MB. Free memory was 130.2MB in the beginning and 157.6MB in the end (delta: -27.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-11-16 02:01:20,778 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.99ms. Allocated memory is still 185.6MB. Free memory was 157.5MB in the beginning and 155.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-11-16 02:01:20,778 INFO L158 Benchmark]: Boogie Preprocessor took 33.18ms. Allocated memory is still 185.6MB. Free memory was 155.7MB in the beginning and 154.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-11-16 02:01:20,784 INFO L158 Benchmark]: RCFGBuilder took 406.27ms. Allocated memory is still 185.6MB. Free memory was 154.0MB in the beginning and 133.5MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-11-16 02:01:20,784 INFO L158 Benchmark]: TraceAbstraction took 857333.33ms. Allocated memory was 185.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 132.8MB in the beginning and 770.5MB in the end (delta: -637.7MB). Peak memory consumption was 751.9MB. Max. memory is 8.0GB. [2022-11-16 02:01:20,785 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.09ms. Allocated memory is still 185.6MB. Free memory is still 147.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 248.39ms. Allocated memory is still 185.6MB. Free memory was 130.2MB in the beginning and 157.6MB in the end (delta: -27.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.99ms. Allocated memory is still 185.6MB. Free memory was 157.5MB in the beginning and 155.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.18ms. Allocated memory is still 185.6MB. Free memory was 155.7MB in the beginning and 154.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 406.27ms. Allocated memory is still 185.6MB. Free memory was 154.0MB in the beginning and 133.5MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 857333.33ms. Allocated memory was 185.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 132.8MB in the beginning and 770.5MB in the end (delta: -637.7MB). Peak memory consumption was 751.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43590, independent: 37987, independent conditional: 35785, independent unconditional: 2202, dependent: 5603, dependent conditional: 5583, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38009, independent: 37987, independent conditional: 35785, independent unconditional: 2202, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 38009, independent: 37987, independent conditional: 35785, independent unconditional: 2202, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38031, independent: 37987, independent conditional: 5, independent unconditional: 37982, dependent: 44, dependent conditional: 17, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 38031, independent: 37987, independent conditional: 5, independent unconditional: 37982, dependent: 44, dependent conditional: 9, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 38031, independent: 37987, independent conditional: 5, independent unconditional: 37982, dependent: 44, dependent conditional: 9, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1978, independent: 1949, independent conditional: 3, independent unconditional: 1946, dependent: 29, dependent conditional: 9, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1978, independent: 1944, independent conditional: 0, independent unconditional: 1944, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 34, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 29, dependent conditional: 9, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 34, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 29, dependent conditional: 9, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 197, independent: 56, independent conditional: 11, independent unconditional: 46, dependent: 141, dependent conditional: 18, dependent unconditional: 123, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 38031, independent: 36038, independent conditional: 2, independent unconditional: 36036, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 1978, unknown conditional: 12, unknown unconditional: 1966] , Statistics on independence cache: Total cache size (in pairs): 1978, Positive cache size: 1949, Positive conditional cache size: 3, Positive unconditional cache size: 1946, Negative cache size: 29, Negative conditional cache size: 9, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 8, Independence queries for same thread: 5581 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.3s, Number of persistent set computation: 1755, Number of trivial persistent sets: 1738, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2222, independent: 2202, independent conditional: 0, independent unconditional: 2202, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43590, independent: 37987, independent conditional: 35785, independent unconditional: 2202, dependent: 5603, dependent conditional: 5583, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38009, independent: 37987, independent conditional: 35785, independent unconditional: 2202, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 38009, independent: 37987, independent conditional: 35785, independent unconditional: 2202, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38031, independent: 37987, independent conditional: 5, independent unconditional: 37982, dependent: 44, dependent conditional: 17, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 38031, independent: 37987, independent conditional: 5, independent unconditional: 37982, dependent: 44, dependent conditional: 9, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 38031, independent: 37987, independent conditional: 5, independent unconditional: 37982, dependent: 44, dependent conditional: 9, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1978, independent: 1949, independent conditional: 3, independent unconditional: 1946, dependent: 29, dependent conditional: 9, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1978, independent: 1944, independent conditional: 0, independent unconditional: 1944, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 34, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 29, dependent conditional: 9, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 34, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 29, dependent conditional: 9, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 197, independent: 56, independent conditional: 11, independent unconditional: 46, dependent: 141, dependent conditional: 18, dependent unconditional: 123, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 38031, independent: 36038, independent conditional: 2, independent unconditional: 36036, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 1978, unknown conditional: 12, unknown unconditional: 1966] , Statistics on independence cache: Total cache size (in pairs): 1978, Positive cache size: 1949, Positive conditional cache size: 3, Positive unconditional cache size: 1946, Negative cache size: 29, Negative conditional cache size: 9, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 8, Independence queries for same thread: 5581 - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 140 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 36ms.. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 7 procedures, 172 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 857.2s, OverallIterations: 12, TraceHistogramMax: 0, PathProgramHistogramMax: 7, EmptinessCheckTime: 14.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 299, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 20.3s InterpolantComputationTime, 2414 NumberOfCodeBlocks, 2414 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 3485 ConstructedInterpolants, 77 QuantifiedInterpolants, 34544 SizeOfPredicates, 154 NumberOfNonLiveVariables, 2562 ConjunctsInSsa, 203 ConjunctsInUnsatCore, 29 InterpolantComputations, 4 PerfectInterpolantSequences, 59/132 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown