/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 19:47:36,197 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 19:47:36,204 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 19:47:36,240 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 19:47:36,240 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 19:47:36,242 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 19:47:36,245 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 19:47:36,249 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 19:47:36,250 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 19:47:36,253 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 19:47:36,254 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 19:47:36,255 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 19:47:36,255 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 19:47:36,256 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 19:47:36,258 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 19:47:36,259 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 19:47:36,260 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 19:47:36,260 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 19:47:36,263 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 19:47:36,267 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 19:47:36,268 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 19:47:36,268 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 19:47:36,270 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 19:47:36,270 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 19:47:36,275 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 19:47:36,275 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 19:47:36,275 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 19:47:36,276 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 19:47:36,276 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 19:47:36,277 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 19:47:36,277 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 19:47:36,278 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 19:47:36,279 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 19:47:36,279 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 19:47:36,280 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 19:47:36,280 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 19:47:36,281 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 19:47:36,281 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 19:47:36,281 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 19:47:36,281 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 19:47:36,282 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 19:47:36,283 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 19:47:36,306 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 19:47:36,306 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 19:47:36,307 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 19:47:36,307 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 19:47:36,307 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 19:47:36,307 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 19:47:36,307 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 19:47:36,307 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 19:47:36,308 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 19:47:36,308 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 19:47:36,308 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 19:47:36,308 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 19:47:36,308 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 19:47:36,308 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 19:47:36,308 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 19:47:36,309 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 19:47:36,309 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 19:47:36,309 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 19:47:36,309 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 19:47:36,309 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 19:47:36,309 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 19:47:36,309 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 19:47:36,309 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 19:47:36,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:47:36,309 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 19:47:36,309 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 19:47:36,310 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 19:47:36,310 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 19:47:36,310 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 19:47:36,311 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 19:47:36,311 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 19:47:36,311 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 19:47:36,311 INFO L138 SettingsManager]: * Interpolant automaton=MCR 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 [2022-03-15 19:47:36,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 19:47:36,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 19:47:36,526 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 19:47:36,526 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 19:47:36,528 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 19:47:36,529 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2022-03-15 19:47:36,570 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fb44c1be/70e6999eee044608a31c1a0592542921/FLAGa5b53f35c [2022-03-15 19:47:36,930 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 19:47:36,931 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2022-03-15 19:47:36,935 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fb44c1be/70e6999eee044608a31c1a0592542921/FLAGa5b53f35c [2022-03-15 19:47:36,945 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fb44c1be/70e6999eee044608a31c1a0592542921 [2022-03-15 19:47:36,946 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 19:47:36,947 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 19:47:36,949 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 19:47:36,949 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 19:47:36,951 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 19:47:36,951 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:47:36" (1/1) ... [2022-03-15 19:47:36,952 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@357ada1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:47:36, skipping insertion in model container [2022-03-15 19:47:36,952 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:47:36" (1/1) ... [2022-03-15 19:47:36,956 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 19:47:36,971 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 19:47:37,091 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c[2987,3000] [2022-03-15 19:47:37,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:47:37,100 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 19:47:37,113 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c[2987,3000] [2022-03-15 19:47:37,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:47:37,124 INFO L208 MainTranslator]: Completed translation [2022-03-15 19:47:37,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:47:37 WrapperNode [2022-03-15 19:47:37,124 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 19:47:37,125 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 19:47:37,125 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 19:47:37,125 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 19:47:37,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:47:37" (1/1) ... [2022-03-15 19:47:37,134 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:47:37" (1/1) ... [2022-03-15 19:47:37,150 INFO L137 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 200 [2022-03-15 19:47:37,150 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 19:47:37,151 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 19:47:37,151 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 19:47:37,151 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 19:47:37,156 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:47:37" (1/1) ... [2022-03-15 19:47:37,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:47:37" (1/1) ... [2022-03-15 19:47:37,158 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:47:37" (1/1) ... [2022-03-15 19:47:37,159 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:47:37" (1/1) ... [2022-03-15 19:47:37,164 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:47:37" (1/1) ... [2022-03-15 19:47:37,166 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:47:37" (1/1) ... [2022-03-15 19:47:37,167 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:47:37" (1/1) ... [2022-03-15 19:47:37,169 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 19:47:37,170 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 19:47:37,170 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 19:47:37,170 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 19:47:37,170 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:47:37" (1/1) ... [2022-03-15 19:47:37,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:47:37,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:47:37,209 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-03-15 19:47:37,214 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-03-15 19:47:37,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 19:47:37,237 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 19:47:37,237 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 19:47:37,237 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 19:47:37,237 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 19:47:37,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 19:47:37,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 19:47:37,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 19:47:37,238 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 19:47:37,238 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 19:47:37,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 19:47:37,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 19:47:37,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 19:47:37,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 19:47:37,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 19:47:37,239 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 19:47:37,307 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 19:47:37,308 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 19:47:37,590 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 19:47:37,656 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 19:47:37,656 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-03-15 19:47:37,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:47:37 BoogieIcfgContainer [2022-03-15 19:47:37,658 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 19:47:37,659 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 19:47:37,659 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 19:47:37,661 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 19:47:37,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 07:47:36" (1/3) ... [2022-03-15 19:47:37,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b0b2f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:47:37, skipping insertion in model container [2022-03-15 19:47:37,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:47:37" (2/3) ... [2022-03-15 19:47:37,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b0b2f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:47:37, skipping insertion in model container [2022-03-15 19:47:37,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:47:37" (3/3) ... [2022-03-15 19:47:37,663 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2022-03-15 19:47:37,666 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 19:47:37,666 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 19:47:37,666 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 19:47:37,666 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 19:47:37,709 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,709 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,710 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,710 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,710 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,710 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,710 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,710 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,710 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,710 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,711 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,711 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,711 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,711 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,711 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,711 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,712 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,712 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,712 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,712 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,712 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,712 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,712 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,713 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,713 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,713 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,713 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,713 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,713 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,714 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,714 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,714 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,714 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,714 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,714 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,714 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,714 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,714 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,715 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,715 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,715 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,715 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,715 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,716 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,716 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,716 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,716 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,716 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,716 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,716 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,717 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,717 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,719 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,719 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,719 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,719 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,719 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,719 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,720 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,720 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,720 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,720 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,720 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,720 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,721 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,721 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,721 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,721 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,721 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,721 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:47:37,723 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-15 19:47:37,755 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 19:47:37,759 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, 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=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 19:47:37,759 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-03-15 19:47:37,768 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 19:47:37,776 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 178 transitions, 372 flow [2022-03-15 19:47:37,778 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 172 places, 178 transitions, 372 flow [2022-03-15 19:47:37,779 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 172 places, 178 transitions, 372 flow [2022-03-15 19:47:37,839 INFO L129 PetriNetUnfolder]: 13/176 cut-off events. [2022-03-15 19:47:37,840 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-03-15 19:47:37,842 INFO L84 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 176 events. 13/176 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 83 event pairs, 0 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 141. Up to 2 conditions per place. [2022-03-15 19:47:37,844 INFO L116 LiptonReduction]: Number of co-enabled transitions 500 [2022-03-15 19:47:42,562 INFO L131 LiptonReduction]: Checked pairs total: 826 [2022-03-15 19:47:42,562 INFO L133 LiptonReduction]: Total number of compositions: 180 [2022-03-15 19:47:42,568 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 25 places, 22 transitions, 60 flow [2022-03-15 19:47:42,578 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 36 states, 35 states have (on average 2.2) internal successors, (77), 35 states have internal predecessors, (77), 0 states have call successors, (0), 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-03-15 19:47:42,579 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 35 states have (on average 2.2) internal successors, (77), 35 states have internal predecessors, (77), 0 states have call successors, (0), 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-03-15 19:47:42,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 19:47:42,583 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:47:42,584 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:47:42,584 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:47:42,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:47:42,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1757789940, now seen corresponding path program 1 times [2022-03-15 19:47:42,602 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:47:42,603 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264933839] [2022-03-15 19:47:42,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:47:42,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:47:42,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:47:42,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:42,827 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:47:42,828 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264933839] [2022-03-15 19:47:42,828 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264933839] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:47:42,828 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:47:42,828 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 19:47:42,829 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1729175525] [2022-03-15 19:47:42,830 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:47:42,834 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:47:42,849 INFO L252 McrAutomatonBuilder]: Finished intersection with 22 states and 30 transitions. [2022-03-15 19:47:42,849 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:47:42,979 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:47:42,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 19:47:42,980 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:47:42,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 19:47:42,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:47:42,994 INFO L87 Difference]: Start difference. First operand has 36 states, 35 states have (on average 2.2) internal successors, (77), 35 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 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-03-15 19:47:43,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:47:43,034 INFO L93 Difference]: Finished difference Result 67 states and 147 transitions. [2022-03-15 19:47:43,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 19:47:43,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 19:47:43,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:47:43,042 INFO L225 Difference]: With dead ends: 67 [2022-03-15 19:47:43,042 INFO L226 Difference]: Without dead ends: 62 [2022-03-15 19:47:43,043 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:47:43,045 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 4 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:47:43,046 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 0 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:47:43,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-03-15 19:47:43,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 48. [2022-03-15 19:47:43,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 2.2127659574468086) internal successors, (104), 47 states have internal predecessors, (104), 0 states have call successors, (0), 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-03-15 19:47:43,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 104 transitions. [2022-03-15 19:47:43,068 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 104 transitions. Word has length 13 [2022-03-15 19:47:43,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:47:43,069 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 104 transitions. [2022-03-15 19:47:43,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 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-03-15 19:47:43,069 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 104 transitions. [2022-03-15 19:47:43,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 19:47:43,069 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:47:43,069 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:47:43,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 19:47:43,070 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:47:43,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:47:43,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1622612603, now seen corresponding path program 1 times [2022-03-15 19:47:43,072 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:47:43,072 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054643342] [2022-03-15 19:47:43,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:47:43,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:47:43,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:47:43,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:43,148 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:47:43,148 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054643342] [2022-03-15 19:47:43,148 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054643342] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:47:43,149 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:47:43,149 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 19:47:43,149 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1114645542] [2022-03-15 19:47:43,149 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:47:43,151 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:47:43,153 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 32 transitions. [2022-03-15 19:47:43,154 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:47:43,198 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:47:43,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 19:47:43,201 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:47:43,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 19:47:43,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:47:43,201 INFO L87 Difference]: Start difference. First operand 48 states and 104 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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-03-15 19:47:43,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:47:43,251 INFO L93 Difference]: Finished difference Result 68 states and 134 transitions. [2022-03-15 19:47:43,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 19:47:43,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 19:47:43,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:47:43,253 INFO L225 Difference]: With dead ends: 68 [2022-03-15 19:47:43,253 INFO L226 Difference]: Without dead ends: 49 [2022-03-15 19:47:43,253 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 19:47:43,255 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 18 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:47:43,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 0 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:47:43,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-03-15 19:47:43,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-03-15 19:47:43,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 2.1875) internal successors, (105), 48 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-03-15 19:47:43,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 105 transitions. [2022-03-15 19:47:43,267 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 105 transitions. Word has length 15 [2022-03-15 19:47:43,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:47:43,267 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 105 transitions. [2022-03-15 19:47:43,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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-03-15 19:47:43,268 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 105 transitions. [2022-03-15 19:47:43,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 19:47:43,269 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:47:43,269 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:47:43,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 19:47:43,270 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:47:43,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:47:43,271 INFO L85 PathProgramCache]: Analyzing trace with hash 214757420, now seen corresponding path program 1 times [2022-03-15 19:47:43,271 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:47:43,272 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228680262] [2022-03-15 19:47:43,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:47:43,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:47:43,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:47:43,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:47:43,348 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:47:43,348 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228680262] [2022-03-15 19:47:43,348 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228680262] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:47:43,348 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116753956] [2022-03-15 19:47:43,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:47:43,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:47:43,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:47:43,350 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:47:43,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-15 19:47:43,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:47:43,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 19:47:43,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:47:43,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:47:43,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:47:43,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:47:43,566 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116753956] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:47:43,566 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:47:43,566 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2022-03-15 19:47:43,566 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [19741459] [2022-03-15 19:47:43,566 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:47:43,568 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:47:43,571 INFO L252 McrAutomatonBuilder]: Finished intersection with 25 states and 33 transitions. [2022-03-15 19:47:43,571 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:47:43,683 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [684#(and (or (= ~j~0 0) (< ~i~0 ~N~0)) (or (<= 1 ~N~0) (< ~i~0 ~N~0))), 651#(< ~j~0 ~N~0), 683#(< ~i~0 ~N~0)] [2022-03-15 19:47:43,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 19:47:43,683 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:47:43,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 19:47:43,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-03-15 19:47:43,684 INFO L87 Difference]: Start difference. First operand 49 states and 105 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 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-03-15 19:47:43,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:47:43,806 INFO L93 Difference]: Finished difference Result 109 states and 223 transitions. [2022-03-15 19:47:43,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 19:47:43,807 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 19:47:43,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:47:43,808 INFO L225 Difference]: With dead ends: 109 [2022-03-15 19:47:43,808 INFO L226 Difference]: Without dead ends: 109 [2022-03-15 19:47:43,808 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-03-15 19:47:43,809 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 57 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:47:43,809 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 0 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:47:43,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-03-15 19:47:43,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 55. [2022-03-15 19:47:43,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 2.3518518518518516) internal successors, (127), 54 states have internal predecessors, (127), 0 states have call successors, (0), 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-03-15 19:47:43,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 127 transitions. [2022-03-15 19:47:43,813 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 127 transitions. Word has length 16 [2022-03-15 19:47:43,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:47:43,813 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 127 transitions. [2022-03-15 19:47:43,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 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-03-15 19:47:43,813 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 127 transitions. [2022-03-15 19:47:43,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 19:47:43,814 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:47:43,814 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:47:43,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-15 19:47:44,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:47:44,028 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:47:44,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:47:44,028 INFO L85 PathProgramCache]: Analyzing trace with hash -682686950, now seen corresponding path program 1 times [2022-03-15 19:47:44,031 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:47:44,031 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997969710] [2022-03-15 19:47:44,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:47:44,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:47:44,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:47:44,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:47:44,117 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:47:44,118 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997969710] [2022-03-15 19:47:44,119 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997969710] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:47:44,119 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:47:44,119 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 19:47:44,121 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [984487471] [2022-03-15 19:47:44,121 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:47:44,123 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:47:44,127 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 55 transitions. [2022-03-15 19:47:44,127 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:47:44,184 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2022-03-15 19:47:44,256 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-03-15 19:47:44,396 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [917#(or (<= ~N~0 ~j~0) (< ~i~0 ~N~0)), 915#(< ~i~0 ~N~0), 918#(and (or (= ~j~0 0) (< ~i~0 ~N~0)) (or (<= ~N~0 0) (< ~i~0 ~N~0))), 916#(<= ~N~0 ~j~0), 914#(< ~j~0 ~N~0)] [2022-03-15 19:47:44,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 19:47:44,397 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:47:44,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 19:47:44,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-03-15 19:47:44,397 INFO L87 Difference]: Start difference. First operand 55 states and 127 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 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-03-15 19:47:44,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:47:44,541 INFO L93 Difference]: Finished difference Result 81 states and 167 transitions. [2022-03-15 19:47:44,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 19:47:44,541 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 19:47:44,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:47:44,542 INFO L225 Difference]: With dead ends: 81 [2022-03-15 19:47:44,542 INFO L226 Difference]: Without dead ends: 75 [2022-03-15 19:47:44,543 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-03-15 19:47:44,544 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 75 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:47:44,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 0 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:47:44,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-03-15 19:47:44,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 55. [2022-03-15 19:47:44,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 2.2777777777777777) internal successors, (123), 54 states have internal predecessors, (123), 0 states have call successors, (0), 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-03-15 19:47:44,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 123 transitions. [2022-03-15 19:47:44,548 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 123 transitions. Word has length 16 [2022-03-15 19:47:44,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:47:44,548 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 123 transitions. [2022-03-15 19:47:44,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 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-03-15 19:47:44,548 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 123 transitions. [2022-03-15 19:47:44,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 19:47:44,549 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:47:44,549 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:47:44,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 19:47:44,549 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:47:44,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:47:44,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1804083496, now seen corresponding path program 2 times [2022-03-15 19:47:44,553 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:47:44,553 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088571644] [2022-03-15 19:47:44,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:47:44,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:47:44,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:47:44,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:47:44,603 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:47:44,603 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088571644] [2022-03-15 19:47:44,603 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088571644] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:47:44,603 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:47:44,603 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 19:47:44,603 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1395877053] [2022-03-15 19:47:44,603 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:47:44,605 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:47:44,609 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 49 transitions. [2022-03-15 19:47:44,609 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:47:44,726 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [1126#(< ~j~0 ~N~0)] [2022-03-15 19:47:44,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 19:47:44,727 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:47:44,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 19:47:44,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-15 19:47:44,728 INFO L87 Difference]: Start difference. First operand 55 states and 123 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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-03-15 19:47:44,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:47:44,785 INFO L93 Difference]: Finished difference Result 65 states and 143 transitions. [2022-03-15 19:47:44,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 19:47:44,786 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 19:47:44,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:47:44,788 INFO L225 Difference]: With dead ends: 65 [2022-03-15 19:47:44,788 INFO L226 Difference]: Without dead ends: 63 [2022-03-15 19:47:44,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-15 19:47:44,789 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 8 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:47:44,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 0 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:47:44,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-03-15 19:47:44,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 55. [2022-03-15 19:47:44,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 2.240740740740741) internal successors, (121), 54 states have internal predecessors, (121), 0 states have call successors, (0), 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-03-15 19:47:44,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 121 transitions. [2022-03-15 19:47:44,804 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 121 transitions. Word has length 16 [2022-03-15 19:47:44,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:47:44,804 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 121 transitions. [2022-03-15 19:47:44,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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-03-15 19:47:44,804 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 121 transitions. [2022-03-15 19:47:44,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 19:47:44,808 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:47:44,809 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:47:44,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 19:47:44,810 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:47:44,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:47:44,810 INFO L85 PathProgramCache]: Analyzing trace with hash -2032363639, now seen corresponding path program 1 times [2022-03-15 19:47:44,824 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:47:44,824 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832430415] [2022-03-15 19:47:44,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:47:44,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:47:44,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:47:44,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:47:44,860 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:47:44,860 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832430415] [2022-03-15 19:47:44,860 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832430415] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:47:44,860 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:47:44,860 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 19:47:44,860 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [481781469] [2022-03-15 19:47:44,860 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:47:44,863 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:47:44,869 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 57 transitions. [2022-03-15 19:47:44,869 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:47:45,060 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:47:45,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 19:47:45,060 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:47:45,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 19:47:45,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:47:45,061 INFO L87 Difference]: Start difference. First operand 55 states and 121 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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-03-15 19:47:45,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:47:45,100 INFO L93 Difference]: Finished difference Result 67 states and 137 transitions. [2022-03-15 19:47:45,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 19:47:45,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 19:47:45,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:47:45,100 INFO L225 Difference]: With dead ends: 67 [2022-03-15 19:47:45,100 INFO L226 Difference]: Without dead ends: 56 [2022-03-15 19:47:45,101 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:47:45,101 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:47:45,101 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:47:45,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-03-15 19:47:45,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-03-15 19:47:45,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 2.2181818181818183) internal successors, (122), 55 states have internal predecessors, (122), 0 states have call successors, (0), 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-03-15 19:47:45,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 122 transitions. [2022-03-15 19:47:45,109 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 122 transitions. Word has length 18 [2022-03-15 19:47:45,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:47:45,109 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 122 transitions. [2022-03-15 19:47:45,110 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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-03-15 19:47:45,110 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 122 transitions. [2022-03-15 19:47:45,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:47:45,110 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:47:45,110 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:47:45,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 19:47:45,110 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:47:45,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:47:45,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1996244730, now seen corresponding path program 1 times [2022-03-15 19:47:45,111 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:47:45,112 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778388154] [2022-03-15 19:47:45,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:47:45,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:47:45,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:47:45,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:47:45,204 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:47:45,204 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778388154] [2022-03-15 19:47:45,205 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778388154] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:47:45,205 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:47:45,205 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 19:47:45,205 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [489776146] [2022-03-15 19:47:45,205 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:47:45,207 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:47:45,213 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 58 transitions. [2022-03-15 19:47:45,214 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:47:45,370 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [1490#(< ~q1_back~0 0)] [2022-03-15 19:47:45,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 19:47:45,370 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:47:45,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 19:47:45,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:47:45,371 INFO L87 Difference]: Start difference. First operand 56 states and 122 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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-03-15 19:47:45,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:47:45,409 INFO L93 Difference]: Finished difference Result 46 states and 96 transitions. [2022-03-15 19:47:45,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 19:47:45,409 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 19:47:45,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:47:45,409 INFO L225 Difference]: With dead ends: 46 [2022-03-15 19:47:45,410 INFO L226 Difference]: Without dead ends: 46 [2022-03-15 19:47:45,410 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 19:47:45,410 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:47:45,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 0 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:47:45,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-03-15 19:47:45,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-03-15 19:47:45,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 45 states have internal predecessors, (96), 0 states have call successors, (0), 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-03-15 19:47:45,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 96 transitions. [2022-03-15 19:47:45,412 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 96 transitions. Word has length 19 [2022-03-15 19:47:45,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:47:45,412 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 96 transitions. [2022-03-15 19:47:45,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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-03-15 19:47:45,412 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 96 transitions. [2022-03-15 19:47:45,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:47:45,413 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:47:45,413 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:47:45,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-15 19:47:45,413 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:47:45,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:47:45,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1382228070, now seen corresponding path program 2 times [2022-03-15 19:47:45,415 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:47:45,415 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006542247] [2022-03-15 19:47:45,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:47:45,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:47:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:47:46,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:46,090 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:47:46,090 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006542247] [2022-03-15 19:47:46,090 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006542247] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:47:46,090 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061367825] [2022-03-15 19:47:46,090 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:47:46,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:47:46,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:47:46,091 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-03-15 19:47:46,092 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-03-15 19:47:46,162 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:47:46,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:47:46,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 39 conjunts are in the unsatisfiable core [2022-03-15 19:47:46,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:47:46,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:47:46,324 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-03-15 19:47:46,466 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:47:46,467 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 40 [2022-03-15 19:47:46,576 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:47:46,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:47:46,922 WARN L838 $PredicateComparison]: unable to prove that (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_173 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_173))) (let ((.cse0 (select .cse3 ~q1~0.base))) (or (not (= c_~j~0 (select .cse0 (+ (* c_~q1_back~0 4) ~q1~0.offset)))) (let ((.cse1 (select .cse0 (+ (* c_~q1_front~0 4) ~q1~0.offset))) (.cse2 (+ (select (select .cse3 c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) 1))) (and (or (< (+ .cse1 1) c_~N~0) (<= .cse2 c_~N~0)) (or (< .cse1 c_~N~0) (< .cse2 c_~N~0)))))))) is different from false [2022-03-15 19:47:46,966 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:47:46,967 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 176 treesize of output 236 [2022-03-15 19:47:46,987 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:47:46,987 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 124 treesize of output 142 [2022-03-15 19:47:49,951 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:47:49,951 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061367825] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:47:49,951 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:47:49,951 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 31 [2022-03-15 19:47:49,951 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [705193374] [2022-03-15 19:47:49,951 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:47:49,955 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:47:49,961 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 57 transitions. [2022-03-15 19:47:49,961 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:47:51,069 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [1773#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 1722#(or (< ~j~0 ~N~0) (and (< ~i~0 (+ ~j~0 1)) (<= ~j~0 ~i~0))), 1776#(and (or (<= ~q1_back~0 ~q1_front~0) (< (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~j~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= ~j~0 (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), 1770#(and (or (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)) (or (<= ~j~0 ~i~0) (< ~i~0 ~N~0))), 1772#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 1771#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 1775#(and (or (<= (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (<= ~n2~0 ~q2_front~0) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0))), 1774#(and (or (<= ~n2~0 ~q2_front~0) (= ~q1~0.offset 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= ~n2~0 ~q2_front~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (< ~q2_front~0 0) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)))] [2022-03-15 19:47:51,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:47:51,070 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:47:51,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:47:51,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1301, Unknown=1, NotChecked=74, Total=1560 [2022-03-15 19:47:51,071 INFO L87 Difference]: Start difference. First operand 46 states and 96 transitions. Second operand has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 21 states have internal predecessors, (45), 0 states have call successors, (0), 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-03-15 19:47:53,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:47:53,541 INFO L93 Difference]: Finished difference Result 169 states and 370 transitions. [2022-03-15 19:47:53,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-15 19:47:53,542 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 21 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 19:47:53,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:47:53,543 INFO L225 Difference]: With dead ends: 169 [2022-03-15 19:47:53,543 INFO L226 Difference]: Without dead ends: 164 [2022-03-15 19:47:53,544 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 889 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=679, Invalid=3746, Unknown=1, NotChecked=130, Total=4556 [2022-03-15 19:47:53,545 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 158 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:47:53,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 0 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:47:53,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-03-15 19:47:53,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 82. [2022-03-15 19:47:53,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 2.1728395061728394) internal successors, (176), 81 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:53,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 176 transitions. [2022-03-15 19:47:53,554 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 176 transitions. Word has length 19 [2022-03-15 19:47:53,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:47:53,554 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 176 transitions. [2022-03-15 19:47:53,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 21 states have internal predecessors, (45), 0 states have call successors, (0), 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-03-15 19:47:53,554 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 176 transitions. [2022-03-15 19:47:53,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:47:53,555 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:47:53,555 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:47:53,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-03-15 19:47:53,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-03-15 19:47:53,774 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:47:53,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:47:53,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1407684027, now seen corresponding path program 3 times [2022-03-15 19:47:53,775 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:47:53,775 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136221122] [2022-03-15 19:47:53,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:47:53,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:47:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:47:54,877 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:54,878 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:47:54,878 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136221122] [2022-03-15 19:47:54,878 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136221122] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:47:54,878 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498240167] [2022-03-15 19:47:54,878 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:47:54,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:47:54,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:47:54,879 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-03-15 19:47:54,880 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-03-15 19:47:54,951 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:47:54,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:47:54,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 59 conjunts are in the unsatisfiable core [2022-03-15 19:47:54,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:47:54,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:47:54,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:47:54,988 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-15 19:47:54,989 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2022-03-15 19:47:55,043 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 19:47:55,116 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-15 19:47:55,116 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-15 19:47:55,194 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:47:55,237 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:47:55,273 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:47:55,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:47:55,409 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-03-15 19:47:55,590 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:47:55,591 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 40 [2022-03-15 19:47:55,708 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:47:55,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:47:58,332 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:47:58,333 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 199 treesize of output 139 [2022-03-15 19:47:58,376 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:47:58,376 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2290 treesize of output 2278 [2022-03-15 19:47:58,422 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:47:58,422 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2170 treesize of output 2176 [2022-03-15 19:47:58,480 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:47:58,481 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2080 treesize of output 1996 [2022-03-15 19:47:58,522 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:47:58,523 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1854 treesize of output 1566 [2022-03-15 19:48:32,038 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 2 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:48:32,039 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498240167] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:48:32,039 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:48:32,039 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 36 [2022-03-15 19:48:32,039 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2069736339] [2022-03-15 19:48:32,039 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:48:32,041 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:48:32,047 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 58 transitions. [2022-03-15 19:48:32,047 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:48:33,098 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [2324#(and (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (= ~q1_front~0 0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (<= (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0))), 2321#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (not (<= (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) ~i~0)))), 2265#(or (< ~j~0 ~N~0) (and (< ~i~0 (+ ~j~0 1)) (<= ~j~0 ~i~0))), 2319#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (not (<= (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) ~i~0)))), 2320#(and (or (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)) (or (<= ~j~0 ~i~0) (< ~i~0 ~N~0))), 2318#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 2323#(and (or (<= ~q1_back~0 ~q1_front~0) (< (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~j~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= ~j~0 (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), 2322#(and (or (<= ~n2~0 ~q2_front~0) (= ~q1~0.offset 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (= ~q1_front~0 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= ~n2~0 ~q2_front~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)))] [2022-03-15 19:48:33,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 19:48:33,098 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:48:33,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 19:48:33,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1779, Unknown=9, NotChecked=0, Total=1980 [2022-03-15 19:48:33,099 INFO L87 Difference]: Start difference. First operand 82 states and 176 transitions. Second operand has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 0 states have call successors, (0), 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-03-15 19:48:35,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:48:35,379 INFO L93 Difference]: Finished difference Result 205 states and 451 transitions. [2022-03-15 19:48:35,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 19:48:35,380 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 19:48:35,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:48:35,380 INFO L225 Difference]: With dead ends: 205 [2022-03-15 19:48:35,381 INFO L226 Difference]: Without dead ends: 200 [2022-03-15 19:48:35,382 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 867 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=470, Invalid=3943, Unknown=9, NotChecked=0, Total=4422 [2022-03-15 19:48:35,382 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 149 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:48:35,382 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 0 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:48:35,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-03-15 19:48:35,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 88. [2022-03-15 19:48:35,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 2.160919540229885) internal successors, (188), 87 states have internal predecessors, (188), 0 states have call successors, (0), 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-03-15 19:48:35,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 188 transitions. [2022-03-15 19:48:35,385 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 188 transitions. Word has length 20 [2022-03-15 19:48:35,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:48:35,385 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 188 transitions. [2022-03-15 19:48:35,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 0 states have call successors, (0), 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-03-15 19:48:35,385 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 188 transitions. [2022-03-15 19:48:35,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:48:35,386 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:48:35,386 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:48:35,404 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-03-15 19:48:35,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:48:35,596 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:48:35,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:48:35,596 INFO L85 PathProgramCache]: Analyzing trace with hash -112880217, now seen corresponding path program 4 times [2022-03-15 19:48:35,597 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:48:35,598 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781759967] [2022-03-15 19:48:35,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:48:35,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:48:35,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:48:35,637 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 19:48:35,637 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:48:35,637 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781759967] [2022-03-15 19:48:35,637 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781759967] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:48:35,637 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:48:35,637 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 19:48:35,638 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1019450367] [2022-03-15 19:48:35,638 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:48:35,640 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:48:35,645 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 51 transitions. [2022-03-15 19:48:35,645 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:48:35,718 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [2754#(< ~q2_back~0 0), 2753#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))] [2022-03-15 19:48:35,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 19:48:35,718 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:48:35,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 19:48:35,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 19:48:35,719 INFO L87 Difference]: Start difference. First operand 88 states and 188 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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-03-15 19:48:35,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:48:35,748 INFO L93 Difference]: Finished difference Result 82 states and 167 transitions. [2022-03-15 19:48:35,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 19:48:35,749 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 19:48:35,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:48:35,750 INFO L225 Difference]: With dead ends: 82 [2022-03-15 19:48:35,750 INFO L226 Difference]: Without dead ends: 82 [2022-03-15 19:48:35,750 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 19:48:35,750 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 8 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:48:35,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 0 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:48:35,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-03-15 19:48:35,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-03-15 19:48:35,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 2.0617283950617282) internal successors, (167), 81 states have internal predecessors, (167), 0 states have call successors, (0), 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-03-15 19:48:35,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 167 transitions. [2022-03-15 19:48:35,754 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 167 transitions. Word has length 20 [2022-03-15 19:48:35,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:48:35,755 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 167 transitions. [2022-03-15 19:48:35,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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-03-15 19:48:35,755 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 167 transitions. [2022-03-15 19:48:35,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:48:35,755 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:48:35,756 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:48:35,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-15 19:48:35,756 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:48:35,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:48:35,756 INFO L85 PathProgramCache]: Analyzing trace with hash -666222521, now seen corresponding path program 5 times [2022-03-15 19:48:35,757 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:48:35,757 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059975207] [2022-03-15 19:48:35,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:48:35,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:48:35,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:48:36,552 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:36,552 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:48:36,553 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059975207] [2022-03-15 19:48:36,553 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059975207] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:48:36,553 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376377813] [2022-03-15 19:48:36,553 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:48:36,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:48:36,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:48:36,554 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-03-15 19:48:36,555 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-03-15 19:48:36,634 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:48:36,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:48:36,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-15 19:48:36,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:48:37,031 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:48:37,043 INFO L353 Elim1Store]: treesize reduction 18, result has 55.0 percent of original size [2022-03-15 19:48:37,043 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 54 treesize of output 41 [2022-03-15 19:48:37,149 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:48:37,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:48:37,525 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:48:37,525 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 138 [2022-03-15 19:48:37,903 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:48:37,904 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376377813] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:48:37,904 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:48:37,904 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 31 [2022-03-15 19:48:37,904 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [460789451] [2022-03-15 19:48:37,904 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:48:37,906 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:48:37,913 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 67 transitions. [2022-03-15 19:48:37,913 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:48:39,692 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [3150#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3153#(and (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (= ~q2~0.offset 0) (< ~q1_back~0 0)) (or (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (= ~q1_front~0 0) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= 1 ~N~0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0))), 3149#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3152#(and (or (<= ~q1_back~0 ~q1_front~0) (< (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~j~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= ~j~0 (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), 3154#(and (or (= ~i~0 0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (= (+ (* 4 ~q2_front~0) ~q2~0.offset) (+ ~q2~0.offset (* ~q2_back~0 4))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= 1 ~N~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (<= ~q2_front~0 0)) (or (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (<= (+ ~q2~0.offset (* ~q2_back~0 4) 1) 0) (< ~q1_back~0 0) (not (<= ~q2_front~0 0))) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (= ~q2~0.offset 0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (= ~q1_front~0 0) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (<= (+ ~q2~0.offset (* ~q2_back~0 4) 1) 0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (= (+ (* 4 ~q2_front~0) ~q2~0.offset) (+ ~q2~0.offset (* ~q2_back~0 4))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (<= ~q2_front~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= 1 ~N~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (<= (+ ~q2~0.offset (* ~q2_back~0 4) 1) 0) (< ~q1_back~0 0) (not (<= ~q2_front~0 0))) (or (= (+ (* 4 ~q2_front~0) ~q2~0.offset) (+ ~q2~0.offset (* ~q2_back~0 4))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (<= ~q2_front~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (<= ~q2_front~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (<= ~q2_front~0 0))), 3151#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3098#(or (< ~j~0 ~N~0) (and (< ~i~0 (+ ~j~0 1)) (<= ~j~0 ~i~0))), 3148#(and (or (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)) (or (<= ~j~0 ~i~0) (< ~i~0 ~N~0)))] [2022-03-15 19:48:39,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 19:48:39,692 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:48:39,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 19:48:39,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1365, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 19:48:39,693 INFO L87 Difference]: Start difference. First operand 82 states and 167 transitions. Second operand has 23 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 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-03-15 19:48:41,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:48:41,944 INFO L93 Difference]: Finished difference Result 190 states and 408 transitions. [2022-03-15 19:48:41,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 19:48:41,944 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 19:48:41,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:48:41,946 INFO L225 Difference]: With dead ends: 190 [2022-03-15 19:48:41,946 INFO L226 Difference]: Without dead ends: 185 [2022-03-15 19:48:41,947 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 796 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=550, Invalid=3482, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 19:48:41,947 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 107 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:48:41,947 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 0 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:48:41,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-03-15 19:48:41,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 77. [2022-03-15 19:48:41,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 2.0657894736842106) internal successors, (157), 76 states have internal predecessors, (157), 0 states have call successors, (0), 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-03-15 19:48:41,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 157 transitions. [2022-03-15 19:48:41,951 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 157 transitions. Word has length 20 [2022-03-15 19:48:41,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:48:41,951 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 157 transitions. [2022-03-15 19:48:41,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 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-03-15 19:48:41,951 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 157 transitions. [2022-03-15 19:48:41,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:48:41,951 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:48:41,951 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:48:41,967 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-03-15 19:48:42,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:48:42,163 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:48:42,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:48:42,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1793053047, now seen corresponding path program 6 times [2022-03-15 19:48:42,164 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:48:42,165 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262994383] [2022-03-15 19:48:42,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:48:42,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:48:42,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:48:43,085 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:43,085 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:48:43,085 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262994383] [2022-03-15 19:48:43,085 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262994383] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:48:43,085 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787128770] [2022-03-15 19:48:43,085 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:48:43,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:48:43,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:48:43,086 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-03-15 19:48:43,087 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-03-15 19:48:43,158 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-03-15 19:48:43,158 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:48:43,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-15 19:48:43,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:48:43,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:48:43,353 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-03-15 19:48:43,487 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:48:43,487 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 40 [2022-03-15 19:48:43,592 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:48:43,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:48:43,959 WARN L838 $PredicateComparison]: unable to prove that (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_330 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_330))) (let ((.cse3 (select .cse2 ~q1~0.base))) (or (let ((.cse0 (select .cse3 (+ (* c_~q1_front~0 4) ~q1~0.offset))) (.cse1 (+ (select (select .cse2 c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) 1))) (and (or (< .cse0 c_~N~0) (< .cse1 c_~N~0)) (or (< (+ .cse0 1) c_~N~0) (<= .cse1 c_~N~0)))) (not (= c_~j~0 (select .cse3 (+ (* c_~q1_back~0 4) ~q1~0.offset)))))))) is different from false [2022-03-15 19:48:43,995 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:48:43,996 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 176 treesize of output 236 [2022-03-15 19:48:44,014 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:48:44,015 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 124 treesize of output 142 [2022-03-15 19:48:46,973 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:48:46,973 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787128770] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:48:46,973 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:48:46,973 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 10] total 33 [2022-03-15 19:48:46,973 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [756759574] [2022-03-15 19:48:46,973 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:48:46,975 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:48:46,981 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 58 transitions. [2022-03-15 19:48:46,981 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:48:47,928 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [3700#(and (or (<= ~n2~0 ~q2_front~0) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (< 0 (+ ~q1_front~0 1))) (or (<= ~n2~0 ~q2_front~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (<= 1 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3698#(and (or (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)) (or (<= ~j~0 ~i~0) (< ~i~0 ~N~0))), 3697#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3701#(and (or (<= ~q1_back~0 ~q1_front~0) (< (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~j~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= ~j~0 (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), 3699#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3645#(or (< ~j~0 ~N~0) (and (< ~i~0 (+ ~j~0 1)) (<= ~j~0 ~i~0))), 3696#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3702#(and (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= 1 ~N~0) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (<= ~n2~0 ~q2_front~0) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0) (< 0 (+ ~q1_front~0 1))) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)))] [2022-03-15 19:48:47,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 19:48:47,928 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:48:47,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 19:48:47,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1472, Unknown=1, NotChecked=78, Total=1722 [2022-03-15 19:48:47,929 INFO L87 Difference]: Start difference. First operand 77 states and 157 transitions. Second operand has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 0 states have call successors, (0), 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-03-15 19:48:50,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:48:50,416 INFO L93 Difference]: Finished difference Result 246 states and 527 transitions. [2022-03-15 19:48:50,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 19:48:50,416 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 19:48:50,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:48:50,417 INFO L225 Difference]: With dead ends: 246 [2022-03-15 19:48:50,417 INFO L226 Difference]: Without dead ends: 236 [2022-03-15 19:48:50,418 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=549, Invalid=4010, Unknown=1, NotChecked=132, Total=4692 [2022-03-15 19:48:50,418 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 99 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:48:50,419 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 0 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:48:50,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-03-15 19:48:50,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 98. [2022-03-15 19:48:50,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 2.0721649484536084) internal successors, (201), 97 states have internal predecessors, (201), 0 states have call successors, (0), 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-03-15 19:48:50,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 201 transitions. [2022-03-15 19:48:50,421 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 201 transitions. Word has length 20 [2022-03-15 19:48:50,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:48:50,421 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 201 transitions. [2022-03-15 19:48:50,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 0 states have call successors, (0), 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-03-15 19:48:50,422 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 201 transitions. [2022-03-15 19:48:50,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:48:50,422 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:48:50,422 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:48:50,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-03-15 19:48:50,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-03-15 19:48:50,638 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:48:50,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:48:50,638 INFO L85 PathProgramCache]: Analyzing trace with hash -879797069, now seen corresponding path program 7 times [2022-03-15 19:48:50,639 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:48:50,639 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403143131] [2022-03-15 19:48:50,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:48:50,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:48:50,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:48:51,620 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:51,620 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:48:51,620 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403143131] [2022-03-15 19:48:51,620 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403143131] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:48:51,620 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798752974] [2022-03-15 19:48:51,620 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:48:51,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:48:51,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:48:51,621 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-03-15 19:48:51,622 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-03-15 19:48:51,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:48:51,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 53 conjunts are in the unsatisfiable core [2022-03-15 19:48:51,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:48:51,821 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 19:48:51,882 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:48:51,924 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:48:52,109 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:48:52,109 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 40 [2022-03-15 19:48:52,218 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:48:52,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:48:53,011 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:48:53,012 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 184 treesize of output 124 [2022-03-15 19:48:53,042 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:48:53,042 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 432 treesize of output 492 [2022-03-15 19:48:53,075 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:48:53,075 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 384 treesize of output 408 [2022-03-15 19:48:53,110 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:48:53,110 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 312 treesize of output 372 [2022-03-15 19:50:23,066 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:50:23,066 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798752974] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:50:23,067 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:50:23,067 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 35 [2022-03-15 19:50:23,067 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1255056748] [2022-03-15 19:50:23,067 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:50:23,069 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:50:23,089 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 67 transitions. [2022-03-15 19:50:23,089 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:50:25,033 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [4360#(and (or (<= ~q1_back~0 ~q1_front~0) (< (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~j~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= ~j~0 (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), 4358#(and (or (= ~q1~0.offset 0) (<= ~n2~0 ~q2_back~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) ~i~0)) (<= ~N~0 ~i~0) (< ~q2_back~0 0)) (or (<= (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (= (+ (* (- 1) ~q1_back~0) ~q1_front~0) 0) (<= ~n2~0 ~q2_back~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) ~i~0)) (<= ~N~0 ~i~0) (< ~q2_back~0 0)) (or (<= (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= ~n2~0 ~q2_back~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) ~i~0)) (<= ~N~0 ~i~0) (<= ~n1~0 2) (< ~q2_back~0 0) (<= ~q1_front~0 1)) (or (<= ~n2~0 ~q2_back~0) (not (= ~q1_front~0 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) ~i~0)) (not (= ~j~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~N~0 ~i~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_back~0 0)) (or (= (+ (* (- 1) ~q1_back~0) ~q1_front~0) 0) (<= ~n2~0 ~q2_back~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) ~i~0)) (<= ~N~0 ~i~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_back~0 0)) (or (<= ~n2~0 ~q2_back~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) ~i~0)) (= ~q2~0.offset 0) (<= ~N~0 ~i~0) (< ~q2_back~0 0)) (or (<= (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= ~n2~0 ~q2_back~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) ~i~0)) (not (= ~q1_front~0 1)) (not (= ~j~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~N~0 ~i~0) (< ~q2_back~0 0)) (or (<= ~n2~0 ~q2_back~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) ~i~0)) (not (= ~q1_front~0 1)) (not (= ~j~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~N~0 ~i~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_back~0 0)) (or (<= ~n2~0 ~q2_back~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) ~i~0)) (<= ~N~0 ~i~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (<= ~n1~0 2) (< ~q2_back~0 0) (<= ~q1_front~0 1)) (or (<= (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= ~n2~0 ~q2_back~0) (not (= ~q1_front~0 0)) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) ~i~0)) (not (= ~j~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (<= ~N~0 ~i~0) (< ~q2_back~0 0))), 4359#(and (or (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)) (or (<= ~j~0 ~i~0) (< ~i~0 ~N~0))), 4298#(or (< ~j~0 ~N~0) (and (< ~i~0 (+ ~j~0 1)) (<= ~j~0 ~i~0))), 4352#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 4355#(and (or (= ~q1~0.offset 0) (<= ~n2~0 ~q2_back~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) ~i~0)) (<= ~N~0 ~i~0) (< ~q2_back~0 0)) (or (<= ~n2~0 ~q2_back~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) ~i~0)) (= ~q2~0.offset 0) (<= ~N~0 ~i~0) (< ~q2_back~0 0)) (or (<= (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= ~n2~0 ~q2_back~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) ~i~0)) (<= ~N~0 ~i~0) (< ~q2_back~0 0)) (or (<= ~n2~0 ~q2_back~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) ~i~0)) (<= ~N~0 ~i~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_back~0 0))), 4350#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 4351#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 4356#(and (or (<= (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0))), 4354#(and (or (<= (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= (+ ~q2_back~0 1) ~q2_front~0) (<= ~n2~0 ~q2_back~0) (< ~q2_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) ~i~0)) (<= ~N~0 ~i~0)) (or (<= (+ ~q2_back~0 1) ~q2_front~0) (<= ~n2~0 ~q2_back~0) (< ~q2_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) ~i~0)) (<= ~N~0 ~i~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= (+ ~q2_back~0 1) ~q2_front~0) (= ~q1~0.offset 0) (<= ~n2~0 ~q2_back~0) (< ~q2_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) ~i~0)) (<= ~N~0 ~i~0))), 4353#(and (or (<= ~n2~0 ~q2_front~0) (= ~q1~0.offset 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= ~n2~0 ~q2_front~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0))), 4357#(and (or (<= (+ ~q2_back~0 1) ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= ~q1~0.offset 0) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) ~i~0)) (<= ~N~0 ~j~0) (<= ~N~0 ~i~0) (< ~q1_back~0 0)) (or (<= (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= (+ ~q2_back~0 1) ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) ~i~0)) (<= ~N~0 ~j~0) (<= ~N~0 ~i~0) (< ~q1_back~0 0)) (or (<= (+ ~q2_back~0 1) ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n2~0 ~q2_back~0) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) ~i~0)) (<= ~N~0 ~j~0) (<= ~N~0 ~i~0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)))] [2022-03-15 19:50:25,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 19:50:25,033 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:50:25,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 19:50:25,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=2000, Unknown=5, NotChecked=0, Total=2256 [2022-03-15 19:50:25,034 INFO L87 Difference]: Start difference. First operand 98 states and 201 transitions. Second operand has 27 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 26 states have internal predecessors, (55), 0 states have call successors, (0), 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-03-15 19:50:28,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:50:28,503 INFO L93 Difference]: Finished difference Result 266 states and 558 transitions. [2022-03-15 19:50:28,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-15 19:50:28,503 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 26 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 19:50:28,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:50:28,504 INFO L225 Difference]: With dead ends: 266 [2022-03-15 19:50:28,505 INFO L226 Difference]: Without dead ends: 261 [2022-03-15 19:50:28,506 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1325 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=762, Invalid=5395, Unknown=5, NotChecked=0, Total=6162 [2022-03-15 19:50:28,506 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 167 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:50:28,506 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 0 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:50:28,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-03-15 19:50:28,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 96. [2022-03-15 19:50:28,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 2.0842105263157893) internal successors, (198), 95 states have internal predecessors, (198), 0 states have call successors, (0), 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-03-15 19:50:28,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 198 transitions. [2022-03-15 19:50:28,514 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 198 transitions. Word has length 20 [2022-03-15 19:50:28,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:50:28,514 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 198 transitions. [2022-03-15 19:50:28,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 26 states have internal predecessors, (55), 0 states have call successors, (0), 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-03-15 19:50:28,514 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 198 transitions. [2022-03-15 19:50:28,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:50:28,515 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:50:28,515 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:50:28,531 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-03-15 19:50:28,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:50:28,724 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:50:28,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:50:28,724 INFO L85 PathProgramCache]: Analyzing trace with hash -2050295721, now seen corresponding path program 8 times [2022-03-15 19:50:28,725 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:50:28,725 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905961199] [2022-03-15 19:50:28,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:50:28,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:50:28,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:50:28,771 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:50:28,771 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:50:28,771 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905961199] [2022-03-15 19:50:28,771 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905961199] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:50:28,771 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738042149] [2022-03-15 19:50:28,772 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:50:28,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:50:28,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:50:28,776 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-03-15 19:50:28,776 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-03-15 19:50:28,856 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:50:28,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:50:28,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:50:28,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:50:28,924 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:50:28,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:50:28,986 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:50:28,987 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738042149] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:50:28,987 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:50:28,987 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-03-15 19:50:28,987 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1494821150] [2022-03-15 19:50:28,987 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:50:28,989 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:50:28,995 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 64 transitions. [2022-03-15 19:50:28,996 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:50:29,159 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [4974#(or (not (<= 0 ~q2_back~0)) (not (< ~q2_back~0 ~n2~0))), 5013#(or (<= ~q2_back~0 0) (<= ~n2~0 ~q2_back~0))] [2022-03-15 19:50:29,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 19:50:29,160 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:50:29,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 19:50:29,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-03-15 19:50:29,160 INFO L87 Difference]: Start difference. First operand 96 states and 198 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 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-03-15 19:50:29,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:50:29,234 INFO L93 Difference]: Finished difference Result 162 states and 325 transitions. [2022-03-15 19:50:29,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 19:50:29,234 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:50:29,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:50:29,235 INFO L225 Difference]: With dead ends: 162 [2022-03-15 19:50:29,235 INFO L226 Difference]: Without dead ends: 158 [2022-03-15 19:50:29,235 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-03-15 19:50:29,236 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 44 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:50:29,236 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 0 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:50:29,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-03-15 19:50:29,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 136. [2022-03-15 19:50:29,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 2.0444444444444443) internal successors, (276), 135 states have internal predecessors, (276), 0 states have call successors, (0), 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-03-15 19:50:29,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 276 transitions. [2022-03-15 19:50:29,238 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 276 transitions. Word has length 21 [2022-03-15 19:50:29,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:50:29,238 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 276 transitions. [2022-03-15 19:50:29,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 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-03-15 19:50:29,239 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 276 transitions. [2022-03-15 19:50:29,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:50:29,239 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:50:29,239 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:50:29,255 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-03-15 19:50:29,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:50:29,450 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:50:29,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:50:29,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1507614177, now seen corresponding path program 9 times [2022-03-15 19:50:29,451 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:50:29,451 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870198511] [2022-03-15 19:50:29,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:50:29,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:50:29,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:50:29,506 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:50:29,506 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:50:29,506 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870198511] [2022-03-15 19:50:29,507 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870198511] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:50:29,507 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808468395] [2022-03-15 19:50:29,507 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:50:29,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:50:29,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:50:29,512 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-03-15 19:50:29,513 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-03-15 19:50:29,594 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:50:29,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:50:29,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:50:29,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:50:29,662 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:50:29,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:50:29,720 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:50:29,720 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808468395] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:50:29,720 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:50:29,720 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-03-15 19:50:29,720 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1211611079] [2022-03-15 19:50:29,720 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:50:29,722 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:50:29,729 INFO L252 McrAutomatonBuilder]: Finished intersection with 47 states and 76 transitions. [2022-03-15 19:50:29,730 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:50:30,060 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [5545#(or (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_back~0))), 5584#(or (<= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0)), 5585#(or (<= ~n1~0 ~q1_back~0) (<= ~q1_back~0 0))] [2022-03-15 19:50:30,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 19:50:30,060 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:50:30,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 19:50:30,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-03-15 19:50:30,060 INFO L87 Difference]: Start difference. First operand 136 states and 276 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 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-03-15 19:50:30,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:50:30,125 INFO L93 Difference]: Finished difference Result 214 states and 405 transitions. [2022-03-15 19:50:30,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 19:50:30,125 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:50:30,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:50:30,125 INFO L225 Difference]: With dead ends: 214 [2022-03-15 19:50:30,126 INFO L226 Difference]: Without dead ends: 174 [2022-03-15 19:50:30,126 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 50 SyntacticMatches, 8 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2022-03-15 19:50:30,126 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 38 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:50:30,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 0 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:50:30,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-03-15 19:50:30,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 164. [2022-03-15 19:50:30,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 1.9938650306748467) internal successors, (325), 163 states have internal predecessors, (325), 0 states have call successors, (0), 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-03-15 19:50:30,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 325 transitions. [2022-03-15 19:50:30,129 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 325 transitions. Word has length 21 [2022-03-15 19:50:30,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:50:30,129 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 325 transitions. [2022-03-15 19:50:30,129 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 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-03-15 19:50:30,129 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 325 transitions. [2022-03-15 19:50:30,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:50:30,130 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:50:30,130 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:50:30,146 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-03-15 19:50:30,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-15 19:50:30,336 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:50:30,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:50:30,336 INFO L85 PathProgramCache]: Analyzing trace with hash -2098148602, now seen corresponding path program 10 times [2022-03-15 19:50:30,337 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:50:30,337 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952713533] [2022-03-15 19:50:30,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:50:30,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:50:30,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:50:31,395 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:50:31,395 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:50:31,395 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952713533] [2022-03-15 19:50:31,395 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952713533] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:50:31,395 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123770678] [2022-03-15 19:50:31,395 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:50:31,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:50:31,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:50:31,397 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-03-15 19:50:31,397 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-03-15 19:50:31,480 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:50:31,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:50:31,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 58 conjunts are in the unsatisfiable core [2022-03-15 19:50:31,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:50:31,514 INFO L353 Elim1Store]: treesize reduction 37, result has 32.7 percent of original size [2022-03-15 19:50:31,514 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 23 [2022-03-15 19:50:31,608 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-15 19:50:31,609 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-15 19:50:31,834 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-03-15 19:50:32,006 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:50:32,006 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 38 [2022-03-15 19:50:32,127 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:50:32,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:50:32,538 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:50:32,538 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 176 treesize of output 236 [2022-03-15 19:50:32,570 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:50:32,570 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 124 treesize of output 142 [2022-03-15 19:50:38,300 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:50:38,300 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123770678] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:50:38,300 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:50:38,301 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 11] total 37 [2022-03-15 19:50:38,301 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1486451504] [2022-03-15 19:50:38,301 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:50:38,303 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:50:38,309 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 59 transitions. [2022-03-15 19:50:38,309 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:50:39,504 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [6289#(and (or (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)) (or (<= ~j~0 ~i~0) (< ~i~0 ~N~0))), 6293#(and (or (<= ~n2~0 ~q2_front~0) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (= ~q1~0.offset 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (<= 1 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~q2_front~0 0) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 6295#(and (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= 1 ~N~0) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (<= ~n2~0 ~q2_front~0) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (<= ~n2~0 ~q2_front~0) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0))), 6294#(and (or (<= ~q1_back~0 ~q1_front~0) (< (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~j~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= ~j~0 (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), 6291#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 6292#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 6234#(or (< ~j~0 ~N~0) (and (< ~i~0 (+ ~j~0 1)) (<= ~j~0 ~i~0))), 6290#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)))] [2022-03-15 19:50:39,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 19:50:39,505 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:50:39,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 19:50:39,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1876, Unknown=1, NotChecked=0, Total=2070 [2022-03-15 19:50:39,506 INFO L87 Difference]: Start difference. First operand 164 states and 325 transitions. Second operand has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:50:42,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:50:42,097 INFO L93 Difference]: Finished difference Result 283 states and 569 transitions. [2022-03-15 19:50:42,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 19:50:42,097 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:50:42,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:50:42,098 INFO L225 Difference]: With dead ends: 283 [2022-03-15 19:50:42,098 INFO L226 Difference]: Without dead ends: 270 [2022-03-15 19:50:42,099 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 856 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=487, Invalid=4068, Unknown=1, NotChecked=0, Total=4556 [2022-03-15 19:50:42,099 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 100 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:50:42,100 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 0 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:50:42,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-03-15 19:50:42,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 170. [2022-03-15 19:50:42,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.9940828402366864) internal successors, (337), 169 states have internal predecessors, (337), 0 states have call successors, (0), 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-03-15 19:50:42,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 337 transitions. [2022-03-15 19:50:42,103 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 337 transitions. Word has length 21 [2022-03-15 19:50:42,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:50:42,103 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 337 transitions. [2022-03-15 19:50:42,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:50:42,103 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 337 transitions. [2022-03-15 19:50:42,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:50:42,104 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:50:42,104 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:50:42,126 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-03-15 19:50:42,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-15 19:50:42,304 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:50:42,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:50:42,305 INFO L85 PathProgramCache]: Analyzing trace with hash 122912146, now seen corresponding path program 11 times [2022-03-15 19:50:42,305 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:50:42,306 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345783032] [2022-03-15 19:50:42,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:50:42,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:50:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:50:43,445 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:50:43,445 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:50:43,446 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345783032] [2022-03-15 19:50:43,446 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345783032] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:50:43,446 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010934834] [2022-03-15 19:50:43,446 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:50:43,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:50:43,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:50:43,447 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-03-15 19:50:43,448 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-03-15 19:50:43,538 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:50:43,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:50:43,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-15 19:50:43,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:50:43,931 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:50:43,943 INFO L353 Elim1Store]: treesize reduction 18, result has 55.0 percent of original size [2022-03-15 19:50:43,944 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 56 treesize of output 41 [2022-03-15 19:50:44,051 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:50:44,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:50:44,636 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:50:44,637 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 136 [2022-03-15 19:50:44,924 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:50:44,924 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010934834] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:50:44,924 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:50:44,925 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 9] total 33 [2022-03-15 19:50:44,925 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1182803879] [2022-03-15 19:50:44,925 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:50:44,927 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:50:44,933 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 68 transitions. [2022-03-15 19:50:44,933 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:50:47,443 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [7124#(and (or (= ~i~0 0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= ~q2_front~0 1)) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (<= (+ ~q2~0.offset (* ~q2_back~0 4) 1) 0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= 1 ~N~0) (< 1 ~q2_front~0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (<= (+ ~q2~0.offset (* ~q2_back~0 4) 1) 0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= ~q2_front~0 1)) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (<= (+ ~q2~0.offset (* ~q2_back~0 4) 1) 0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (= ~q2~0.offset 0) (< ~q1_back~0 0)) (or (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (not (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 3)) (<= ~N~0 ~j~0) (<= (+ ~q2~0.offset (* ~q2_back~0 4) 1) 0) (< ~q1_back~0 0) (<= ~q2_front~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (< 1 ~q2_front~0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (<= (+ ~q2~0.offset (* ~q2_back~0 4) 1) 0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (not (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 3)) (<= ~N~0 ~j~0) (<= (+ ~q2~0.offset (* ~q2_back~0 4) 1) 0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (<= ~q2_front~0 0)) (or (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (= ~q1_front~0 0) (<= ~N~0 ~j~0) (<= (+ ~q2~0.offset (* ~q2_back~0 4) 1) 0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (not (<= (+ (* 4 ~q2_front~0) ~q2~0.offset 1) 0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (< 1 ~q2_front~0) (<= ~n1~0 ~q1_back~0) (= ~q1_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= 1 ~N~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (<= (+ ~q2~0.offset (* ~q2_back~0 4) 1) 0) (< ~q1_back~0 0)) (or (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (<= (+ ~q2~0.offset (* ~q2_back~0 4) 1) 0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (<= (+ ~q2~0.offset (* ~q2_back~0 4) 1) 0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (<= ~q2_front~0 1)) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (= ~q1_front~0 0) (<= ~N~0 ~j~0) (<= (+ ~q2~0.offset (* ~q2_back~0 4) 1) 0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (= ~q1_front~0 0) (not (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 3)) (<= ~N~0 ~j~0) (<= (+ ~q2~0.offset (* ~q2_back~0 4) 1) 0) (< ~q1_back~0 0) (<= ~q2_front~0 0)) (or (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (< 1 ~q2_front~0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= 1 ~N~0) (<= ~n1~0 ~q1_back~0) (not (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 3)) (<= ~N~0 ~j~0) (<= (+ ~q2~0.offset (* ~q2_back~0 4) 1) 0) (< ~q1_back~0 0) (<= ~q2_front~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (= ~q1_front~0 0) (<= ~N~0 ~j~0) (<= (+ ~q2~0.offset (* ~q2_back~0 4) 1) 0) (< ~q1_back~0 0))), 7122#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 7121#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 7123#(and (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (= ~q2~0.offset 0) (< ~q1_back~0 0)) (or (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (= ~q1_front~0 0) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= 1 ~N~0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= 0 ~q2_front~0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0))), 7119#(and (or (<= ~q1_back~0 ~q1_front~0) (< (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~j~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= ~j~0 (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), 7065#(or (< ~j~0 ~N~0) (and (< ~i~0 (+ ~j~0 1)) (<= ~j~0 ~i~0))), 7120#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 7118#(and (or (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)) (or (<= ~j~0 ~i~0) (< ~i~0 ~N~0)))] [2022-03-15 19:50:47,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 19:50:47,443 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:50:47,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 19:50:47,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1564, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 19:50:47,445 INFO L87 Difference]: Start difference. First operand 170 states and 337 transitions. Second operand has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 0 states have call successors, (0), 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-03-15 19:50:50,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:50:50,285 INFO L93 Difference]: Finished difference Result 272 states and 544 transitions. [2022-03-15 19:50:50,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 19:50:50,286 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:50:50,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:50:50,287 INFO L225 Difference]: With dead ends: 272 [2022-03-15 19:50:50,287 INFO L226 Difference]: Without dead ends: 259 [2022-03-15 19:50:50,288 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=462, Invalid=3698, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 19:50:50,288 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 119 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:50:50,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 0 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:50:50,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-03-15 19:50:50,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 165. [2022-03-15 19:50:50,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.9939024390243902) internal successors, (327), 164 states have internal predecessors, (327), 0 states have call successors, (0), 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-03-15 19:50:50,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 327 transitions. [2022-03-15 19:50:50,293 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 327 transitions. Word has length 21 [2022-03-15 19:50:50,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:50:50,293 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 327 transitions. [2022-03-15 19:50:50,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 23 states have internal predecessors, (51), 0 states have call successors, (0), 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-03-15 19:50:50,294 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 327 transitions. [2022-03-15 19:50:50,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:50:50,294 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:50:50,294 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:50:50,310 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-03-15 19:50:50,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-15 19:50:50,501 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:50:50,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:50:50,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1758217208, now seen corresponding path program 12 times [2022-03-15 19:50:50,502 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:50:50,502 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536774158] [2022-03-15 19:50:50,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:50:50,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:50:50,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:50:51,986 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:50:51,987 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:50:51,987 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536774158] [2022-03-15 19:50:51,987 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536774158] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:50:51,987 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262589741] [2022-03-15 19:50:51,987 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:50:51,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:50:51,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:50:51,988 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-03-15 19:50:51,988 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-03-15 19:50:52,069 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-03-15 19:50:52,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:50:52,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 43 conjunts are in the unsatisfiable core [2022-03-15 19:50:52,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:50:52,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:50:52,296 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-03-15 19:50:52,423 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:50:52,423 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 40 [2022-03-15 19:50:52,529 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:50:52,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:50:52,828 WARN L838 $PredicateComparison]: unable to prove that (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_595 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_595))) (let ((.cse0 (select .cse3 ~q1~0.base))) (or (not (= c_~j~0 (select .cse0 (+ (* c_~q1_back~0 4) ~q1~0.offset)))) (let ((.cse2 (+ (select (select .cse3 c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) 1)) (.cse1 (select .cse0 (+ (* c_~q1_front~0 4) ~q1~0.offset)))) (and (or (< .cse1 c_~N~0) (< .cse2 c_~N~0)) (or (<= .cse2 c_~N~0) (< (+ .cse1 1) c_~N~0)))))))) is different from false [2022-03-15 19:50:52,863 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:50:52,863 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 176 treesize of output 236 [2022-03-15 19:50:52,880 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:50:52,880 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 124 treesize of output 142 [2022-03-15 19:50:56,107 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:50:56,107 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262589741] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:50:56,107 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:50:56,107 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 10] total 35 [2022-03-15 19:50:56,107 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [264191364] [2022-03-15 19:50:56,107 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:50:56,109 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:50:56,115 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 59 transitions. [2022-03-15 19:50:56,115 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:50:57,155 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [7935#(and (or (<= ~q1_back~0 ~q1_front~0) (< (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~j~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= ~j~0 (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), 7876#(or (< ~j~0 ~N~0) (and (< ~i~0 (+ ~j~0 1)) (<= ~j~0 ~i~0))), 7932#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (not (<= (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) ~i~0)))), 7936#(and (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= 1 ~N~0) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (<= ~n2~0 ~q2_front~0) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0) (<= ~q1_front~0 1)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0))), 7933#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (not (<= (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) ~i~0)))), 7934#(and (or (<= ~n2~0 ~q2_front~0) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (= ~q1~0.offset 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= ~q1_front~0 1)) (or (<= ~n2~0 ~q2_front~0) (<= 1 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 7931#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 7930#(and (or (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)) (or (<= ~j~0 ~i~0) (< ~i~0 ~N~0)))] [2022-03-15 19:50:57,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 19:50:57,156 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:50:57,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 19:50:57,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1605, Unknown=1, NotChecked=82, Total=1892 [2022-03-15 19:50:57,156 INFO L87 Difference]: Start difference. First operand 165 states and 327 transitions. Second operand has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:50:59,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:50:59,769 INFO L93 Difference]: Finished difference Result 418 states and 888 transitions. [2022-03-15 19:50:59,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-15 19:50:59,770 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:50:59,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:50:59,771 INFO L225 Difference]: With dead ends: 418 [2022-03-15 19:50:59,771 INFO L226 Difference]: Without dead ends: 413 [2022-03-15 19:50:59,772 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1043 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=749, Invalid=4656, Unknown=1, NotChecked=144, Total=5550 [2022-03-15 19:50:59,773 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 162 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:50:59,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 0 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:50:59,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2022-03-15 19:50:59,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 185. [2022-03-15 19:50:59,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 2.0380434782608696) internal successors, (375), 184 states have internal predecessors, (375), 0 states have call successors, (0), 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-03-15 19:50:59,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 375 transitions. [2022-03-15 19:50:59,778 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 375 transitions. Word has length 21 [2022-03-15 19:50:59,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:50:59,778 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 375 transitions. [2022-03-15 19:50:59,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:50:59,779 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 375 transitions. [2022-03-15 19:50:59,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:50:59,780 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:50:59,780 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:50:59,798 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-03-15 19:50:59,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-15 19:50:59,997 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:50:59,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:50:59,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1442519866, now seen corresponding path program 13 times [2022-03-15 19:50:59,998 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:50:59,998 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292532206] [2022-03-15 19:50:59,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:50:59,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:51:00,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:51:01,121 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:51:01,121 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:51:01,121 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292532206] [2022-03-15 19:51:01,121 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292532206] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:51:01,121 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208707597] [2022-03-15 19:51:01,121 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:51:01,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:51:01,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:51:01,122 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:51:01,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-15 19:51:01,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:51:01,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-15 19:51:01,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:51:01,329 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 19:51:01,371 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:51:01,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:51:01,467 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-03-15 19:51:01,640 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:51:01,640 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 40 [2022-03-15 19:51:01,743 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:51:01,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:51:02,045 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int)) (~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_645))) (let ((.cse3 (select .cse2 ~q1~0.base))) (or (let ((.cse1 (select .cse3 (+ (* c_~q1_front~0 4) ~q1~0.offset))) (.cse0 (+ 1 (select (select .cse2 c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4)))))) (and (or (< .cse0 c_~N~0) (< .cse1 c_~N~0)) (or (< (+ .cse1 1) c_~N~0) (<= .cse0 c_~N~0)))) (not (= c_~j~0 (select .cse3 (+ (* c_~q1_back~0 4) ~q1~0.offset)))))))) is different from false [2022-03-15 19:51:02,430 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:51:02,430 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 181 treesize of output 121 [2022-03-15 19:51:02,467 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:51:02,468 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 556 treesize of output 600 [2022-03-15 19:51:02,502 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:51:02,502 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 492 treesize of output 540 [2022-03-15 19:51:02,543 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:51:02,543 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 426 treesize of output 390 [2022-03-15 19:51:16,404 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:51:16,405 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208707597] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:51:16,405 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:51:16,405 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 35 [2022-03-15 19:51:16,405 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1689509244] [2022-03-15 19:51:16,405 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:51:16,407 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:51:16,413 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 59 transitions. [2022-03-15 19:51:16,413 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:51:17,355 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [8947#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 8949#(and (or (<= ~q1_back~0 ~q1_front~0) (< (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~j~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= ~j~0 (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), 8946#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 8950#(and (or (<= (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0))), 8944#(and (or (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)) (or (<= ~j~0 ~i~0) (< ~i~0 ~N~0))), 8948#(and (or (<= ~n2~0 ~q2_front~0) (= ~q1~0.offset 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= ~n2~0 ~q2_front~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0))), 8889#(or (< ~j~0 ~N~0) (and (< ~i~0 (+ ~j~0 1)) (<= ~j~0 ~i~0))), 8945#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)))] [2022-03-15 19:51:17,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 19:51:17,356 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:51:17,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 19:51:17,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1607, Unknown=1, NotChecked=82, Total=1892 [2022-03-15 19:51:17,356 INFO L87 Difference]: Start difference. First operand 185 states and 375 transitions. Second operand has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:19,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:51:19,117 INFO L93 Difference]: Finished difference Result 303 states and 614 transitions. [2022-03-15 19:51:19,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 19:51:19,118 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:51:19,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:51:19,119 INFO L225 Difference]: With dead ends: 303 [2022-03-15 19:51:19,119 INFO L226 Difference]: Without dead ends: 292 [2022-03-15 19:51:19,120 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=635, Invalid=3924, Unknown=1, NotChecked=132, Total=4692 [2022-03-15 19:51:19,120 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 109 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:51:19,120 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 0 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:51:19,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-03-15 19:51:19,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 191. [2022-03-15 19:51:19,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 190 states have (on average 2.0210526315789474) internal successors, (384), 190 states have internal predecessors, (384), 0 states have call successors, (0), 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-03-15 19:51:19,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 384 transitions. [2022-03-15 19:51:19,124 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 384 transitions. Word has length 21 [2022-03-15 19:51:19,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:51:19,124 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 384 transitions. [2022-03-15 19:51:19,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:19,124 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 384 transitions. [2022-03-15 19:51:19,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:51:19,125 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:51:19,125 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:51:19,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 19:51:19,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:51:19,341 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:51:19,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:51:19,341 INFO L85 PathProgramCache]: Analyzing trace with hash 938042476, now seen corresponding path program 14 times [2022-03-15 19:51:19,342 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:51:19,342 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736211317] [2022-03-15 19:51:19,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:51:19,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:51:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:51:19,388 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:51:19,388 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:51:19,388 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736211317] [2022-03-15 19:51:19,388 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736211317] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:51:19,388 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660209882] [2022-03-15 19:51:19,388 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:51:19,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:51:19,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:51:19,401 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:51:19,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-15 19:51:19,511 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:51:19,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:51:19,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:51:19,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:51:19,549 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-15 19:51:19,549 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 19:51:19,550 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660209882] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:51:19,550 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 19:51:19,550 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-03-15 19:51:19,550 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1698096533] [2022-03-15 19:51:19,550 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:51:19,552 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:51:19,559 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 65 transitions. [2022-03-15 19:51:19,559 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:51:19,726 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [9757#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_back~0 0)), 9756#(or (< ~q1_front~0 0) (<= ~q1_back~0 (+ ~q1_front~0 1))), 9755#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0))] [2022-03-15 19:51:19,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 19:51:19,726 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:51:19,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 19:51:19,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2022-03-15 19:51:19,726 INFO L87 Difference]: Start difference. First operand 191 states and 384 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 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-03-15 19:51:19,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:51:19,767 INFO L93 Difference]: Finished difference Result 293 states and 605 transitions. [2022-03-15 19:51:19,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 19:51:19,767 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:51:19,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:51:19,768 INFO L225 Difference]: With dead ends: 293 [2022-03-15 19:51:19,768 INFO L226 Difference]: Without dead ends: 264 [2022-03-15 19:51:19,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2022-03-15 19:51:19,768 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 43 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:51:19,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 0 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:51:19,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-03-15 19:51:19,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 184. [2022-03-15 19:51:19,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 2.087431693989071) internal successors, (382), 183 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:19,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 382 transitions. [2022-03-15 19:51:19,772 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 382 transitions. Word has length 22 [2022-03-15 19:51:19,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:51:19,772 INFO L470 AbstractCegarLoop]: Abstraction has 184 states and 382 transitions. [2022-03-15 19:51:19,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 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-03-15 19:51:19,772 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 382 transitions. [2022-03-15 19:51:19,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:51:19,773 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:51:19,773 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:51:19,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-15 19:51:19,982 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2022-03-15 19:51:19,983 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:51:19,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:51:19,983 INFO L85 PathProgramCache]: Analyzing trace with hash 890189595, now seen corresponding path program 15 times [2022-03-15 19:51:19,984 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:51:19,984 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721709011] [2022-03-15 19:51:19,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:51:19,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:51:20,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:51:21,007 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:51:21,007 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:51:21,007 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721709011] [2022-03-15 19:51:21,007 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721709011] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:51:21,007 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531537313] [2022-03-15 19:51:21,007 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:51:21,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:51:21,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:51:21,015 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:51:21,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-15 19:51:21,123 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:51:21,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:51:21,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 43 conjunts are in the unsatisfiable core [2022-03-15 19:51:21,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:51:21,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:51:21,388 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-03-15 19:51:21,539 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:51:21,539 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 38 [2022-03-15 19:51:21,641 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:51:21,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:51:22,028 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:51:22,029 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 176 treesize of output 236 [2022-03-15 19:51:22,051 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:51:22,051 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 124 treesize of output 142 [2022-03-15 19:51:29,651 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:51:29,651 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531537313] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:51:29,651 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:51:29,652 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 34 [2022-03-15 19:51:29,652 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1575522000] [2022-03-15 19:51:29,652 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:51:29,654 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:51:29,660 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 60 transitions. [2022-03-15 19:51:29,661 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:51:30,479 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [10581#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 10582#(and (or (<= ~n2~0 ~q2_front~0) (= ~q1~0.offset 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~q2_front~0 0) (<= (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~q2_front~0 0) (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~q2_front~0 0) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 10583#(and (or (<= ~n2~0 ~q2_front~0) (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0))), 10584#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~j~0 (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~j~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0)))] [2022-03-15 19:51:30,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:51:30,480 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:51:30,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:51:30,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1398, Unknown=1, NotChecked=0, Total=1560 [2022-03-15 19:51:30,493 INFO L87 Difference]: Start difference. First operand 184 states and 382 transitions. Second operand has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 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-03-15 19:51:31,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:51:31,778 INFO L93 Difference]: Finished difference Result 227 states and 461 transitions. [2022-03-15 19:51:31,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 19:51:31,779 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:51:31,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:51:31,780 INFO L225 Difference]: With dead ends: 227 [2022-03-15 19:51:31,780 INFO L226 Difference]: Without dead ends: 198 [2022-03-15 19:51:31,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=264, Invalid=2185, Unknown=1, NotChecked=0, Total=2450 [2022-03-15 19:51:31,781 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 21 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:51:31,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 0 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:51:31,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-03-15 19:51:31,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 190. [2022-03-15 19:51:31,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 189 states have (on average 2.0634920634920637) internal successors, (390), 189 states have internal predecessors, (390), 0 states have call successors, (0), 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-03-15 19:51:31,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 390 transitions. [2022-03-15 19:51:31,785 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 390 transitions. Word has length 22 [2022-03-15 19:51:31,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:51:31,785 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 390 transitions. [2022-03-15 19:51:31,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 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-03-15 19:51:31,785 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 390 transitions. [2022-03-15 19:51:31,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:51:31,786 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:51:31,786 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:51:31,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-03-15 19:51:31,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:51:31,996 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:51:31,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:51:31,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1183716953, now seen corresponding path program 16 times [2022-03-15 19:51:31,997 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:51:31,997 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89138825] [2022-03-15 19:51:31,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:51:31,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:51:32,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:51:32,779 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:51:32,779 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:51:32,779 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89138825] [2022-03-15 19:51:32,779 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89138825] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:51:32,779 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138445502] [2022-03-15 19:51:32,779 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:51:32,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:51:32,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:51:32,780 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:51:32,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-15 19:51:32,879 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:51:32,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:51:32,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-15 19:51:32,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:51:33,196 INFO L353 Elim1Store]: treesize reduction 33, result has 42.1 percent of original size [2022-03-15 19:51:33,196 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 60 treesize of output 43 [2022-03-15 19:51:33,269 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:51:33,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:51:33,545 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:51:33,546 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 136 [2022-03-15 19:51:33,792 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-03-15 19:51:33,792 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138445502] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:51:33,792 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:51:33,792 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 6] total 29 [2022-03-15 19:51:33,792 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [789410057] [2022-03-15 19:51:33,792 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:51:33,795 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:51:33,802 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 69 transitions. [2022-03-15 19:51:33,802 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:51:35,104 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [11373#(and (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (= ~i~0 0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (<= (+ ~q2~0.offset (* ~q2_back~0 4) 1) 0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= 1 ~N~0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (= ~q2~0.offset 0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0) (<= ~q2_front~0 ~q2_back~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (<= (+ ~q2~0.offset (* ~q2_back~0 4) 1) 0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (<= (+ ~q2~0.offset (* ~q2_back~0 4) 1) 0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0))), 11370#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (not (<= (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) ~i~0)))), 11372#(and (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (= ~q2~0.offset 0) (< ~q1_back~0 0)) (or (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= 1 ~N~0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0))), 11375#(and (or (<= ~q1_back~0 ~q1_front~0) (< (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~j~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= ~j~0 (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), 11369#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 11374#(and (or (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)) (or (<= ~j~0 ~i~0) (< ~i~0 ~N~0))), 11316#(or (< ~j~0 ~N~0) (and (< ~i~0 (+ ~j~0 1)) (<= ~j~0 ~i~0))), 11371#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (not (<= (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) ~i~0))))] [2022-03-15 19:51:35,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 19:51:35,104 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:51:35,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 19:51:35,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=1155, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 19:51:35,105 INFO L87 Difference]: Start difference. First operand 190 states and 390 transitions. Second operand has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:36,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:51:36,339 INFO L93 Difference]: Finished difference Result 278 states and 560 transitions. [2022-03-15 19:51:36,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 19:51:36,339 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:51:36,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:51:36,347 INFO L225 Difference]: With dead ends: 278 [2022-03-15 19:51:36,347 INFO L226 Difference]: Without dead ends: 236 [2022-03-15 19:51:36,347 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=502, Invalid=2360, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 19:51:36,348 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 86 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:51:36,348 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 0 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:51:36,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-03-15 19:51:36,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 185. [2022-03-15 19:51:36,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 2.0815217391304346) internal successors, (383), 184 states have internal predecessors, (383), 0 states have call successors, (0), 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-03-15 19:51:36,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 383 transitions. [2022-03-15 19:51:36,351 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 383 transitions. Word has length 22 [2022-03-15 19:51:36,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:51:36,351 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 383 transitions. [2022-03-15 19:51:36,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:36,352 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 383 transitions. [2022-03-15 19:51:36,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:51:36,352 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:51:36,352 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:51:36,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-15 19:51:36,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:51:36,563 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:51:36,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:51:36,564 INFO L85 PathProgramCache]: Analyzing trace with hash -510759100, now seen corresponding path program 17 times [2022-03-15 19:51:36,565 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:51:36,565 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032154254] [2022-03-15 19:51:36,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:51:36,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:51:36,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:51:36,637 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:51:36,637 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:51:36,637 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032154254] [2022-03-15 19:51:36,638 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032154254] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:51:36,638 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379865923] [2022-03-15 19:51:36,638 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:51:36,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:51:36,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:51:36,639 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:51:36,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-15 19:51:36,742 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:51:36,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:51:36,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:51:36,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:51:36,791 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:51:36,791 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 19:51:36,791 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379865923] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:51:36,791 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 19:51:36,791 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2022-03-15 19:51:36,793 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1954734598] [2022-03-15 19:51:36,793 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:51:36,795 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:51:36,803 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 77 transitions. [2022-03-15 19:51:36,803 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:51:37,098 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [12130#(or (< ~q2_front~0 0) (<= ~q2_back~0 (+ 1 ~q2_front~0))), 12129#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))] [2022-03-15 19:51:37,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 19:51:37,098 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:51:37,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 19:51:37,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-03-15 19:51:37,099 INFO L87 Difference]: Start difference. First operand 185 states and 383 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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-03-15 19:51:37,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:51:37,144 INFO L93 Difference]: Finished difference Result 265 states and 550 transitions. [2022-03-15 19:51:37,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 19:51:37,144 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:51:37,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:51:37,145 INFO L225 Difference]: With dead ends: 265 [2022-03-15 19:51:37,145 INFO L226 Difference]: Without dead ends: 206 [2022-03-15 19:51:37,145 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-03-15 19:51:37,146 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 46 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:51:37,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 0 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:51:37,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-03-15 19:51:37,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 151. [2022-03-15 19:51:37,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 2.2666666666666666) internal successors, (340), 150 states have internal predecessors, (340), 0 states have call successors, (0), 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-03-15 19:51:37,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 340 transitions. [2022-03-15 19:51:37,148 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 340 transitions. Word has length 22 [2022-03-15 19:51:37,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:51:37,149 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 340 transitions. [2022-03-15 19:51:37,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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-03-15 19:51:37,149 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 340 transitions. [2022-03-15 19:51:37,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:51:37,149 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:51:37,149 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:51:37,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-15 19:51:37,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-03-15 19:51:37,359 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:51:37,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:51:37,360 INFO L85 PathProgramCache]: Analyzing trace with hash 178445417, now seen corresponding path program 18 times [2022-03-15 19:51:37,360 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:51:37,360 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916212896] [2022-03-15 19:51:37,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:51:37,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:51:37,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:51:39,502 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:51:39,503 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:51:39,503 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916212896] [2022-03-15 19:51:39,503 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916212896] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:51:39,503 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635653769] [2022-03-15 19:51:39,503 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:51:39,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:51:39,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:51:39,504 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:51:39,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-15 19:51:39,600 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:51:39,600 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:51:39,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-15 19:51:39,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:51:39,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:51:39,875 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-03-15 19:51:40,012 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:51:40,013 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 40 [2022-03-15 19:51:40,127 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:51:40,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:51:40,445 WARN L838 $PredicateComparison]: unable to prove that (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_881 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_881))) (let ((.cse2 (select .cse3 ~q1~0.base))) (or (let ((.cse0 (+ (select (select .cse3 c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) 1)) (.cse1 (select .cse2 (+ (* c_~q1_front~0 4) ~q1~0.offset)))) (and (or (< .cse0 c_~N~0) (< .cse1 c_~N~0)) (or (<= .cse0 c_~N~0) (< (+ .cse1 1) c_~N~0)))) (not (= (select .cse2 (+ (* c_~q1_back~0 4) ~q1~0.offset)) c_~j~0)))))) is different from false [2022-03-15 19:51:40,480 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:51:40,481 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 176 treesize of output 236 [2022-03-15 19:51:40,499 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:51:40,499 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 124 treesize of output 142 [2022-03-15 19:51:42,764 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 19:51:42,764 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635653769] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:51:42,764 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:51:42,764 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 10] total 37 [2022-03-15 19:51:42,764 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1927441459] [2022-03-15 19:51:42,764 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:51:42,767 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:51:42,773 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 60 transitions. [2022-03-15 19:51:42,773 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:51:43,952 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [12865#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 12864#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 12867#(and (or (<= ~n2~0 ~q2_front~0) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (= ~q1~0.offset 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (= ~q1_front~0 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= ~q1_front~0 1)) (or (<= ~n2~0 ~q2_front~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (<= 1 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 12868#(and (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= 1 ~N~0) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (<= ~n2~0 ~q2_front~0) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (= ~q1_front~0 0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0) (= ~q1_front~0 1)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0))), 12866#(and (or (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)) (or (<= ~j~0 ~i~0) (< ~i~0 ~N~0))), 12869#(and (or (<= ~q1_back~0 ~q1_front~0) (< (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~j~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= ~j~0 (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), 12806#(or (< ~j~0 ~N~0) (and (< ~i~0 (+ ~j~0 1)) (<= ~j~0 ~i~0))), 12863#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)))] [2022-03-15 19:51:43,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 19:51:43,952 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:51:43,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 19:51:43,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=1743, Unknown=1, NotChecked=86, Total=2070 [2022-03-15 19:51:43,953 INFO L87 Difference]: Start difference. First operand 151 states and 340 transitions. Second operand has 25 states, 24 states have (on average 2.0) internal successors, (48), 24 states have internal predecessors, (48), 0 states have call successors, (0), 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-03-15 19:51:46,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:51:46,758 INFO L93 Difference]: Finished difference Result 295 states and 640 transitions. [2022-03-15 19:51:46,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 19:51:46,759 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.0) internal successors, (48), 24 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:51:46,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:51:46,760 INFO L225 Difference]: With dead ends: 295 [2022-03-15 19:51:46,760 INFO L226 Difference]: Without dead ends: 270 [2022-03-15 19:51:46,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=802, Invalid=4751, Unknown=1, NotChecked=146, Total=5700 [2022-03-15 19:51:46,760 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 180 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:51:46,760 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 0 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:51:46,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-03-15 19:51:46,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 152. [2022-03-15 19:51:46,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 2.2649006622516556) internal successors, (342), 151 states have internal predecessors, (342), 0 states have call successors, (0), 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-03-15 19:51:46,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 342 transitions. [2022-03-15 19:51:46,764 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 342 transitions. Word has length 22 [2022-03-15 19:51:46,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:51:46,764 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 342 transitions. [2022-03-15 19:51:46,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.0) internal successors, (48), 24 states have internal predecessors, (48), 0 states have call successors, (0), 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-03-15 19:51:46,764 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 342 transitions. [2022-03-15 19:51:46,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:51:46,764 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:51:46,764 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:51:46,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-03-15 19:51:46,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:51:46,983 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:51:46,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:51:46,984 INFO L85 PathProgramCache]: Analyzing trace with hash -260156069, now seen corresponding path program 19 times [2022-03-15 19:51:46,984 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:51:46,984 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848408816] [2022-03-15 19:51:46,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:51:46,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:51:47,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:51:48,722 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:51:48,722 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:51:48,722 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848408816] [2022-03-15 19:51:48,722 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848408816] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:51:48,722 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510537549] [2022-03-15 19:51:48,722 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:51:48,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:51:48,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:51:48,723 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:51:48,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-15 19:51:48,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:51:48,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-15 19:51:48,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:51:49,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:51:49,065 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-03-15 19:51:49,190 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:51:49,190 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 40 [2022-03-15 19:51:49,295 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:51:49,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:51:49,607 WARN L838 $PredicateComparison]: unable to prove that (forall ((~q1~0.offset Int) (v_ArrVal_932 (Array Int Int)) (~q1~0.base Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_932))) (let ((.cse0 (select .cse3 ~q1~0.base))) (or (not (= c_~j~0 (select .cse0 (+ (* c_~q1_back~0 4) ~q1~0.offset)))) (let ((.cse2 (select .cse0 (+ (* c_~q1_front~0 4) ~q1~0.offset))) (.cse1 (+ (select (select .cse3 c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) 1))) (and (or (< .cse1 c_~N~0) (< .cse2 c_~N~0)) (or (< (+ .cse2 1) c_~N~0) (<= .cse1 c_~N~0)))))))) is different from false [2022-03-15 19:51:49,641 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:51:49,642 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 176 treesize of output 236 [2022-03-15 19:51:49,659 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:51:49,659 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 124 treesize of output 142 [2022-03-15 19:51:52,846 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-03-15 19:51:52,847 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510537549] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:51:52,847 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:51:52,847 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 10] total 37 [2022-03-15 19:51:52,847 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1341652531] [2022-03-15 19:51:52,847 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:51:52,849 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:51:52,855 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 60 transitions. [2022-03-15 19:51:52,855 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:51:53,885 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [13699#(and (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= 1 ~N~0) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (<= ~n2~0 ~q2_front~0) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0))), 13694#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 13695#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 13696#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 13698#(and (or (<= ~n2~0 ~q2_front~0) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (= ~q1~0.offset 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (<= 1 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 13697#(and (or (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)) (or (<= ~j~0 ~i~0) (< ~i~0 ~N~0))), 13700#(and (or (<= ~q1_back~0 ~q1_front~0) (< (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~j~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= ~j~0 (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), 13637#(or (< ~j~0 ~N~0) (and (< ~i~0 (+ ~j~0 1)) (<= ~j~0 ~i~0)))] [2022-03-15 19:51:53,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 19:51:53,885 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:51:53,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 19:51:53,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=1728, Unknown=1, NotChecked=86, Total=2070 [2022-03-15 19:51:53,886 INFO L87 Difference]: Start difference. First operand 152 states and 342 transitions. Second operand has 25 states, 24 states have (on average 2.0) internal successors, (48), 24 states have internal predecessors, (48), 0 states have call successors, (0), 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-03-15 19:51:56,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:51:56,627 INFO L93 Difference]: Finished difference Result 324 states and 693 transitions. [2022-03-15 19:51:56,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 19:51:56,627 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.0) internal successors, (48), 24 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:51:56,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:51:56,628 INFO L225 Difference]: With dead ends: 324 [2022-03-15 19:51:56,628 INFO L226 Difference]: Without dead ends: 299 [2022-03-15 19:51:56,629 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=843, Invalid=4710, Unknown=1, NotChecked=146, Total=5700 [2022-03-15 19:51:56,629 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 107 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:51:56,629 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 0 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:51:56,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-03-15 19:51:56,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 152. [2022-03-15 19:51:56,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 2.2649006622516556) internal successors, (342), 151 states have internal predecessors, (342), 0 states have call successors, (0), 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-03-15 19:51:56,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 342 transitions. [2022-03-15 19:51:56,632 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 342 transitions. Word has length 22 [2022-03-15 19:51:56,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:51:56,632 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 342 transitions. [2022-03-15 19:51:56,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.0) internal successors, (48), 24 states have internal predecessors, (48), 0 states have call successors, (0), 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-03-15 19:51:56,633 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 342 transitions. [2022-03-15 19:51:56,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:51:56,633 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:51:56,633 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:51:56,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-15 19:51:56,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:51:56,850 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:51:56,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:51:56,850 INFO L85 PathProgramCache]: Analyzing trace with hash 834074153, now seen corresponding path program 20 times [2022-03-15 19:51:56,851 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:51:56,851 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802276418] [2022-03-15 19:51:56,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:51:56,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:51:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:51:58,224 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:51:58,224 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:51:58,224 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802276418] [2022-03-15 19:51:58,224 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802276418] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:51:58,224 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935042688] [2022-03-15 19:51:58,225 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:51:58,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:51:58,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:51:58,226 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:51:58,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-15 19:51:58,325 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:51:58,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:51:58,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 69 conjunts are in the unsatisfiable core [2022-03-15 19:51:58,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:51:58,357 INFO L353 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-03-15 19:51:58,358 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 16 [2022-03-15 19:51:58,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:51:58,540 INFO L353 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2022-03-15 19:51:58,540 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 14 [2022-03-15 19:51:58,592 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 19:51:58,639 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:51:58,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:51:58,736 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-03-15 19:51:58,916 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:51:58,916 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 40 [2022-03-15 19:51:59,029 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:51:59,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:51:59,344 WARN L838 $PredicateComparison]: unable to prove that (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_991 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_991))) (let ((.cse2 (select .cse3 ~q1~0.base))) (or (let ((.cse0 (+ (select (select .cse3 c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) 1)) (.cse1 (select .cse2 (+ (* c_~q1_front~0 4) ~q1~0.offset)))) (and (or (<= .cse0 c_~N~0) (< (+ .cse1 1) c_~N~0)) (or (< .cse0 c_~N~0) (< .cse1 c_~N~0)))) (not (= (select .cse2 (+ (* c_~q1_back~0 4) ~q1~0.offset)) c_~j~0)))))) is different from false [2022-03-15 19:51:59,715 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:51:59,715 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 181 treesize of output 121 [2022-03-15 19:51:59,746 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:51:59,746 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 638 treesize of output 674 [2022-03-15 19:51:59,768 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:51:59,769 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 542 treesize of output 494 [2022-03-15 19:51:59,801 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:51:59,802 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 470 treesize of output 512 [2022-03-15 19:52:12,704 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:52:12,704 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935042688] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:52:12,704 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:52:12,705 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 11] total 39 [2022-03-15 19:52:12,705 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1553345704] [2022-03-15 19:52:12,705 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:52:12,708 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:52:12,716 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 60 transitions. [2022-03-15 19:52:12,716 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:52:13,771 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [14560#(and (or (<= ~n2~0 ~q2_front~0) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (= ~q1~0.offset 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (<= 1 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 14498#(or (< ~j~0 ~N~0) (and (< ~i~0 (+ ~j~0 1)) (<= ~j~0 ~i~0))), 14559#(and (or (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)) (or (<= ~j~0 ~i~0) (< ~i~0 ~N~0))), 14561#(and (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= 1 ~N~0) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (<= ~n2~0 ~q2_front~0) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0))), 14556#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 14562#(and (or (<= ~q1_back~0 ~q1_front~0) (< (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~j~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= ~j~0 (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), 14557#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (not (<= (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) ~i~0)))), 14558#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (not (<= (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) ~i~0))))] [2022-03-15 19:52:13,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 19:52:13,771 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:52:13,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 19:52:13,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=1890, Unknown=1, NotChecked=90, Total=2256 [2022-03-15 19:52:13,772 INFO L87 Difference]: Start difference. First operand 152 states and 342 transitions. Second operand has 25 states, 24 states have (on average 2.0) internal successors, (48), 24 states have internal predecessors, (48), 0 states have call successors, (0), 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-03-15 19:52:15,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:52:15,591 INFO L93 Difference]: Finished difference Result 267 states and 563 transitions. [2022-03-15 19:52:15,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 19:52:15,592 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.0) internal successors, (48), 24 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:52:15,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:52:15,592 INFO L225 Difference]: With dead ends: 267 [2022-03-15 19:52:15,592 INFO L226 Difference]: Without dead ends: 213 [2022-03-15 19:52:15,593 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 22 SyntacticMatches, 6 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 845 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=652, Invalid=3907, Unknown=1, NotChecked=132, Total=4692 [2022-03-15 19:52:15,593 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 121 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:52:15,593 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 0 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:52:15,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-03-15 19:52:15,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 155. [2022-03-15 19:52:15,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 2.2467532467532467) internal successors, (346), 154 states have internal predecessors, (346), 0 states have call successors, (0), 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-03-15 19:52:15,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 346 transitions. [2022-03-15 19:52:15,596 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 346 transitions. Word has length 22 [2022-03-15 19:52:15,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:52:15,596 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 346 transitions. [2022-03-15 19:52:15,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.0) internal successors, (48), 24 states have internal predecessors, (48), 0 states have call successors, (0), 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-03-15 19:52:15,596 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 346 transitions. [2022-03-15 19:52:15,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:52:15,597 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:52:15,597 INFO L514 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:52:15,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-03-15 19:52:15,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:52:15,803 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:52:15,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:52:15,804 INFO L85 PathProgramCache]: Analyzing trace with hash -960606810, now seen corresponding path program 21 times [2022-03-15 19:52:15,805 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:52:15,805 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735269870] [2022-03-15 19:52:15,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:52:15,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:52:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:52:16,813 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:52:16,813 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:52:16,813 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735269870] [2022-03-15 19:52:16,813 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735269870] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:52:16,813 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266874592] [2022-03-15 19:52:16,813 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:52:16,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:52:16,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:52:16,814 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:52:16,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-03-15 19:52:17,057 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:52:17,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:52:17,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-15 19:52:17,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:52:17,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:52:17,340 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-03-15 19:52:17,503 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:52:17,503 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 38 [2022-03-15 19:52:17,604 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:52:17,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:52:17,960 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:52:17,960 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 180 treesize of output 240 [2022-03-15 19:52:17,979 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:52:17,980 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 128 treesize of output 146 [2022-03-15 19:52:20,900 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:52:20,901 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266874592] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:52:20,901 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:52:20,901 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 11] total 37 [2022-03-15 19:52:20,901 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [16329011] [2022-03-15 19:52:20,901 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:52:20,903 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:52:20,911 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 61 transitions. [2022-03-15 19:52:20,911 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:52:21,805 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [15357#(or (< ~i~0 ~N~0) (= ~j~0 ~i~0)), 15358#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (= ~j~0 (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), 15359#(and (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= 1 ~N~0) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (<= ~n2~0 ~q2_front~0) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0))), 15353#(or (<= ~n2~0 ~q2_front~0) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (= ~i~0 (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 15356#(and (or (<= ~n2~0 ~q2_front~0) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (= ~q1~0.offset 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (<= 1 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 15292#(or (< ~j~0 ~N~0) (= ~j~0 ~i~0)), 15354#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (= ~i~0 (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1)) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 15355#(and (or (<= ~n2~0 ~q2_front~0) (= ~i~0 (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (= ~i~0 (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1)) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)))] [2022-03-15 19:52:21,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 19:52:21,806 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:52:21,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 19:52:21,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1822, Unknown=1, NotChecked=0, Total=2070 [2022-03-15 19:52:21,807 INFO L87 Difference]: Start difference. First operand 155 states and 346 transitions. Second operand has 26 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:23,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:52:23,406 INFO L93 Difference]: Finished difference Result 257 states and 541 transitions. [2022-03-15 19:52:23,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 19:52:23,406 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 19:52:23,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:52:23,407 INFO L225 Difference]: With dead ends: 257 [2022-03-15 19:52:23,407 INFO L226 Difference]: Without dead ends: 226 [2022-03-15 19:52:23,408 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=633, Invalid=3922, Unknown=1, NotChecked=0, Total=4556 [2022-03-15 19:52:23,409 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 110 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:52:23,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 0 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:52:23,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-03-15 19:52:23,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 161. [2022-03-15 19:52:23,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 2.2125) internal successors, (354), 160 states have internal predecessors, (354), 0 states have call successors, (0), 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-03-15 19:52:23,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 354 transitions. [2022-03-15 19:52:23,414 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 354 transitions. Word has length 23 [2022-03-15 19:52:23,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:52:23,415 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 354 transitions. [2022-03-15 19:52:23,415 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:23,415 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 354 transitions. [2022-03-15 19:52:23,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:52:23,415 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:52:23,415 INFO L514 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:52:23,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-03-15 19:52:23,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-03-15 19:52:23,629 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:52:23,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:52:23,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1260453938, now seen corresponding path program 22 times [2022-03-15 19:52:23,629 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:52:23,629 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364526774] [2022-03-15 19:52:23,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:52:23,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:52:23,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:52:25,258 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:52:25,259 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:52:25,259 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364526774] [2022-03-15 19:52:25,259 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364526774] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:52:25,259 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125214931] [2022-03-15 19:52:25,259 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:52:25,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:52:25,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:52:25,260 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:52:25,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-03-15 19:52:25,358 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:52:25,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:52:25,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 43 conjunts are in the unsatisfiable core [2022-03-15 19:52:25,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:52:25,754 INFO L353 Elim1Store]: treesize reduction 33, result has 42.1 percent of original size [2022-03-15 19:52:25,755 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 60 treesize of output 43 [2022-03-15 19:52:25,832 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:52:25,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:52:26,101 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:52:26,101 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 136 [2022-03-15 19:52:26,386 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-03-15 19:52:26,386 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125214931] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:52:26,386 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:52:26,386 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 6] total 31 [2022-03-15 19:52:26,386 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1753185006] [2022-03-15 19:52:26,386 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:52:26,389 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:52:26,397 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 70 transitions. [2022-03-15 19:52:26,397 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:52:28,808 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [16150#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 16153#(and (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (= ~q2~0.offset 0) (< ~q1_back~0 0)) (or (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (= ~q1_front~0 0) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= 1 ~N~0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0))), 16149#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 16152#(and (or (<= ~q1_back~0 ~q1_front~0) (< (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~j~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= ~j~0 (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), 16154#(and (or (= ~i~0 0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0) (<= ~n1~0 ~q1_back~0) (= ~q1_front~0 0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (not (<= ~q2_front~0 0))) (or (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (= (+ (* 4 ~q2_front~0) ~q2~0.offset) (+ ~q2~0.offset (* ~q2_back~0 4))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (= ~q1_front~0 0) (<= ~N~0 ~j~0) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 7) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= 1 ~N~0) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (not (<= ~q2_front~0 0))) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= 1 ~N~0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (not (<= ~q2_front~0 0))) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (= ~q1_front~0 0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 5 (+ (* 4 ~q2_front~0) ~q2~0.offset)) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (<= ~q2_front~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= 5 (+ (* 4 ~q2_front~0) ~q2~0.offset)) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (= ~q1_front~0 0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (<= ~q2_front~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (= ~q2~0.offset 0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (= (+ (* 4 ~q2_front~0) ~q2~0.offset) (+ ~q2~0.offset (* ~q2_back~0 4))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 7) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (= (+ (* 4 ~q2_front~0) ~q2~0.offset) (+ ~q2~0.offset (* ~q2_back~0 4))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= 5 (+ (* 4 ~q2_front~0) ~q2~0.offset)) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (<= ~q2_front~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= 1 ~N~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 7) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (= ~q1_front~0 0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (not (<= ~q2_front~0 0))) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 7) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= 1 ~N~0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= 5 (+ (* 4 ~q2_front~0) ~q2~0.offset)) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= 1 ~N~0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (<= ~q2_front~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (= (+ (* 4 ~q2_front~0) ~q2~0.offset) (+ ~q2~0.offset (* ~q2_back~0 4))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= 1 ~N~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 7) (< ~q1_back~0 0)) (or (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (not (<= ~q2_front~0 0))) (or (= (+ (* 4 ~q2_front~0) ~q2~0.offset) (+ ~q2~0.offset (* ~q2_back~0 4))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 7) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (not (<= ~q2_front~0 0))) (or (= (+ (* 4 ~q2_front~0) ~q2~0.offset) (+ ~q2~0.offset (* ~q2_back~0 4))) (<= 5 (+ (* 4 ~q2_front~0) ~q2~0.offset)) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (<= ~q2_front~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (= ~q1_front~0 0) (<= ~N~0 ~j~0) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 7) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)) (not (<= ~q2_front~0 0))) (or (= (+ (* 4 ~q2_front~0) ~q2~0.offset) (+ ~q2~0.offset (* ~q2_back~0 4))) (<= 5 (+ (* 4 ~q2_front~0) ~q2~0.offset)) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (= ~q1_front~0 0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (<= ~q2_front~0 0)) (or (= (+ (* 4 ~q2_front~0) ~q2~0.offset) (+ ~q2~0.offset (* ~q2_back~0 4))) (<= 5 (+ (* 4 ~q2_front~0) ~q2~0.offset)) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= 1 ~N~0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (<= ~q2_front~0 0))), 16148#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 16151#(and (or (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)) (or (<= ~j~0 ~i~0) (< ~i~0 ~N~0))), 16092#(or (< ~j~0 ~N~0) (and (< ~i~0 (+ ~j~0 1)) (<= ~j~0 ~i~0)))] [2022-03-15 19:52:28,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 19:52:28,808 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:52:28,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 19:52:28,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1395, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 19:52:28,808 INFO L87 Difference]: Start difference. First operand 161 states and 354 transitions. Second operand has 26 states, 25 states have (on average 2.12) internal successors, (53), 25 states have internal predecessors, (53), 0 states have call successors, (0), 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-03-15 19:52:31,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:52:31,200 INFO L93 Difference]: Finished difference Result 242 states and 510 transitions. [2022-03-15 19:52:31,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 19:52:31,200 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.12) internal successors, (53), 25 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 19:52:31,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:52:31,201 INFO L225 Difference]: With dead ends: 242 [2022-03-15 19:52:31,201 INFO L226 Difference]: Without dead ends: 208 [2022-03-15 19:52:31,201 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 849 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=412, Invalid=3248, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 19:52:31,202 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 82 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:52:31,202 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 0 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:52:31,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-03-15 19:52:31,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 156. [2022-03-15 19:52:31,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 2.238709677419355) internal successors, (347), 155 states have internal predecessors, (347), 0 states have call successors, (0), 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-03-15 19:52:31,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 347 transitions. [2022-03-15 19:52:31,205 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 347 transitions. Word has length 23 [2022-03-15 19:52:31,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:52:31,205 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 347 transitions. [2022-03-15 19:52:31,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.12) internal successors, (53), 25 states have internal predecessors, (53), 0 states have call successors, (0), 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-03-15 19:52:31,205 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 347 transitions. [2022-03-15 19:52:31,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:52:31,205 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:52:31,205 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:52:31,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-03-15 19:52:31,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-03-15 19:52:31,422 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:52:31,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:52:31,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1549839848, now seen corresponding path program 23 times [2022-03-15 19:52:31,423 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:52:31,423 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367410051] [2022-03-15 19:52:31,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:52:31,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:52:31,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:52:33,147 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:52:33,147 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:52:33,147 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367410051] [2022-03-15 19:52:33,147 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367410051] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:52:33,147 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951043210] [2022-03-15 19:52:33,147 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:52:33,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:52:33,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:52:33,148 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:52:33,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-03-15 19:52:33,255 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:52:33,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:52:33,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 57 conjunts are in the unsatisfiable core [2022-03-15 19:52:33,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:52:33,277 INFO L353 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-03-15 19:52:33,277 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 16 [2022-03-15 19:52:33,337 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-03-15 19:52:33,337 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 18 [2022-03-15 19:52:33,509 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:52:33,642 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 17 [2022-03-15 19:52:33,735 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:52:33,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:52:34,069 WARN L838 $PredicateComparison]: unable to prove that (forall ((~q1~0.offset Int) (v_ArrVal_1162 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1162))) (let ((.cse0 (select .cse3 c_~q1~0.base))) (or (not (< (select .cse0 (+ (* c_~q1_back~0 4) ~q1~0.offset)) c_~N~0)) (let ((.cse1 (+ (select (select .cse3 c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) 1)) (.cse2 (select .cse0 (+ (* c_~q1_front~0 4) ~q1~0.offset)))) (and (or (<= .cse1 c_~N~0) (< (+ .cse2 1) c_~N~0)) (or (< .cse1 c_~N~0) (< .cse2 c_~N~0)))))))) is different from false [2022-03-15 19:52:34,117 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:52:34,117 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 176 treesize of output 236 [2022-03-15 19:52:34,135 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:52:34,135 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 124 treesize of output 142 [2022-03-15 19:52:42,347 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-03-15 19:52:42,347 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951043210] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:52:42,347 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:52:42,347 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 10] total 36 [2022-03-15 19:52:42,348 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1562350269] [2022-03-15 19:52:42,348 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:52:42,350 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:52:42,357 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 61 transitions. [2022-03-15 19:52:42,357 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:52:43,381 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [16861#(or (< ~j~0 ~N~0) (and (< ~i~0 (+ ~j~0 1)) (<= ~j~0 ~i~0))), 16926#(and (or (<= ~q1_back~0 ~q1_front~0) (< (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~j~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= ~j~0 (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), 16921#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 16922#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 16923#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 16924#(and (or (<= ~n2~0 ~q2_front~0) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (= ~q1~0.offset 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (<= 1 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 16927#(and (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= 1 ~N~0) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (<= ~n2~0 ~q2_front~0) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0))), 16925#(and (or (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)) (or (<= ~j~0 ~i~0) (< ~i~0 ~N~0)))] [2022-03-15 19:52:43,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 19:52:43,382 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:52:43,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 19:52:43,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1703, Unknown=1, NotChecked=84, Total=1980 [2022-03-15 19:52:43,382 INFO L87 Difference]: Start difference. First operand 156 states and 347 transitions. Second operand has 26 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:46,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:52:46,445 INFO L93 Difference]: Finished difference Result 305 states and 643 transitions. [2022-03-15 19:52:46,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-15 19:52:46,445 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 19:52:46,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:52:46,446 INFO L225 Difference]: With dead ends: 305 [2022-03-15 19:52:46,446 INFO L226 Difference]: Without dead ends: 286 [2022-03-15 19:52:46,447 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 911 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=627, Invalid=4632, Unknown=1, NotChecked=142, Total=5402 [2022-03-15 19:52:46,447 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 173 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:52:46,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 0 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:52:46,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-03-15 19:52:46,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 163. [2022-03-15 19:52:46,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 2.228395061728395) internal successors, (361), 162 states have internal predecessors, (361), 0 states have call successors, (0), 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-03-15 19:52:46,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 361 transitions. [2022-03-15 19:52:46,451 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 361 transitions. Word has length 23 [2022-03-15 19:52:46,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:52:46,451 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 361 transitions. [2022-03-15 19:52:46,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:46,451 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 361 transitions. [2022-03-15 19:52:46,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:52:46,451 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:52:46,451 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:52:46,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-03-15 19:52:46,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-03-15 19:52:46,669 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:52:46,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:52:46,669 INFO L85 PathProgramCache]: Analyzing trace with hash 671220900, now seen corresponding path program 24 times [2022-03-15 19:52:46,670 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:52:46,670 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234732448] [2022-03-15 19:52:46,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:52:46,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:52:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:52:48,811 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:52:48,811 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:52:48,811 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234732448] [2022-03-15 19:52:48,812 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234732448] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:52:48,812 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934907288] [2022-03-15 19:52:48,812 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:52:48,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:52:48,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:52:48,813 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:52:48,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-03-15 19:52:48,992 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:52:48,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:52:48,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 42 conjunts are in the unsatisfiable core [2022-03-15 19:52:48,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:52:49,266 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:52:49,267 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 40 [2022-03-15 19:52:49,372 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:52:49,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:52:49,694 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:52:49,694 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 136 [2022-03-15 19:52:49,856 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-03-15 19:52:49,856 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934907288] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:52:49,856 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:52:49,856 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 7] total 32 [2022-03-15 19:52:49,856 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1497955114] [2022-03-15 19:52:49,857 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:52:49,859 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:52:49,867 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 70 transitions. [2022-03-15 19:52:49,867 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:52:51,355 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [17786#(and (or (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)) (or (<= ~j~0 ~i~0) (< ~i~0 ~N~0))), 17783#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 17789#(and (or (= ~i~0 0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 3) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (= ~q2~0.offset 0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (<= (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 3) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (<= (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 3) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (not (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 3)) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (<= (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 3) (= (* 4 ~q2_front~0) (* ~q2_back~0 4)) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (not (<= ~q2_front~0 0))) (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 3) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (not (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 3)) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 3) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (= ~i~0 0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (<= (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0) (not (<= ~q2_front~0 0)))), 17726#(or (< ~j~0 ~N~0) (and (< ~i~0 (+ ~j~0 1)) (<= ~j~0 ~i~0))), 17787#(and (or (<= ~q1_back~0 ~q1_front~0) (< (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~j~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= ~j~0 (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), 17784#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 17785#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 17788#(and (or (<= (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (= ~q2~0.offset 0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)))] [2022-03-15 19:52:51,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 19:52:51,355 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:52:51,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 19:52:51,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1457, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 19:52:51,356 INFO L87 Difference]: Start difference. First operand 163 states and 361 transitions. Second operand has 26 states, 25 states have (on average 2.12) internal successors, (53), 25 states have internal predecessors, (53), 0 states have call successors, (0), 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-03-15 19:52:54,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:52:54,054 INFO L93 Difference]: Finished difference Result 288 states and 607 transitions. [2022-03-15 19:52:54,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-15 19:52:54,054 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.12) internal successors, (53), 25 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 19:52:54,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:52:54,055 INFO L225 Difference]: With dead ends: 288 [2022-03-15 19:52:54,055 INFO L226 Difference]: Without dead ends: 269 [2022-03-15 19:52:54,056 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1048 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=616, Invalid=3940, Unknown=0, NotChecked=0, Total=4556 [2022-03-15 19:52:54,056 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 151 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:52:54,056 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 0 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:52:54,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-03-15 19:52:54,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 157. [2022-03-15 19:52:54,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 2.2371794871794872) internal successors, (349), 156 states have internal predecessors, (349), 0 states have call successors, (0), 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-03-15 19:52:54,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 349 transitions. [2022-03-15 19:52:54,059 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 349 transitions. Word has length 23 [2022-03-15 19:52:54,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:52:54,059 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 349 transitions. [2022-03-15 19:52:54,059 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.12) internal successors, (53), 25 states have internal predecessors, (53), 0 states have call successors, (0), 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-03-15 19:52:54,059 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 349 transitions. [2022-03-15 19:52:54,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:52:54,060 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:52:54,060 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:52:54,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-03-15 19:52:54,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:52:54,260 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:52:54,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:52:54,261 INFO L85 PathProgramCache]: Analyzing trace with hash 2033383270, now seen corresponding path program 25 times [2022-03-15 19:52:54,261 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:52:54,261 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672603432] [2022-03-15 19:52:54,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:52:54,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:52:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:52:55,788 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:52:55,788 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:52:55,788 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672603432] [2022-03-15 19:52:55,788 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672603432] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:52:55,788 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144586591] [2022-03-15 19:52:55,788 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:52:55,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:52:55,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:52:55,789 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:52:55,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-03-15 19:52:55,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:52:55,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-15 19:52:55,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:52:56,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:52:56,164 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-03-15 19:52:56,292 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:52:56,293 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 40 [2022-03-15 19:52:56,400 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:52:56,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:52:56,712 WARN L838 $PredicateComparison]: unable to prove that (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_1271 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1271))) (let ((.cse3 (select .cse2 ~q1~0.base))) (or (let ((.cse1 (select .cse3 (+ (* c_~q1_front~0 4) ~q1~0.offset))) (.cse0 (+ (select (select .cse2 c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) 1))) (and (or (<= .cse0 c_~N~0) (< (+ .cse1 1) c_~N~0)) (or (< .cse1 c_~N~0) (< .cse0 c_~N~0)))) (not (= c_~j~0 (select .cse3 (+ (* c_~q1_back~0 4) ~q1~0.offset)))))))) is different from false [2022-03-15 19:52:56,747 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:52:56,747 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 176 treesize of output 236 [2022-03-15 19:52:56,765 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:52:56,765 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 124 treesize of output 142 [2022-03-15 19:53:00,604 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-03-15 19:53:00,604 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144586591] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:53:00,604 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:53:00,604 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 10] total 38 [2022-03-15 19:53:00,604 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [715297636] [2022-03-15 19:53:00,604 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:53:00,606 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:53:00,613 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 61 transitions. [2022-03-15 19:53:00,613 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:53:01,615 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [18618#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 18622#(and (or (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)) (or (<= ~j~0 ~i~0) (< ~i~0 ~N~0))), 18619#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (not (<= (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) ~i~0)))), 18623#(and (or (<= ~q1_back~0 ~q1_front~0) (< (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~j~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= ~j~0 (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), 18624#(and (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= 1 ~N~0) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (<= ~n2~0 ~q2_front~0) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0))), 18621#(and (or (<= ~n2~0 ~q2_front~0) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (= ~q1~0.offset 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (<= 1 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 18620#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (not (<= (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) ~i~0)))), 18558#(or (< ~j~0 ~N~0) (and (< ~i~0 (+ ~j~0 1)) (<= ~j~0 ~i~0)))] [2022-03-15 19:53:01,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 19:53:01,615 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:53:01,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 19:53:01,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1846, Unknown=1, NotChecked=88, Total=2162 [2022-03-15 19:53:01,616 INFO L87 Difference]: Start difference. First operand 157 states and 349 transitions. Second operand has 26 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:53:04,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:53:04,020 INFO L93 Difference]: Finished difference Result 328 states and 688 transitions. [2022-03-15 19:53:04,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-15 19:53:04,020 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 19:53:04,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:53:04,021 INFO L225 Difference]: With dead ends: 328 [2022-03-15 19:53:04,021 INFO L226 Difference]: Without dead ends: 303 [2022-03-15 19:53:04,022 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 984 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=717, Invalid=4688, Unknown=1, NotChecked=144, Total=5550 [2022-03-15 19:53:04,022 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 118 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:53:04,022 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 0 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:53:04,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-03-15 19:53:04,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 164. [2022-03-15 19:53:04,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 2.226993865030675) internal successors, (363), 163 states have internal predecessors, (363), 0 states have call successors, (0), 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-03-15 19:53:04,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 363 transitions. [2022-03-15 19:53:04,026 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 363 transitions. Word has length 23 [2022-03-15 19:53:04,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:53:04,026 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 363 transitions. [2022-03-15 19:53:04,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:53:04,026 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 363 transitions. [2022-03-15 19:53:04,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:53:04,026 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:53:04,026 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:53:04,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-03-15 19:53:04,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:53:04,239 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:53:04,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:53:04,239 INFO L85 PathProgramCache]: Analyzing trace with hash -40523278, now seen corresponding path program 26 times [2022-03-15 19:53:04,240 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:53:04,240 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706967353] [2022-03-15 19:53:04,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:53:04,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:53:04,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:53:05,697 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:53:05,697 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:53:05,697 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706967353] [2022-03-15 19:53:05,697 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706967353] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:53:05,698 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874416456] [2022-03-15 19:53:05,698 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:53:05,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:53:05,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:53:05,699 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:53:05,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-03-15 19:53:05,806 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:53:05,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:53:05,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 42 conjunts are in the unsatisfiable core [2022-03-15 19:53:05,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:53:06,056 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:53:06,056 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 40 [2022-03-15 19:53:06,159 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:53:06,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:53:06,440 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:53:06,440 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 138 [2022-03-15 19:53:06,687 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-03-15 19:53:06,687 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874416456] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:53:06,687 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:53:06,687 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 7] total 31 [2022-03-15 19:53:06,687 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1730978280] [2022-03-15 19:53:06,687 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:53:06,690 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:53:06,698 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 70 transitions. [2022-03-15 19:53:06,698 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:53:08,498 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [19505#(and (or (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)) (or (<= ~j~0 ~i~0) (< ~i~0 ~N~0))), 19508#(and (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (= (+ (* 4 ~q2_front~0) ~q2~0.offset) (+ ~q2~0.offset (* ~q2_back~0 4))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= 1 ~N~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (<= ~q2_front~0 0)) (or (= ~i~0 0) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (= ~q2~0.offset 0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (not (<= ~q2_front~0 0))) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (= (+ (* 4 ~q2_front~0) ~q2~0.offset) (+ ~q2~0.offset (* ~q2_back~0 4))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (<= ~q2_front~0 0)) (or (= (+ (* 4 ~q2_front~0) ~q2~0.offset) (+ ~q2~0.offset (* ~q2_back~0 4))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (<= ~q2_front~0 0)) (or (= ~i~0 0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= 1 ~N~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (<= ~q2_front~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= 1 ~N~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (not (<= ~q2_front~0 0))) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= 1 ~N~0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (<= ~q2_front~0 0)) (or (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (not (<= ~q2_front~0 0))) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= ~q1~0.offset 0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (= ~i~0 0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0))), 19502#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 19504#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (not (<= (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) ~i~0)))), 19507#(and (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (= ~q2~0.offset 0) (< ~q1_back~0 0)) (or (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= 1 ~N~0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0))), 19503#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (not (<= (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) ~i~0)))), 19506#(and (or (<= ~q1_back~0 ~q1_front~0) (< (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~j~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= ~j~0 (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), 19445#(or (< ~j~0 ~N~0) (and (< ~i~0 (+ ~j~0 1)) (<= ~j~0 ~i~0)))] [2022-03-15 19:53:08,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 19:53:08,498 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:53:08,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 19:53:08,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1345, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 19:53:08,499 INFO L87 Difference]: Start difference. First operand 164 states and 363 transitions. Second operand has 26 states, 25 states have (on average 2.12) internal successors, (53), 25 states have internal predecessors, (53), 0 states have call successors, (0), 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-03-15 19:53:10,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:53:10,838 INFO L93 Difference]: Finished difference Result 287 states and 607 transitions. [2022-03-15 19:53:10,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-15 19:53:10,847 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.12) internal successors, (53), 25 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 19:53:10,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:53:10,848 INFO L225 Difference]: With dead ends: 287 [2022-03-15 19:53:10,848 INFO L226 Difference]: Without dead ends: 268 [2022-03-15 19:53:10,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 892 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=663, Invalid=3627, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 19:53:10,849 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 107 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:53:10,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 0 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:53:10,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-03-15 19:53:10,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 157. [2022-03-15 19:53:10,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 2.2371794871794872) internal successors, (349), 156 states have internal predecessors, (349), 0 states have call successors, (0), 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-03-15 19:53:10,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 349 transitions. [2022-03-15 19:53:10,853 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 349 transitions. Word has length 23 [2022-03-15 19:53:10,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:53:10,853 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 349 transitions. [2022-03-15 19:53:10,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.12) internal successors, (53), 25 states have internal predecessors, (53), 0 states have call successors, (0), 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-03-15 19:53:10,853 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 349 transitions. [2022-03-15 19:53:10,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:53:10,853 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:53:10,853 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:53:10,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-03-15 19:53:11,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-03-15 19:53:11,070 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:53:11,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:53:11,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1594781784, now seen corresponding path program 27 times [2022-03-15 19:53:11,071 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:53:11,071 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668436718] [2022-03-15 19:53:11,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:53:11,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:53:11,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:53:13,672 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:53:13,673 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:53:13,673 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668436718] [2022-03-15 19:53:13,673 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668436718] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:53:13,673 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677360596] [2022-03-15 19:53:13,673 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:53:13,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:53:13,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:53:13,674 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:53:13,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-03-15 19:53:13,841 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:53:13,841 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:53:13,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-15 19:53:13,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:53:13,866 INFO L353 Elim1Store]: treesize reduction 37, result has 32.7 percent of original size [2022-03-15 19:53:13,867 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 23 [2022-03-15 19:53:13,949 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-15 19:53:13,949 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-15 19:53:14,108 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-03-15 19:53:14,239 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:53:14,240 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 40 [2022-03-15 19:53:14,355 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-03-15 19:53:14,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:53:14,671 WARN L838 $PredicateComparison]: unable to prove that (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_1383 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1383))) (let ((.cse1 (+ (select (select .cse3 c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) 1)) (.cse0 (select .cse3 ~q1~0.base))) (or (not (= c_~j~0 (select .cse0 (+ (* c_~q1_back~0 4) ~q1~0.offset)))) (< .cse1 c_~N~0) (let ((.cse2 (select .cse0 (+ (* c_~q1_front~0 4) ~q1~0.offset)))) (and (< .cse2 .cse1) (or (< (+ .cse2 1) c_~N~0) (<= .cse1 c_~N~0)))))))) is different from false [2022-03-15 19:53:14,707 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:53:14,708 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 252 treesize of output 288 [2022-03-15 19:53:14,725 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:53:14,726 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 166 treesize of output 166 [2022-03-15 19:53:15,470 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-03-15 19:53:15,471 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677360596] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:53:15,471 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:53:15,471 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 10] total 36 [2022-03-15 19:53:15,471 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [65542069] [2022-03-15 19:53:15,471 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:53:15,473 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:53:15,480 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 61 transitions. [2022-03-15 19:53:15,480 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:53:16,471 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [20333#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 20272#(or (< ~j~0 ~N~0) (and (< ~i~0 (+ ~j~0 1)) (<= ~j~0 ~i~0))), 20335#(and (or (<= ~n2~0 ~q2_front~0) (= ~q1~0.offset 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (< 0 (+ ~q1_front~0 1))) (or (<= (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= ~n2~0 ~q2_front~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0))), 20332#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 20337#(and (or (<= ~q1_back~0 ~q1_front~0) (< (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~j~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= ~j~0 (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), 20336#(and (or (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)) (or (<= ~j~0 ~i~0) (< ~i~0 ~N~0))), 20338#(and (or (<= (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0) (< 0 (+ ~q1_front~0 1))) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0))), 20334#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)))] [2022-03-15 19:53:16,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 19:53:16,471 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:53:16,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 19:53:16,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1710, Unknown=1, NotChecked=84, Total=1980 [2022-03-15 19:53:16,472 INFO L87 Difference]: Start difference. First operand 157 states and 349 transitions. Second operand has 26 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:53:19,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:53:19,328 INFO L93 Difference]: Finished difference Result 289 states and 605 transitions. [2022-03-15 19:53:19,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 19:53:19,328 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 19:53:19,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:53:19,329 INFO L225 Difference]: With dead ends: 289 [2022-03-15 19:53:19,329 INFO L226 Difference]: Without dead ends: 270 [2022-03-15 19:53:19,330 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 769 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=552, Invalid=4143, Unknown=1, NotChecked=134, Total=4830 [2022-03-15 19:53:19,330 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 102 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:53:19,330 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 0 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:53:19,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-03-15 19:53:19,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 163. [2022-03-15 19:53:19,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 2.228395061728395) internal successors, (361), 162 states have internal predecessors, (361), 0 states have call successors, (0), 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-03-15 19:53:19,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 361 transitions. [2022-03-15 19:53:19,333 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 361 transitions. Word has length 23 [2022-03-15 19:53:19,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:53:19,333 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 361 transitions. [2022-03-15 19:53:19,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:53:19,333 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 361 transitions. [2022-03-15 19:53:19,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:53:19,334 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:53:19,334 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:53:19,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-03-15 19:53:19,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-03-15 19:53:19,555 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:53:19,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:53:19,556 INFO L85 PathProgramCache]: Analyzing trace with hash -479124764, now seen corresponding path program 28 times [2022-03-15 19:53:19,556 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:53:19,556 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239609452] [2022-03-15 19:53:19,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:53:19,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:53:19,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:53:20,621 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:53:20,621 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:53:20,621 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239609452] [2022-03-15 19:53:20,621 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239609452] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:53:20,621 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593827361] [2022-03-15 19:53:20,621 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:53:20,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:53:20,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:53:20,623 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:53:20,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-03-15 19:53:20,738 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:53:20,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:53:20,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-15 19:53:20,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:53:21,028 INFO L353 Elim1Store]: treesize reduction 33, result has 42.1 percent of original size [2022-03-15 19:53:21,028 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 60 treesize of output 43 [2022-03-15 19:53:21,104 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-03-15 19:53:21,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:53:21,386 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:53:21,387 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 136 [2022-03-15 19:53:21,652 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-03-15 19:53:21,652 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593827361] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:53:21,652 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:53:21,652 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 7, 6] total 28 [2022-03-15 19:53:21,652 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [24551597] [2022-03-15 19:53:21,653 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:53:21,655 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:53:21,663 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 70 transitions. [2022-03-15 19:53:21,663 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:53:22,989 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [21166#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 21172#(and (or (= ~i~0 0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) ~i~0)) (<= ~N~0 ~j~0) (<= (+ ~q2~0.offset (* ~q2_back~0 4) 1) 0) (< ~q1_back~0 0)) (or (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) ~i~0)) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0)) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= 1 ~N~0) (<= ~n1~0 ~q1_back~0) (not (= (select (select |#memory_int| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) ~i~0)) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (= ~q2~0.offset 0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0))), 21168#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (not (<= (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) ~i~0)))), 21171#(and (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (= ~q2~0.offset 0) (< ~q1_back~0 0)) (or (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= 1 ~N~0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0))), 21169#(and (or (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)) (or (<= ~j~0 ~i~0) (< ~i~0 ~N~0))), 21167#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (not (<= (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) ~i~0)))), 21170#(and (or (<= ~q1_back~0 ~q1_front~0) (< (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~j~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= ~j~0 (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), 21110#(or (< ~j~0 ~N~0) (and (< ~i~0 (+ ~j~0 1)) (<= ~j~0 ~i~0)))] [2022-03-15 19:53:22,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 19:53:22,990 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:53:22,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 19:53:22,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=1103, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 19:53:22,990 INFO L87 Difference]: Start difference. First operand 163 states and 361 transitions. Second operand has 26 states, 25 states have (on average 2.12) internal successors, (53), 25 states have internal predecessors, (53), 0 states have call successors, (0), 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-03-15 19:53:25,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:53:25,323 INFO L93 Difference]: Finished difference Result 308 states and 645 transitions. [2022-03-15 19:53:25,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 19:53:25,323 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.12) internal successors, (53), 25 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 19:53:25,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:53:25,324 INFO L225 Difference]: With dead ends: 308 [2022-03-15 19:53:25,324 INFO L226 Difference]: Without dead ends: 283 [2022-03-15 19:53:25,325 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 781 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=746, Invalid=3286, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 19:53:25,325 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 94 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:53:25,325 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 0 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:53:25,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-03-15 19:53:25,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 157. [2022-03-15 19:53:25,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 2.2371794871794872) internal successors, (349), 156 states have internal predecessors, (349), 0 states have call successors, (0), 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-03-15 19:53:25,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 349 transitions. [2022-03-15 19:53:25,328 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 349 transitions. Word has length 23 [2022-03-15 19:53:25,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:53:25,328 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 349 transitions. [2022-03-15 19:53:25,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.12) internal successors, (53), 25 states have internal predecessors, (53), 0 states have call successors, (0), 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-03-15 19:53:25,328 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 349 transitions. [2022-03-15 19:53:25,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:53:25,328 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:53:25,329 INFO L514 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:53:25,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-03-15 19:53:25,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:53:25,529 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:53:25,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:53:25,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1605955290, now seen corresponding path program 29 times [2022-03-15 19:53:25,530 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:53:25,530 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359647542] [2022-03-15 19:53:25,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:53:25,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:53:25,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:53:26,762 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:53:26,762 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:53:26,762 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359647542] [2022-03-15 19:53:26,762 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359647542] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:53:26,762 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005966989] [2022-03-15 19:53:26,762 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:53:26,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:53:26,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:53:26,763 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:53:26,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-03-15 19:53:26,883 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 19:53:26,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:53:26,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 79 conjunts are in the unsatisfiable core [2022-03-15 19:53:26,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:53:26,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:53:26,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:53:26,909 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-03-15 19:53:26,909 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 16 [2022-03-15 19:53:27,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:53:27,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:53:27,147 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-03-15 19:53:27,148 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 10 [2022-03-15 19:53:27,208 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 19:53:27,259 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:53:27,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:53:27,365 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-03-15 19:53:27,636 INFO L353 Elim1Store]: treesize reduction 33, result has 42.1 percent of original size [2022-03-15 19:53:27,637 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 60 treesize of output 43 [2022-03-15 19:53:27,754 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:53:27,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:53:29,525 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:53:29,526 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 181 treesize of output 121 [2022-03-15 19:53:29,562 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:53:29,562 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 638 treesize of output 674 [2022-03-15 19:53:29,603 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:53:29,603 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 566 treesize of output 608 [2022-03-15 19:53:29,636 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:53:29,636 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 494 treesize of output 446 [2022-03-15 19:53:46,095 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-15 19:53:46,096 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005966989] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:53:46,096 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:53:46,096 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 11] total 41 [2022-03-15 19:53:46,096 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [451273184] [2022-03-15 19:53:46,096 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:53:46,098 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:53:46,105 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 61 transitions. [2022-03-15 19:53:46,105 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:53:47,109 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [22026#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (not (<= (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) ~i~0)))), 22027#(and (or (<= ~n2~0 ~q2_front~0) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (<= 1 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 22028#(and (or (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)) (or (<= ~j~0 ~i~0) (< ~i~0 ~N~0))), 21963#(or (< ~j~0 ~N~0) (and (< ~i~0 (+ ~j~0 1)) (<= ~j~0 ~i~0))), 22024#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 22029#(and (or (<= ~q1_back~0 ~q1_front~0) (< (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~j~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= ~j~0 (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), 22025#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (not (<= (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) ~i~0)))), 22030#(and (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= 1 ~N~0) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (<= ~n2~0 ~q2_front~0) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)))] [2022-03-15 19:53:47,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 19:53:47,110 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:53:47,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 19:53:47,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=2215, Unknown=4, NotChecked=0, Total=2450 [2022-03-15 19:53:47,110 INFO L87 Difference]: Start difference. First operand 157 states and 349 transitions. Second operand has 26 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:53:48,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:53:48,633 INFO L93 Difference]: Finished difference Result 272 states and 568 transitions. [2022-03-15 19:53:48,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 19:53:48,633 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 19:53:48,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:53:48,634 INFO L225 Difference]: With dead ends: 272 [2022-03-15 19:53:48,634 INFO L226 Difference]: Without dead ends: 233 [2022-03-15 19:53:48,635 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 966 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=489, Invalid=4063, Unknown=4, NotChecked=0, Total=4556 [2022-03-15 19:53:48,635 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 88 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:53:48,635 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 0 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:53:48,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-03-15 19:53:48,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 165. [2022-03-15 19:53:48,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 2.1951219512195124) internal successors, (360), 164 states have internal predecessors, (360), 0 states have call successors, (0), 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-03-15 19:53:48,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 360 transitions. [2022-03-15 19:53:48,638 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 360 transitions. Word has length 23 [2022-03-15 19:53:48,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:53:48,638 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 360 transitions. [2022-03-15 19:53:48,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:53:48,638 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 360 transitions. [2022-03-15 19:53:48,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:53:48,638 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:53:48,638 INFO L514 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:53:48,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-03-15 19:53:48,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:53:48,839 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:53:48,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:53:48,839 INFO L85 PathProgramCache]: Analyzing trace with hash 615105458, now seen corresponding path program 30 times [2022-03-15 19:53:48,840 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:53:48,840 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347570803] [2022-03-15 19:53:48,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:53:48,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:53:48,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:53:49,961 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:53:49,961 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:53:49,961 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347570803] [2022-03-15 19:53:49,961 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347570803] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:53:49,961 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788011977] [2022-03-15 19:53:49,962 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:53:49,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:53:49,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:53:49,964 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:53:49,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-03-15 19:53:50,154 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 19:53:50,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:53:50,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 42 conjunts are in the unsatisfiable core [2022-03-15 19:53:50,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:53:50,451 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:53:50,451 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 40 [2022-03-15 19:53:50,549 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:53:50,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:53:50,856 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:53:50,856 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 138 [2022-03-15 19:53:51,055 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-03-15 19:53:51,056 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788011977] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:53:51,056 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:53:51,056 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 7] total 33 [2022-03-15 19:53:51,056 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1440187456] [2022-03-15 19:53:51,056 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:53:51,058 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:53:51,066 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 70 transitions. [2022-03-15 19:53:51,066 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:53:52,318 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [22779#(or (< ~j~0 ~N~0) (and (< ~i~0 (+ ~j~0 1)) (<= ~j~0 ~i~0))), 22838#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 22839#(and (or (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)) (or (<= ~j~0 ~i~0) (< ~i~0 ~N~0))), 22842#(and (or (<= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0) (<= (+ ~n2~0 ~q2_front~0) (+ ~q2_back~0 1)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (= ~q2~0.offset 0) (< ~q1_back~0 0)) (or (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= 1 ~N~0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (= ~i~0 0) (not (= (+ (* 4 ~q2_front~0) ~q2~0.offset) 0)) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n2~0 1) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0)))), 22840#(and (or (<= ~q1_back~0 ~q1_front~0) (< (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~j~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= ~j~0 (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), 22841#(and (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (= ~q2~0.offset 0) (< ~q1_back~0 0)) (or (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= 1 ~N~0) (<= ~n1~0 ~q1_back~0) (<= ~N~0 ~j~0) (< ~q1_back~0 0))), 22837#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 22836#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)))] [2022-03-15 19:53:52,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 19:53:52,319 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:53:52,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 19:53:52,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=1460, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 19:53:52,319 INFO L87 Difference]: Start difference. First operand 165 states and 360 transitions. Second operand has 26 states, 25 states have (on average 2.12) internal successors, (53), 25 states have internal predecessors, (53), 0 states have call successors, (0), 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-03-15 19:53:53,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:53:53,444 INFO L93 Difference]: Finished difference Result 259 states and 540 transitions. [2022-03-15 19:53:53,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 19:53:53,444 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.12) internal successors, (53), 25 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 19:53:53,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:53:53,445 INFO L225 Difference]: With dead ends: 259 [2022-03-15 19:53:53,445 INFO L226 Difference]: Without dead ends: 217 [2022-03-15 19:53:53,445 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=477, Invalid=2493, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 19:53:53,445 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 133 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:53:53,446 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 0 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:53:53,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-03-15 19:53:53,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 160. [2022-03-15 19:53:53,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 2.220125786163522) internal successors, (353), 159 states have internal predecessors, (353), 0 states have call successors, (0), 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-03-15 19:53:53,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 353 transitions. [2022-03-15 19:53:53,448 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 353 transitions. Word has length 23 [2022-03-15 19:53:53,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:53:53,448 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 353 transitions. [2022-03-15 19:53:53,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.12) internal successors, (53), 25 states have internal predecessors, (53), 0 states have call successors, (0), 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-03-15 19:53:53,448 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 353 transitions. [2022-03-15 19:53:53,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:53:53,449 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:53:53,449 INFO L514 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:53:53,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-03-15 19:53:53,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:53:53,649 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:53:53,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:53:53,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1794246779, now seen corresponding path program 31 times [2022-03-15 19:53:53,650 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:53:53,650 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922198726] [2022-03-15 19:53:53,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:53:53,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:53:53,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:53:54,977 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:53:54,977 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:53:54,977 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922198726] [2022-03-15 19:53:54,977 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922198726] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:53:54,977 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160951104] [2022-03-15 19:53:54,977 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:53:54,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:53:54,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:53:54,978 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:53:54,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-03-15 19:53:55,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:53:55,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 56 conjunts are in the unsatisfiable core [2022-03-15 19:53:55,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:53:55,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:53:55,543 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-03-15 19:53:55,727 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:53:55,727 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 38 [2022-03-15 19:53:55,844 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:53:55,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:53:56,256 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:53:56,256 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 176 treesize of output 236 [2022-03-15 19:53:56,273 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:53:56,274 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 124 treesize of output 142 [2022-03-15 19:54:00,638 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-15 19:54:00,638 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160951104] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:54:00,638 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:54:00,638 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 11] total 43 [2022-03-15 19:54:00,639 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1600330566] [2022-03-15 19:54:00,639 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:54:00,641 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:54:00,649 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 62 transitions. [2022-03-15 19:54:00,649 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:54:01,673 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [23636#(and (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= 1 ~N~0) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (<= ~n2~0 ~q2_front~0) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0))), 23635#(and (or (<= ~n2~0 ~q2_front~0) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (= ~q1~0.offset 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (<= 1 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 23567#(or (< ~j~0 ~N~0) (and (< ~i~0 (+ ~j~0 1)) (<= ~j~0 ~i~0))), 23632#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 23637#(and (or (<= ~q1_back~0 ~q1_front~0) (< (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~j~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= ~j~0 (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), 23631#(and (or (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)) (or (<= ~j~0 ~i~0) (< ~i~0 ~N~0))), 23633#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 23634#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)))] [2022-03-15 19:54:01,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 19:54:01,673 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:54:01,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 19:54:01,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=2401, Unknown=1, NotChecked=0, Total=2652 [2022-03-15 19:54:01,675 INFO L87 Difference]: Start difference. First operand 160 states and 353 transitions. Second operand has 27 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 states have internal predecessors, (50), 0 states have call successors, (0), 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-03-15 19:54:03,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:54:03,681 INFO L93 Difference]: Finished difference Result 269 states and 561 transitions. [2022-03-15 19:54:03,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 19:54:03,682 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:54:03,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:54:03,683 INFO L225 Difference]: With dead ends: 269 [2022-03-15 19:54:03,683 INFO L226 Difference]: Without dead ends: 230 [2022-03-15 19:54:03,683 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 22 SyntacticMatches, 8 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1089 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=566, Invalid=4835, Unknown=1, NotChecked=0, Total=5402 [2022-03-15 19:54:03,683 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 69 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:54:03,684 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 0 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:54:03,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-03-15 19:54:03,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 166. [2022-03-15 19:54:03,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 2.187878787878788) internal successors, (361), 165 states have internal predecessors, (361), 0 states have call successors, (0), 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-03-15 19:54:03,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 361 transitions. [2022-03-15 19:54:03,686 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 361 transitions. Word has length 24 [2022-03-15 19:54:03,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:54:03,686 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 361 transitions. [2022-03-15 19:54:03,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 states have internal predecessors, (50), 0 states have call successors, (0), 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-03-15 19:54:03,687 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 361 transitions. [2022-03-15 19:54:03,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:54:03,687 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:54:03,687 INFO L514 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:54:03,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-03-15 19:54:03,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-03-15 19:54:03,907 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:54:03,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:54:03,907 INFO L85 PathProgramCache]: Analyzing trace with hash -279659769, now seen corresponding path program 32 times [2022-03-15 19:54:03,908 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:54:03,908 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337492122] [2022-03-15 19:54:03,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:54:03,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:54:03,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:54:05,546 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:54:05,546 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:54:05,547 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337492122] [2022-03-15 19:54:05,547 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337492122] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:54:05,547 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326390062] [2022-03-15 19:54:05,547 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:54:05,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:54:05,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:54:05,548 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:54:05,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-03-15 19:54:05,666 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:54:05,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:54:05,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 71 conjunts are in the unsatisfiable core [2022-03-15 19:54:05,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:54:05,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:54:05,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:54:05,702 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-15 19:54:05,702 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2022-03-15 19:54:05,759 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 19:54:05,815 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-15 19:54:05,815 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-15 19:54:05,898 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:54:05,939 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:54:05,997 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:54:06,050 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:54:06,110 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:54:06,164 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:54:06,217 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:54:06,273 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:54:06,500 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:54:06,500 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 38 [2022-03-15 19:54:06,623 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:54:06,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:54:08,337 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:54:08,337 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 142 [2022-03-15 19:54:08,389 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:54:08,389 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2370 treesize of output 2358 [2022-03-15 19:54:08,436 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:54:08,437 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2250 treesize of output 2256 [2022-03-15 19:54:08,491 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:54:08,492 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2160 treesize of output 1896 [2022-03-15 19:54:08,548 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:54:08,548 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1800 treesize of output 1716 [2022-03-15 19:55:47,571 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 3 refuted. 6 times theorem prover too weak. 10 trivial. 0 not checked. [2022-03-15 19:55:47,572 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326390062] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:55:47,572 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:55:47,572 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 13] total 44 [2022-03-15 19:55:47,572 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [478655304] [2022-03-15 19:55:47,572 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:55:47,574 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:55:47,583 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 71 transitions. [2022-03-15 19:55:47,583 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:55:48,951 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [24467#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 24469#(and (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (= ~q2~0.offset 0) (< ~q1_back~0 0)) (or (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0))), 24470#(and (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (< ~q1_back~0 0)) (or (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) (* (- 1) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) 0) (< ~q1_back~0 0) (<= ~q2_front~0 0) (not (<= ~q2_back~0 1))) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (= ~q2~0.offset 0) (< ~q1_back~0 0)) (or (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) (* (- 1) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) 0) (< ~q1_back~0 0) (<= ~q2_front~0 0)) (or (= (+ (* 4 ~q2_front~0) ~q2~0.offset) (+ ~q2~0.offset (* ~q2_back~0 4))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) (* (- 1) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) 0) (< ~q1_back~0 0) (<= ~q2_front~0 0)) (or (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (= ~i~0 0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (= (+ (* 4 ~q2_front~0) ~q2~0.offset) (+ ~q2~0.offset (* ~q2_back~0 4))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) (* (- 1) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) 0) (< ~q1_back~0 0) (<= ~q2_front~0 0) (not (<= ~q2_back~0 1))) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) (* (- 1) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) 0) (< ~q1_back~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0) (<= ~n1~0 ~q1_back~0) (= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) (* (- 1) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) 0) (< ~q1_back~0 0) (not (<= ~q2_front~0 0)))), 24468#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~j~0 (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~j~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0)))] [2022-03-15 19:55:48,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:55:48,951 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:55:48,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:55:48,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=2163, Unknown=18, NotChecked=0, Total=2450 [2022-03-15 19:55:48,952 INFO L87 Difference]: Start difference. First operand 166 states and 361 transitions. Second operand has 21 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 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-03-15 19:55:50,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:55:50,320 INFO L93 Difference]: Finished difference Result 201 states and 424 transitions. [2022-03-15 19:55:50,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 19:55:50,320 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:55:50,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:55:50,321 INFO L225 Difference]: With dead ends: 201 [2022-03-15 19:55:50,321 INFO L226 Difference]: Without dead ends: 169 [2022-03-15 19:55:50,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=397, Invalid=3367, Unknown=18, NotChecked=0, Total=3782 [2022-03-15 19:55:50,322 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 23 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:55:50,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 0 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:55:50,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-03-15 19:55:50,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 161. [2022-03-15 19:55:50,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 2.2125) internal successors, (354), 160 states have internal predecessors, (354), 0 states have call successors, (0), 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-03-15 19:55:50,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 354 transitions. [2022-03-15 19:55:50,324 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 354 transitions. Word has length 24 [2022-03-15 19:55:50,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:55:50,324 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 354 transitions. [2022-03-15 19:55:50,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 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-03-15 19:55:50,324 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 354 transitions. [2022-03-15 19:55:50,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:55:50,325 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:55:50,325 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:55:50,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-03-15 19:55:50,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-03-15 19:55:50,533 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:55:50,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:55:50,534 INFO L85 PathProgramCache]: Analyzing trace with hash 707891785, now seen corresponding path program 33 times [2022-03-15 19:55:50,534 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:55:50,534 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514193911] [2022-03-15 19:55:50,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:55:50,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:55:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:55:52,272 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:55:52,272 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:55:52,272 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514193911] [2022-03-15 19:55:52,272 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514193911] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:55:52,272 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711825506] [2022-03-15 19:55:52,272 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:55:52,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:55:52,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:55:52,273 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:55:52,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-03-15 19:55:52,478 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:55:52,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:55:52,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 31 conjunts are in the unsatisfiable core [2022-03-15 19:55:52,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:55:52,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:55:52,677 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-03-15 19:55:52,800 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:55:52,800 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 40 [2022-03-15 19:55:52,901 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-03-15 19:55:52,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:55:53,196 WARN L838 $PredicateComparison]: unable to prove that (forall ((~q1~0.offset Int) (v_ArrVal_1744 (Array Int Int)) (~q1~0.base Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1744))) (let ((.cse0 (select .cse3 ~q1~0.base))) (or (not (= c_~j~0 (select .cse0 (+ (* c_~q1_back~0 4) ~q1~0.offset)))) (let ((.cse1 (+ (select (select .cse3 c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) 1)) (.cse2 (select .cse0 (+ (* c_~q1_front~0 4) ~q1~0.offset)))) (and (or (< .cse1 c_~N~0) (< .cse2 c_~N~0)) (or (<= .cse1 c_~N~0) (< (+ .cse2 1) c_~N~0)))))))) is different from false [2022-03-15 19:55:53,231 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:55:53,231 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 176 treesize of output 236 [2022-03-15 19:55:53,249 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:55:53,249 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 124 treesize of output 142 [2022-03-15 19:55:54,796 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-03-15 19:55:54,796 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711825506] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:55:54,796 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:55:54,796 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 10] total 35 [2022-03-15 19:55:54,798 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1237446866] [2022-03-15 19:55:54,798 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:55:54,800 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:55:54,808 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 62 transitions. [2022-03-15 19:55:54,808 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:55:55,790 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [25195#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 25196#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 25198#(and (or (<= (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0))), 25199#(and (or (<= ~q1_back~0 ~q1_front~0) (< (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~j~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= ~j~0 (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), 25197#(and (or (<= ~n2~0 ~q2_front~0) (= ~q1~0.offset 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= ~n2~0 ~q2_front~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0))), 25130#(or (< ~j~0 ~N~0) (and (< ~i~0 (+ ~j~0 1)) (<= ~j~0 ~i~0))), 25193#(and (or (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)) (or (<= ~j~0 ~i~0) (< ~i~0 ~N~0))), 25194#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)))] [2022-03-15 19:55:55,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 19:55:55,790 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:55:55,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 19:55:55,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1568, Unknown=1, NotChecked=82, Total=1892 [2022-03-15 19:55:55,791 INFO L87 Difference]: Start difference. First operand 161 states and 354 transitions. Second operand has 26 states, 25 states have (on average 2.0) internal successors, (50), 25 states have internal predecessors, (50), 0 states have call successors, (0), 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-03-15 19:55:57,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:55:57,740 INFO L93 Difference]: Finished difference Result 326 states and 681 transitions. [2022-03-15 19:55:57,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-15 19:55:57,740 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.0) internal successors, (50), 25 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:55:57,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:55:57,741 INFO L225 Difference]: With dead ends: 326 [2022-03-15 19:55:57,741 INFO L226 Difference]: Without dead ends: 278 [2022-03-15 19:55:57,742 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 892 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=764, Invalid=3931, Unknown=1, NotChecked=134, Total=4830 [2022-03-15 19:55:57,742 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 161 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:55:57,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 0 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:55:57,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-03-15 19:55:57,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 153. [2022-03-15 19:55:57,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 2.263157894736842) internal successors, (344), 152 states have internal predecessors, (344), 0 states have call successors, (0), 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-03-15 19:55:57,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 344 transitions. [2022-03-15 19:55:57,745 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 344 transitions. Word has length 24 [2022-03-15 19:55:57,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:55:57,745 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 344 transitions. [2022-03-15 19:55:57,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.0) internal successors, (50), 25 states have internal predecessors, (50), 0 states have call successors, (0), 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-03-15 19:55:57,745 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 344 transitions. [2022-03-15 19:55:57,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:55:57,745 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:55:57,745 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:55:57,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-03-15 19:55:57,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-03-15 19:55:57,967 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:55:57,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:55:57,967 INFO L85 PathProgramCache]: Analyzing trace with hash 118658747, now seen corresponding path program 34 times [2022-03-15 19:55:57,968 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:55:57,968 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476996527] [2022-03-15 19:55:57,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:55:57,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:55:57,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:56:00,459 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:56:00,459 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:56:00,459 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476996527] [2022-03-15 19:56:00,459 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476996527] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:56:00,459 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972491544] [2022-03-15 19:56:00,459 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:56:00,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:56:00,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:56:00,460 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:56:00,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-03-15 19:56:00,583 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:56:00,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:56:00,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 58 conjunts are in the unsatisfiable core [2022-03-15 19:56:00,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:56:00,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:56:00,606 INFO L353 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2022-03-15 19:56:00,607 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 23 [2022-03-15 19:56:00,737 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-15 19:56:00,737 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-03-15 19:56:00,915 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-03-15 19:56:01,148 INFO L353 Elim1Store]: treesize reduction 33, result has 42.1 percent of original size [2022-03-15 19:56:01,148 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 60 treesize of output 43 [2022-03-15 19:56:01,274 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-03-15 19:56:01,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:56:01,747 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:56:01,747 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 176 treesize of output 236 [2022-03-15 19:56:01,764 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:56:01,764 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 124 treesize of output 142 [2022-03-15 19:56:06,305 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-03-15 19:56:06,305 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972491544] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:56:06,306 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:56:06,306 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 10] total 38 [2022-03-15 19:56:06,306 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2065185840] [2022-03-15 19:56:06,306 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:56:06,308 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:56:06,316 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 62 transitions. [2022-03-15 19:56:06,316 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:56:07,313 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [26063#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 26067#(and (or (<= (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0))), 25999#(or (< ~j~0 ~N~0) (and (< ~i~0 (+ ~j~0 1)) (<= ~j~0 ~i~0))), 26066#(and (or (<= ~n2~0 ~q2_front~0) (= ~q1~0.offset 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= ~n2~0 ~q2_front~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0))), 26064#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 26062#(and (or (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)) (or (<= ~j~0 ~i~0) (< ~i~0 ~N~0))), 26065#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 26068#(and (or (<= ~q1_back~0 ~q1_front~0) (< (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~j~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= ~j~0 (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))] [2022-03-15 19:56:07,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 19:56:07,313 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:56:07,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 19:56:07,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=1855, Unknown=1, NotChecked=0, Total=2162 [2022-03-15 19:56:07,314 INFO L87 Difference]: Start difference. First operand 153 states and 344 transitions. Second operand has 27 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 states have internal predecessors, (50), 0 states have call successors, (0), 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-03-15 19:56:09,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:56:09,830 INFO L93 Difference]: Finished difference Result 308 states and 646 transitions. [2022-03-15 19:56:09,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-15 19:56:09,831 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:56:09,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:56:09,832 INFO L225 Difference]: With dead ends: 308 [2022-03-15 19:56:09,832 INFO L226 Difference]: Without dead ends: 289 [2022-03-15 19:56:09,832 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1037 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=936, Invalid=4763, Unknown=1, NotChecked=0, Total=5700 [2022-03-15 19:56:09,832 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 152 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:56:09,832 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 0 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:56:09,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-03-15 19:56:09,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 154. [2022-03-15 19:56:09,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 2.261437908496732) internal successors, (346), 153 states have internal predecessors, (346), 0 states have call successors, (0), 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-03-15 19:56:09,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 346 transitions. [2022-03-15 19:56:09,835 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 346 transitions. Word has length 24 [2022-03-15 19:56:09,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:56:09,835 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 346 transitions. [2022-03-15 19:56:09,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 states have internal predecessors, (50), 0 states have call successors, (0), 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-03-15 19:56:09,835 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 346 transitions. [2022-03-15 19:56:09,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:56:09,836 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:56:09,836 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:56:09,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-03-15 19:56:10,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-03-15 19:56:10,051 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:56:10,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:56:10,051 INFO L85 PathProgramCache]: Analyzing trace with hash -593085431, now seen corresponding path program 35 times [2022-03-15 19:56:10,052 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:56:10,052 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77027800] [2022-03-15 19:56:10,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:56:10,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:56:10,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:56:14,518 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:56:14,518 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:56:14,518 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77027800] [2022-03-15 19:56:14,518 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77027800] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:56:14,518 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420792264] [2022-03-15 19:56:14,518 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:56:14,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:56:14,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:56:14,519 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:56:14,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-03-15 19:56:14,678 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:56:14,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:56:14,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 48 conjunts are in the unsatisfiable core [2022-03-15 19:56:14,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:56:14,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:56:14,987 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-03-15 19:56:15,231 INFO L353 Elim1Store]: treesize reduction 33, result has 42.1 percent of original size [2022-03-15 19:56:15,231 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 60 treesize of output 43 [2022-03-15 19:56:15,349 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-15 19:56:15,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:56:15,790 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:56:15,790 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 176 treesize of output 236 [2022-03-15 19:56:15,808 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:56:15,808 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 124 treesize of output 142 [2022-03-15 19:56:17,957 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-03-15 19:56:17,958 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420792264] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:56:17,958 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:56:17,958 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 10] total 39 [2022-03-15 19:56:17,958 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [281153526] [2022-03-15 19:56:17,958 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:56:17,960 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:56:17,968 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 62 transitions. [2022-03-15 19:56:17,968 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:56:19,066 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [26924#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (not (<= (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) ~i~0)))), 26928#(and (or (<= ~q1_back~0 ~q1_front~0) (< (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~j~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= ~j~0 (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), 26927#(and (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= 1 ~N~0) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (<= ~n2~0 ~q2_front~0) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (<= ~n2~0 ~q2_front~0) (not (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0)) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0))), 26923#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 26925#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (not (<= (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) ~i~0)))), 26922#(and (or (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)) (or (<= ~j~0 ~i~0) (< ~i~0 ~N~0))), 26926#(and (or (<= ~n2~0 ~q2_front~0) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (= ~q1~0.offset 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (not (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0)) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (<= 1 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 26859#(or (< ~j~0 ~N~0) (and (< ~i~0 (+ ~j~0 1)) (<= ~j~0 ~i~0)))] [2022-03-15 19:56:19,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 19:56:19,066 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:56:19,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 19:56:19,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=1949, Unknown=7, NotChecked=0, Total=2256 [2022-03-15 19:56:19,067 INFO L87 Difference]: Start difference. First operand 154 states and 346 transitions. Second operand has 27 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 states have internal predecessors, (50), 0 states have call successors, (0), 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-03-15 19:56:22,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:56:22,325 INFO L93 Difference]: Finished difference Result 330 states and 708 transitions. [2022-03-15 19:56:22,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-03-15 19:56:22,325 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:56:22,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:56:22,326 INFO L225 Difference]: With dead ends: 330 [2022-03-15 19:56:22,326 INFO L226 Difference]: Without dead ends: 305 [2022-03-15 19:56:22,327 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1211 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=984, Invalid=5489, Unknown=7, NotChecked=0, Total=6480 [2022-03-15 19:56:22,327 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 173 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:56:22,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 0 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:56:22,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-03-15 19:56:22,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 154. [2022-03-15 19:56:22,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 2.261437908496732) internal successors, (346), 153 states have internal predecessors, (346), 0 states have call successors, (0), 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-03-15 19:56:22,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 346 transitions. [2022-03-15 19:56:22,330 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 346 transitions. Word has length 24 [2022-03-15 19:56:22,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:56:22,330 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 346 transitions. [2022-03-15 19:56:22,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 states have internal predecessors, (50), 0 states have call successors, (0), 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-03-15 19:56:22,330 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 346 transitions. [2022-03-15 19:56:22,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:56:22,331 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:56:22,331 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:56:22,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-03-15 19:56:22,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:56:22,548 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:56:22,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:56:22,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1031686917, now seen corresponding path program 36 times [2022-03-15 19:56:22,549 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:56:22,549 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525253197] [2022-03-15 19:56:22,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:56:22,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:56:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:56:25,135 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:56:25,135 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:56:25,135 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525253197] [2022-03-15 19:56:25,135 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525253197] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:56:25,135 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208907113] [2022-03-15 19:56:25,135 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:56:25,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:56:25,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:56:25,136 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:56:25,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-03-15 19:56:25,314 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:56:25,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:56:25,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 39 conjunts are in the unsatisfiable core [2022-03-15 19:56:25,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:56:25,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:56:25,555 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-03-15 19:56:25,686 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:56:25,686 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 40 [2022-03-15 19:56:25,796 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-03-15 19:56:25,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:56:26,109 WARN L838 $PredicateComparison]: unable to prove that (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_1924 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1924))) (let ((.cse2 (select .cse3 ~q1~0.base))) (or (let ((.cse0 (+ (select (select .cse3 c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) 1)) (.cse1 (select .cse2 (+ (* c_~q1_front~0 4) ~q1~0.offset)))) (and (or (<= .cse0 c_~N~0) (< (+ .cse1 1) c_~N~0)) (or (< .cse0 c_~N~0) (< .cse1 c_~N~0)))) (not (= (select .cse2 (+ (* c_~q1_back~0 4) ~q1~0.offset)) c_~j~0)))))) is different from false [2022-03-15 19:56:26,143 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:56:26,144 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 176 treesize of output 236 [2022-03-15 19:56:26,161 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:56:26,161 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 124 treesize of output 142 [2022-03-15 19:56:29,348 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-03-15 19:56:29,348 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208907113] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:56:29,348 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:56:29,348 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 10] total 35 [2022-03-15 19:56:29,348 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1280709259] [2022-03-15 19:56:29,348 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:56:29,351 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:56:29,358 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 62 transitions. [2022-03-15 19:56:29,358 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:56:30,067 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [27809#(and (or (<= ~n2~0 ~q2_front~0) (= ~q1~0.offset 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~q2_front~0 0) (<= (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~q2_front~0 0) (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (< 0 (+ ~q1_front~0 1)))), 27811#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~j~0 (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~j~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0))), 27808#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 27810#(and (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset))) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0) (< 0 (+ ~q1_front~0 1))) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)))] [2022-03-15 19:56:30,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:56:30,068 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:56:30,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:56:30,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1379, Unknown=1, NotChecked=76, Total=1640 [2022-03-15 19:56:30,068 INFO L87 Difference]: Start difference. First operand 154 states and 346 transitions. Second operand has 21 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:56:31,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:56:31,279 INFO L93 Difference]: Finished difference Result 229 states and 491 transitions. [2022-03-15 19:56:31,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 19:56:31,279 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:56:31,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:56:31,280 INFO L225 Difference]: With dead ends: 229 [2022-03-15 19:56:31,280 INFO L226 Difference]: Without dead ends: 212 [2022-03-15 19:56:31,281 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=395, Invalid=2578, Unknown=1, NotChecked=106, Total=3080 [2022-03-15 19:56:31,281 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 39 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:56:31,281 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 0 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:56:31,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-03-15 19:56:31,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 160. [2022-03-15 19:56:31,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 2.251572327044025) internal successors, (358), 159 states have internal predecessors, (358), 0 states have call successors, (0), 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-03-15 19:56:31,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 358 transitions. [2022-03-15 19:56:31,283 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 358 transitions. Word has length 24 [2022-03-15 19:56:31,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:56:31,283 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 358 transitions. [2022-03-15 19:56:31,283 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:56:31,284 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 358 transitions. [2022-03-15 19:56:31,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:56:31,284 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:56:31,284 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:56:31,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-03-15 19:56:31,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-03-15 19:56:31,491 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:56:31,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:56:31,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1189373831, now seen corresponding path program 37 times [2022-03-15 19:56:31,492 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:56:31,492 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953164161] [2022-03-15 19:56:31,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:56:31,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:56:31,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:56:33,537 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:56:33,537 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:56:33,537 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953164161] [2022-03-15 19:56:33,537 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953164161] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:56:33,537 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76004819] [2022-03-15 19:56:33,537 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:56:33,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:56:33,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:56:33,538 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:56:33,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-03-15 19:56:33,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:56:33,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 44 conjunts are in the unsatisfiable core [2022-03-15 19:56:33,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:56:33,984 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:56:33,985 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 40 [2022-03-15 19:56:34,093 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 19:56:34,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:56:34,394 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:56:34,394 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 138 [2022-03-15 19:56:34,613 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-03-15 19:56:34,613 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76004819] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:56:34,613 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:56:34,613 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 7] total 32 [2022-03-15 19:56:34,613 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1575729703] [2022-03-15 19:56:34,613 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:56:34,616 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:56:34,624 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 71 transitions. [2022-03-15 19:56:34,624 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:56:35,574 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [28566#(and (or (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0) (< 0 (+ (* 4 ~q2_front~0) ~q2~0.offset 1)) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0) (not (= (+ ~q2~0.offset (* ~q2_back~0 4)) 0))) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (= ~q2~0.offset 0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= ~q1~0.offset 0) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0) (<= ~q2_front~0 0)) (or (= (+ (* 4 ~q2_front~0) ~q2~0.offset) (+ ~q2~0.offset (* ~q2_back~0 4))) (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0) (<= ~q2_front~0 0)) (or (= ~i~0 0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= (* ~n2~0 4) (+ ~q2~0.offset 3 (* ~q2_back~0 4))) (<= (+ ~q2~0.offset (* ~q2_back~0 4)) 0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0) (not (<= ~q2_front~0 0)))), 28564#(and (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~j~0 (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (or (<= ~q1_back~0 ~q1_front~0) (< (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~j~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0))), 28563#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 28565#(and (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (= ~q2~0.offset 0) (< ~q1_back~0 0)) (or (= (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (< ~q1_back~0 0)))] [2022-03-15 19:56:35,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:56:35,574 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:56:35,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:56:35,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1267, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 19:56:35,574 INFO L87 Difference]: Start difference. First operand 160 states and 358 transitions. Second operand has 21 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 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-03-15 19:56:37,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:56:37,186 INFO L93 Difference]: Finished difference Result 244 states and 524 transitions. [2022-03-15 19:56:37,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 19:56:37,186 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:56:37,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:56:37,187 INFO L225 Difference]: With dead ends: 244 [2022-03-15 19:56:37,187 INFO L226 Difference]: Without dead ends: 211 [2022-03-15 19:56:37,187 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=308, Invalid=2242, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 19:56:37,188 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 40 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:56:37,188 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 0 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:56:37,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-03-15 19:56:37,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 152. [2022-03-15 19:56:37,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 2.251655629139073) internal successors, (340), 151 states have internal predecessors, (340), 0 states have call successors, (0), 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-03-15 19:56:37,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 340 transitions. [2022-03-15 19:56:37,200 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 340 transitions. Word has length 24 [2022-03-15 19:56:37,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:56:37,200 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 340 transitions. [2022-03-15 19:56:37,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 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-03-15 19:56:37,201 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 340 transitions. [2022-03-15 19:56:37,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:56:37,201 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:56:37,201 INFO L514 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:56:37,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-03-15 19:56:37,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:56:37,419 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:56:37,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:56:37,421 INFO L85 PathProgramCache]: Analyzing trace with hash 62543305, now seen corresponding path program 38 times [2022-03-15 19:56:37,422 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:56:37,422 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921346708] [2022-03-15 19:56:37,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:56:37,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:56:37,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:56:38,525 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:56:38,525 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:56:38,525 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921346708] [2022-03-15 19:56:38,525 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921346708] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:56:38,525 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107547890] [2022-03-15 19:56:38,525 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:56:38,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:56:38,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:56:38,526 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:56:38,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-03-15 19:56:38,668 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:56:38,669 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:56:38,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-15 19:56:38,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:56:38,975 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 19:56:39,037 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:56:39,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:56:39,153 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-03-15 19:56:39,333 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:56:39,333 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 38 [2022-03-15 19:56:39,446 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:56:39,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:56:39,765 WARN L838 $PredicateComparison]: unable to prove that (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_2044 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2044))) (let ((.cse0 (select .cse3 ~q1~0.base))) (or (not (= (select .cse0 (+ (* c_~q1_back~0 4) ~q1~0.offset)) c_~j~0)) (let ((.cse1 (select .cse0 (+ (* c_~q1_front~0 4) ~q1~0.offset))) (.cse2 (+ (select (select .cse3 c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) 1))) (and (or (< .cse1 c_~N~0) (< .cse2 c_~N~0)) (or (< (+ .cse1 1) c_~N~0) (<= .cse2 c_~N~0)))))))) is different from false [2022-03-15 19:56:40,125 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:56:40,126 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 181 treesize of output 121 [2022-03-15 19:56:40,156 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:56:40,157 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 556 treesize of output 600 [2022-03-15 19:56:40,191 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:56:40,192 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 492 treesize of output 540 [2022-03-15 19:56:40,216 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:56:40,216 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 426 treesize of output 390 [2022-03-15 19:56:56,041 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-15 19:56:56,041 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107547890] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:56:56,041 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:56:56,041 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 11] total 43 [2022-03-15 19:56:56,042 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1346489299] [2022-03-15 19:56:56,042 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:56:56,044 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:56:56,051 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 62 transitions. [2022-03-15 19:56:56,051 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:56:57,021 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [29330#(and (or (<= ~q1_back~0 ~q1_front~0) (< (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~j~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0)) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (< (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= ~j~0 (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), 29328#(and (or (<= ~n2~0 ~q2_front~0) (= ~q1~0.offset 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= ~n2~0 ~q2_front~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0))), 29260#(or (< ~j~0 ~N~0) (and (< ~i~0 (+ ~j~0 1)) (<= ~j~0 ~i~0))), 29324#(and (or (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)) (or (<= ~j~0 ~i~0) (< ~i~0 ~N~0))), 29329#(and (or (<= (+ 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) ~N~0) (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~j~0)) (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0) (< ~q2_front~0 0) (<= ~N~0 ~j~0) (<= ~q2_back~0 ~q2_front~0) (< ~q1_back~0 0))), 29326#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 29325#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (< (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 29327#(and (or (<= ~n2~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~i~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (<= (+ (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) ~N~0)) (or (<= ~n2~0 ~q2_front~0) (< ~i~0 (+ 2 (select (select |#memory_int| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)))) (<= ~i~0 ~N~0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)))] [2022-03-15 19:56:57,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 19:56:57,021 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:56:57,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 19:56:57,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=2225, Unknown=1, NotChecked=98, Total=2652 [2022-03-15 19:56:57,021 INFO L87 Difference]: Start difference. First operand 152 states and 340 transitions. Second operand has 27 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 states have internal predecessors, (50), 0 states have call successors, (0), 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-03-15 19:56:58,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:56:58,355 INFO L93 Difference]: Finished difference Result 228 states and 482 transitions. [2022-03-15 19:56:58,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 19:56:58,356 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:56:58,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:56:58,356 INFO L225 Difference]: With dead ends: 228 [2022-03-15 19:56:58,356 INFO L226 Difference]: Without dead ends: 195 [2022-03-15 19:56:58,357 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 834 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=607, Invalid=3818, Unknown=1, NotChecked=130, Total=4556 [2022-03-15 19:56:58,357 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 80 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:56:58,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 0 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:56:58,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-03-15 19:56:58,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 138. [2022-03-15 19:56:58,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 2.2773722627737225) internal successors, (312), 137 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-03-15 19:56:58,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 312 transitions. [2022-03-15 19:56:58,359 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 312 transitions. Word has length 24 [2022-03-15 19:56:58,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:56:58,359 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 312 transitions. [2022-03-15 19:56:58,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 states have internal predecessors, (50), 0 states have call successors, (0), 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-03-15 19:56:58,360 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 312 transitions. [2022-03-15 19:56:58,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:56:58,360 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:56:58,360 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:56:58,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-03-15 19:56:58,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:56:58,561 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:56:58,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:56:58,561 INFO L85 PathProgramCache]: Analyzing trace with hash 984459340, now seen corresponding path program 39 times [2022-03-15 19:56:58,562 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:56:58,562 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512945828] [2022-03-15 19:56:58,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:56:58,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:56:58,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:56:59,227 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:56:59,227 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:56:59,227 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512945828] [2022-03-15 19:56:59,227 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512945828] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:56:59,227 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047848364] [2022-03-15 19:56:59,227 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:56:59,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:56:59,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:56:59,228 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:56:59,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-03-15 19:56:59,467 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:56:59,467 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:56:59,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 61 conjunts are in the unsatisfiable core [2022-03-15 19:56:59,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:56:59,612 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-15 19:56:59,651 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:56:59,725 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-15 19:57:02,093 INFO L353 Elim1Store]: treesize reduction 33, result has 42.1 percent of original size [2022-03-15 19:57:02,093 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 49 treesize of output 40 [2022-03-15 19:57:02,200 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:57:02,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:57:10,940 WARN L228 SmtUtils]: Spent 5.42s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 19:57:24,754 WARN L228 SmtUtils]: Spent 6.76s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 19:57:24,826 WARN L838 $PredicateComparison]: unable to prove that (or (not (< c_~q2_back~0 c_~n2~0)) (not (<= 0 c_~q2_back~0)) (and (forall ((v_ArrVal_2094 (Array Int Int))) (or (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2094) c_~q2~0.base))) (<= (select .cse0 (+ c_~q2~0.offset (* c_~q2_front~0 4) 4)) (select .cse0 (+ (* c_~q2_back~0 4) c_~q2~0.offset)))) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2094))) (let ((.cse5 (select .cse4 ~q1~0.base))) (let ((.cse2 (select .cse5 (+ (* c_~q1_back~0 4) ~q1~0.offset 4))) (.cse3 (+ (select .cse5 (+ (* c_~q1_front~0 4) ~q1~0.offset 4)) 1)) (.cse1 (select .cse4 c_~q2~0.base))) (or (<= (select .cse1 (+ c_~q2~0.offset (* c_~q2_front~0 4) 4)) .cse2) (<= .cse3 .cse2) (<= .cse3 (select .cse1 (+ (* c_~q2_back~0 4) c_~q2~0.offset)))))))))) (forall ((v_ArrVal_2094 (Array Int Int))) (or (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2094))) (let ((.cse9 (select .cse10 ~q1~0.base))) (let ((.cse6 (select .cse10 c_~q2~0.base)) (.cse8 (select .cse9 (+ (* c_~q1_front~0 4) ~q1~0.offset 4))) (.cse7 (select .cse9 (+ (* c_~q1_back~0 4) ~q1~0.offset 4)))) (or (<= (+ (select .cse6 (+ c_~q2~0.offset (* c_~q2_front~0 4) 4)) 1) .cse7) (<= .cse8 (select .cse6 (+ (* c_~q2_back~0 4) c_~q2~0.offset))) (<= .cse8 .cse7)))))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2094) c_~q2~0.base))) (<= (+ (select .cse11 (+ c_~q2~0.offset (* c_~q2_front~0 4) 4)) 1) (select .cse11 (+ (* c_~q2_back~0 4) c_~q2~0.offset)))))))) is different from false [2022-03-15 19:57:25,720 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:57:25,721 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 463 treesize of output 284 [2022-03-15 19:57:25,878 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:57:25,879 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 5172 treesize of output 4773 [2022-03-15 19:57:26,010 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:57:26,011 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4354 treesize of output 4190 [2022-03-15 19:57:26,099 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:57:26,100 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4084 treesize of output 4055 [2022-03-15 19:57:26,196 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:57:26,197 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3949 treesize of output 3083 [2022-03-15 19:57:26,318 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:57:26,318 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2977 treesize of output 2597 [2022-03-15 19:57:26,373 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-03-15 19:57:26,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-03-15 19:57:26,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-03-15 19:57:26,574 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-03-15 19:57:26,577 INFO L158 Benchmark]: Toolchain (without parser) took 589629.72ms. Allocated memory was 190.8MB in the beginning and 702.5MB in the end (delta: 511.7MB). Free memory was 139.7MB in the beginning and 565.1MB in the end (delta: -425.4MB). Peak memory consumption was 421.1MB. Max. memory is 8.0GB. [2022-03-15 19:57:26,577 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 190.8MB. Free memory is still 156.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 19:57:26,577 INFO L158 Benchmark]: CACSL2BoogieTranslator took 175.26ms. Allocated memory is still 190.8MB. Free memory was 139.5MB in the beginning and 163.5MB in the end (delta: -24.0MB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. [2022-03-15 19:57:26,577 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.37ms. Allocated memory is still 190.8MB. Free memory was 163.5MB in the beginning and 161.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 19:57:26,577 INFO L158 Benchmark]: Boogie Preprocessor took 18.53ms. Allocated memory is still 190.8MB. Free memory was 161.5MB in the beginning and 159.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 19:57:26,577 INFO L158 Benchmark]: RCFGBuilder took 488.33ms. Allocated memory is still 190.8MB. Free memory was 159.9MB in the beginning and 135.2MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-03-15 19:57:26,577 INFO L158 Benchmark]: TraceAbstraction took 588917.43ms. Allocated memory was 190.8MB in the beginning and 702.5MB in the end (delta: 511.7MB). Free memory was 134.7MB in the beginning and 565.1MB in the end (delta: -430.4MB). Peak memory consumption was 416.6MB. Max. memory is 8.0GB. [2022-03-15 19:57:26,578 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.11ms. Allocated memory is still 190.8MB. Free memory is still 156.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 175.26ms. Allocated memory is still 190.8MB. Free memory was 139.5MB in the beginning and 163.5MB in the end (delta: -24.0MB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.37ms. Allocated memory is still 190.8MB. Free memory was 163.5MB in the beginning and 161.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.53ms. Allocated memory is still 190.8MB. Free memory was 161.5MB in the beginning and 159.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 488.33ms. Allocated memory is still 190.8MB. Free memory was 159.9MB in the beginning and 135.2MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 588917.43ms. Allocated memory was 190.8MB in the beginning and 702.5MB in the end (delta: 511.7MB). Free memory was 134.7MB in the beginning and 565.1MB in the end (delta: -430.4MB). Peak memory consumption was 416.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.8s, 172 PlacesBefore, 25 PlacesAfterwards, 178 TransitionsBefore, 22 TransitionsAfterwards, 500 CoEnabledTransitionPairs, 7 FixpointIterations, 128 TrivialSequentialCompositions, 17 ConcurrentSequentialCompositions, 22 TrivialYvCompositions, 4 ConcurrentYvCompositions, 9 ChoiceCompositions, 180 TotalNumberOfCompositions, 826 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 661, positive: 613, positive conditional: 0, positive unconditional: 613, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 278, positive: 267, positive conditional: 0, positive unconditional: 267, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 661, positive: 346, positive conditional: 0, positive unconditional: 346, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 278, unknown conditional: 0, unknown unconditional: 278] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 23, Positive conditional cache size: 0, Positive unconditional cache size: 23, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3 - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-03-15 19:57:26,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...