./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/heap-manipulation/bubble_sort_linux-2.i --full-output --preprocessor.use.memory.slicer true --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6ae2ee47 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/heap-manipulation/bubble_sort_linux-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 18:02:33,550 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 18:02:33,612 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-22 18:02:33,617 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 18:02:33,617 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 18:02:33,638 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 18:02:33,638 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 18:02:33,639 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 18:02:33,639 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 18:02:33,642 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 18:02:33,642 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 18:02:33,642 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 18:02:33,643 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 18:02:33,644 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 18:02:33,644 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 18:02:33,644 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 18:02:33,645 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 18:02:33,645 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 18:02:33,645 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 18:02:33,645 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 18:02:33,645 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 18:02:33,646 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 18:02:33,646 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 18:02:33,646 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 18:02:33,646 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 18:02:33,646 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 18:02:33,647 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 18:02:33,647 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 18:02:33,647 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 18:02:33,647 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 18:02:33,648 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 18:02:33,648 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 18:02:33,649 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 18:02:33,649 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 18:02:33,649 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 18:02:33,649 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 18:02:33,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 18:02:33,649 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 18:02:33,649 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 18:02:33,650 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 18:02:33,650 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 18:02:33,650 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 18:02:33,650 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-22 18:02:33,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 18:02:33,885 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 18:02:33,887 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 18:02:33,888 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 18:02:33,889 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 18:02:33,890 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/bubble_sort_linux-2.i [2023-11-22 18:02:34,836 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 18:02:35,030 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 18:02:35,030 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/bubble_sort_linux-2.i [2023-11-22 18:02:35,046 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f829120ad/92de117fff6f4b3596ed3598c72ece87/FLAG2984e5fe6 [2023-11-22 18:02:35,056 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f829120ad/92de117fff6f4b3596ed3598c72ece87 [2023-11-22 18:02:35,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 18:02:35,059 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 18:02:35,061 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 18:02:35,061 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 18:02:35,064 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 18:02:35,065 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:02:35" (1/1) ... [2023-11-22 18:02:35,066 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@730e1839 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:02:35, skipping insertion in model container [2023-11-22 18:02:35,066 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:02:35" (1/1) ... [2023-11-22 18:02:35,113 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 18:02:35,399 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2023-11-22 18:02:35,433 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 18:02:35,441 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 18:02:35,462 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2023-11-22 18:02:35,480 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 18:02:35,516 INFO L206 MainTranslator]: Completed translation [2023-11-22 18:02:35,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:02:35 WrapperNode [2023-11-22 18:02:35,517 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 18:02:35,520 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 18:02:35,520 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 18:02:35,520 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 18:02:35,525 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:02:35" (1/1) ... [2023-11-22 18:02:35,539 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:02:35" (1/1) ... [2023-11-22 18:02:35,555 INFO L138 Inliner]: procedures = 232, calls = 75, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 118 [2023-11-22 18:02:35,555 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 18:02:35,556 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 18:02:35,556 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 18:02:35,556 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 18:02:35,563 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:02:35" (1/1) ... [2023-11-22 18:02:35,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:02:35" (1/1) ... [2023-11-22 18:02:35,566 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:02:35" (1/1) ... [2023-11-22 18:02:35,588 INFO L189 HeapSplitter]: Split 37 memory accesses to 2 slices as follows [2, 35] [2023-11-22 18:02:35,589 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:02:35" (1/1) ... [2023-11-22 18:02:35,589 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:02:35" (1/1) ... [2023-11-22 18:02:35,605 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:02:35" (1/1) ... [2023-11-22 18:02:35,609 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:02:35" (1/1) ... [2023-11-22 18:02:35,611 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:02:35" (1/1) ... [2023-11-22 18:02:35,612 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:02:35" (1/1) ... [2023-11-22 18:02:35,618 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 18:02:35,619 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 18:02:35,619 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 18:02:35,619 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 18:02:35,620 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:02:35" (1/1) ... [2023-11-22 18:02:35,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 18:02:35,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:02:35,645 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) [2023-11-22 18:02:35,668 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 [2023-11-22 18:02:35,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-22 18:02:35,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-22 18:02:35,686 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2023-11-22 18:02:35,686 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2023-11-22 18:02:35,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-22 18:02:35,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-22 18:02:35,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-22 18:02:35,687 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2023-11-22 18:02:35,688 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2023-11-22 18:02:35,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-22 18:02:35,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-22 18:02:35,689 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2023-11-22 18:02:35,689 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2023-11-22 18:02:35,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-22 18:02:35,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-22 18:02:35,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-22 18:02:35,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 18:02:35,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-22 18:02:35,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-22 18:02:35,690 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2023-11-22 18:02:35,690 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2023-11-22 18:02:35,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-22 18:02:35,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-22 18:02:35,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 18:02:35,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 18:02:35,796 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 18:02:35,798 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 18:02:36,033 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 18:02:36,069 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 18:02:36,069 INFO L309 CfgBuilder]: Removed 41 assume(true) statements. [2023-11-22 18:02:36,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:02:36 BoogieIcfgContainer [2023-11-22 18:02:36,069 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 18:02:36,071 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 18:02:36,071 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 18:02:36,074 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 18:02:36,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:02:35" (1/3) ... [2023-11-22 18:02:36,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16dc4326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:02:36, skipping insertion in model container [2023-11-22 18:02:36,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:02:35" (2/3) ... [2023-11-22 18:02:36,075 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16dc4326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:02:36, skipping insertion in model container [2023-11-22 18:02:36,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:02:36" (3/3) ... [2023-11-22 18:02:36,075 INFO L112 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-2.i [2023-11-22 18:02:36,091 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 18:02:36,092 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 18:02:36,140 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 18:02:36,145 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@51f4d016, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 18:02:36,145 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 18:02:36,148 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 78 states have (on average 1.8461538461538463) internal successors, (144), 97 states have internal predecessors, (144), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-22 18:02:36,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-22 18:02:36,153 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:02:36,153 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:02:36,153 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:02:36,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:02:36,157 INFO L85 PathProgramCache]: Analyzing trace with hash -754496073, now seen corresponding path program 1 times [2023-11-22 18:02:36,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:02:36,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329990767] [2023-11-22 18:02:36,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:02:36,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:02:36,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:02:36,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 18:02:36,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:02:36,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329990767] [2023-11-22 18:02:36,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329990767] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:02:36,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:02:36,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 18:02:36,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258484458] [2023-11-22 18:02:36,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:02:36,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-22 18:02:36,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:02:36,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-22 18:02:36,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 18:02:36,315 INFO L87 Difference]: Start difference. First operand has 107 states, 78 states have (on average 1.8461538461538463) internal successors, (144), 97 states have internal predecessors, (144), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:02:36,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:02:36,390 INFO L93 Difference]: Finished difference Result 210 states and 377 transitions. [2023-11-22 18:02:36,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 18:02:36,393 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-22 18:02:36,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:02:36,399 INFO L225 Difference]: With dead ends: 210 [2023-11-22 18:02:36,400 INFO L226 Difference]: Without dead ends: 99 [2023-11-22 18:02:36,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 18:02:36,409 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 18:02:36,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 18:02:36,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-22 18:02:36,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-11-22 18:02:36,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 89 states have internal predecessors, (94), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-22 18:02:36,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 120 transitions. [2023-11-22 18:02:36,451 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 120 transitions. Word has length 8 [2023-11-22 18:02:36,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:02:36,452 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 120 transitions. [2023-11-22 18:02:36,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:02:36,452 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2023-11-22 18:02:36,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-22 18:02:36,454 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:02:36,454 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:02:36,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 18:02:36,454 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:02:36,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:02:36,455 INFO L85 PathProgramCache]: Analyzing trace with hash 437181209, now seen corresponding path program 1 times [2023-11-22 18:02:36,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:02:36,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056285880] [2023-11-22 18:02:36,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:02:36,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:02:36,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:02:36,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-22 18:02:36,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:02:36,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 18:02:36,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:02:36,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056285880] [2023-11-22 18:02:36,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056285880] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:02:36,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:02:36,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 18:02:36,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131690145] [2023-11-22 18:02:36,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:02:36,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 18:02:36,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:02:36,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 18:02:36,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 18:02:36,727 INFO L87 Difference]: Start difference. First operand 99 states and 120 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 18:02:37,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:02:37,027 INFO L93 Difference]: Finished difference Result 101 states and 121 transitions. [2023-11-22 18:02:37,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 18:02:37,027 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2023-11-22 18:02:37,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:02:37,029 INFO L225 Difference]: With dead ends: 101 [2023-11-22 18:02:37,029 INFO L226 Difference]: Without dead ends: 98 [2023-11-22 18:02:37,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-22 18:02:37,033 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 233 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 18:02:37,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 87 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 18:02:37,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-22 18:02:37,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-11-22 18:02:37,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 88 states have internal predecessors, (93), 20 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-22 18:02:37,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2023-11-22 18:02:37,053 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 17 [2023-11-22 18:02:37,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:02:37,055 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2023-11-22 18:02:37,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 18:02:37,055 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2023-11-22 18:02:37,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-22 18:02:37,056 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:02:37,056 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:02:37,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-22 18:02:37,057 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:02:37,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:02:37,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1443607003, now seen corresponding path program 1 times [2023-11-22 18:02:37,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:02:37,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572046597] [2023-11-22 18:02:37,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:02:37,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:02:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:02:37,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-22 18:02:37,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:02:37,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 18:02:37,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:02:37,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572046597] [2023-11-22 18:02:37,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572046597] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:02:37,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:02:37,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-22 18:02:37,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648733968] [2023-11-22 18:02:37,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:02:37,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-22 18:02:37,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:02:37,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-22 18:02:37,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-22 18:02:37,601 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 18:02:38,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:02:38,395 INFO L93 Difference]: Finished difference Result 187 states and 224 transitions. [2023-11-22 18:02:38,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-22 18:02:38,395 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2023-11-22 18:02:38,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:02:38,399 INFO L225 Difference]: With dead ends: 187 [2023-11-22 18:02:38,399 INFO L226 Difference]: Without dead ends: 181 [2023-11-22 18:02:38,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2023-11-22 18:02:38,411 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 462 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-22 18:02:38,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 122 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-22 18:02:38,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-11-22 18:02:38,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 161. [2023-11-22 18:02:38,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 133 states have (on average 1.263157894736842) internal successors, (168), 147 states have internal predecessors, (168), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-22 18:02:38,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 198 transitions. [2023-11-22 18:02:38,440 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 198 transitions. Word has length 20 [2023-11-22 18:02:38,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:02:38,440 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 198 transitions. [2023-11-22 18:02:38,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 18:02:38,441 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 198 transitions. [2023-11-22 18:02:38,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-22 18:02:38,441 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:02:38,441 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:02:38,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-22 18:02:38,442 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:02:38,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:02:38,442 INFO L85 PathProgramCache]: Analyzing trace with hash 722118342, now seen corresponding path program 1 times [2023-11-22 18:02:38,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:02:38,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539623677] [2023-11-22 18:02:38,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:02:38,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:02:38,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:02:38,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-22 18:02:38,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:02:39,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 18:02:39,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:02:39,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539623677] [2023-11-22 18:02:39,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539623677] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:02:39,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:02:39,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-22 18:02:39,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549851107] [2023-11-22 18:02:39,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:02:39,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-22 18:02:39,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:02:39,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-22 18:02:39,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-22 18:02:39,070 INFO L87 Difference]: Start difference. First operand 161 states and 198 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 18:02:39,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:02:39,789 INFO L93 Difference]: Finished difference Result 259 states and 314 transitions. [2023-11-22 18:02:39,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-22 18:02:39,789 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2023-11-22 18:02:39,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:02:39,791 INFO L225 Difference]: With dead ends: 259 [2023-11-22 18:02:39,791 INFO L226 Difference]: Without dead ends: 256 [2023-11-22 18:02:39,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2023-11-22 18:02:39,793 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 299 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-22 18:02:39,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 160 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-22 18:02:39,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2023-11-22 18:02:39,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 238. [2023-11-22 18:02:39,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 203 states have (on average 1.2561576354679802) internal successors, (255), 218 states have internal predecessors, (255), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-22 18:02:39,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 294 transitions. [2023-11-22 18:02:39,828 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 294 transitions. Word has length 23 [2023-11-22 18:02:39,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:02:39,829 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 294 transitions. [2023-11-22 18:02:39,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 18:02:39,829 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 294 transitions. [2023-11-22 18:02:39,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-22 18:02:39,830 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:02:39,830 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:02:39,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-22 18:02:39,830 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:02:39,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:02:39,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1115915285, now seen corresponding path program 1 times [2023-11-22 18:02:39,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:02:39,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177550607] [2023-11-22 18:02:39,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:02:39,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:02:39,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:02:40,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-22 18:02:40,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:02:40,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 18:02:40,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:02:40,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177550607] [2023-11-22 18:02:40,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177550607] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:02:40,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:02:40,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-22 18:02:40,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067489195] [2023-11-22 18:02:40,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:02:40,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-22 18:02:40,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:02:40,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-22 18:02:40,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2023-11-22 18:02:40,419 INFO L87 Difference]: Start difference. First operand 238 states and 294 transitions. Second operand has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 18:02:41,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:02:41,152 INFO L93 Difference]: Finished difference Result 258 states and 312 transitions. [2023-11-22 18:02:41,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-22 18:02:41,152 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2023-11-22 18:02:41,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:02:41,153 INFO L225 Difference]: With dead ends: 258 [2023-11-22 18:02:41,153 INFO L226 Difference]: Without dead ends: 255 [2023-11-22 18:02:41,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2023-11-22 18:02:41,154 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 344 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-22 18:02:41,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 160 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-22 18:02:41,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2023-11-22 18:02:41,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 238. [2023-11-22 18:02:41,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 203 states have (on average 1.251231527093596) internal successors, (254), 218 states have internal predecessors, (254), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-22 18:02:41,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 293 transitions. [2023-11-22 18:02:41,182 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 293 transitions. Word has length 26 [2023-11-22 18:02:41,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:02:41,183 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 293 transitions. [2023-11-22 18:02:41,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 18:02:41,184 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 293 transitions. [2023-11-22 18:02:41,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-22 18:02:41,187 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:02:41,187 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:02:41,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-22 18:02:41,187 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:02:41,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:02:41,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1422251983, now seen corresponding path program 1 times [2023-11-22 18:02:41,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:02:41,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369408375] [2023-11-22 18:02:41,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:02:41,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:02:41,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:02:41,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-22 18:02:41,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:02:41,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 18:02:41,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:02:41,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369408375] [2023-11-22 18:02:41,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369408375] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:02:41,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:02:41,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-22 18:02:41,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640092679] [2023-11-22 18:02:41,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:02:41,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-22 18:02:41,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:02:41,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-22 18:02:41,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-11-22 18:02:41,809 INFO L87 Difference]: Start difference. First operand 238 states and 293 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 18:02:42,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:02:42,610 INFO L93 Difference]: Finished difference Result 257 states and 310 transitions. [2023-11-22 18:02:42,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-22 18:02:42,624 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2023-11-22 18:02:42,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:02:42,625 INFO L225 Difference]: With dead ends: 257 [2023-11-22 18:02:42,625 INFO L226 Difference]: Without dead ends: 254 [2023-11-22 18:02:42,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2023-11-22 18:02:42,626 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 332 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-22 18:02:42,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 173 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-22 18:02:42,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-11-22 18:02:42,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 238. [2023-11-22 18:02:42,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 203 states have (on average 1.2463054187192117) internal successors, (253), 218 states have internal predecessors, (253), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-22 18:02:42,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 292 transitions. [2023-11-22 18:02:42,648 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 292 transitions. Word has length 29 [2023-11-22 18:02:42,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:02:42,648 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 292 transitions. [2023-11-22 18:02:42,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 18:02:42,648 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 292 transitions. [2023-11-22 18:02:42,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-22 18:02:42,649 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:02:42,649 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:02:42,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-22 18:02:42,650 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:02:42,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:02:42,650 INFO L85 PathProgramCache]: Analyzing trace with hash -678942440, now seen corresponding path program 1 times [2023-11-22 18:02:42,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:02:42,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508722259] [2023-11-22 18:02:42,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:02:42,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:02:42,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:02:43,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-22 18:02:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:02:43,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 18:02:43,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:02:43,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508722259] [2023-11-22 18:02:43,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508722259] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:02:43,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:02:43,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-22 18:02:43,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087871585] [2023-11-22 18:02:43,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:02:43,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-22 18:02:43,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:02:43,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-22 18:02:43,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-11-22 18:02:43,281 INFO L87 Difference]: Start difference. First operand 238 states and 292 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 18:02:44,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:02:44,072 INFO L93 Difference]: Finished difference Result 256 states and 308 transitions. [2023-11-22 18:02:44,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-22 18:02:44,073 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2023-11-22 18:02:44,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:02:44,074 INFO L225 Difference]: With dead ends: 256 [2023-11-22 18:02:44,074 INFO L226 Difference]: Without dead ends: 253 [2023-11-22 18:02:44,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2023-11-22 18:02:44,074 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 325 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-22 18:02:44,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 176 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1058 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-22 18:02:44,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2023-11-22 18:02:44,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 238. [2023-11-22 18:02:44,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 203 states have (on average 1.2413793103448276) internal successors, (252), 218 states have internal predecessors, (252), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-22 18:02:44,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 291 transitions. [2023-11-22 18:02:44,097 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 291 transitions. Word has length 32 [2023-11-22 18:02:44,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:02:44,097 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 291 transitions. [2023-11-22 18:02:44,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 18:02:44,098 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 291 transitions. [2023-11-22 18:02:44,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-22 18:02:44,103 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:02:44,103 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:02:44,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-22 18:02:44,103 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:02:44,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:02:44,103 INFO L85 PathProgramCache]: Analyzing trace with hash -58033664, now seen corresponding path program 1 times [2023-11-22 18:02:44,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:02:44,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838391894] [2023-11-22 18:02:44,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:02:44,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:02:44,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:02:44,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-22 18:02:44,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:02:44,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-22 18:02:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:02:44,903 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 18:02:44,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:02:44,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838391894] [2023-11-22 18:02:44,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838391894] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:02:44,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476639045] [2023-11-22 18:02:44,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:02:44,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:02:44,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:02:44,909 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) [2023-11-22 18:02:44,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-22 18:02:45,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:02:45,035 INFO L262 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 79 conjunts are in the unsatisfiable core [2023-11-22 18:02:45,045 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:02:45,132 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-22 18:02:45,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-22 18:02:45,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-22 18:02:45,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-22 18:02:45,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2023-11-22 18:02:45,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:02:45,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 26 [2023-11-22 18:02:45,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2023-11-22 18:02:45,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2023-11-22 18:02:45,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 90 [2023-11-22 18:02:45,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 65 [2023-11-22 18:02:45,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:02:45,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 47 [2023-11-22 18:02:45,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-11-22 18:02:45,637 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-22 18:02:45,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 45 [2023-11-22 18:02:45,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-22 18:02:45,713 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-22 18:02:45,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-22 18:02:45,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-22 18:02:45,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2023-11-22 18:02:45,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:02:45,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 55 [2023-11-22 18:02:45,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:02:45,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2023-11-22 18:02:45,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 11 [2023-11-22 18:02:45,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-22 18:02:46,000 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 7 [2023-11-22 18:02:46,019 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 18:02:46,019 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:02:46,112 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_577 (Array Int Int))) (< |c_~#gl_list~0.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_577) |c_~#gl_list~0.base|) (+ |c_~#gl_list~0.offset| 4)))) is different from false [2023-11-22 18:02:52,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476639045] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:02:52,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 18:02:52,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2023-11-22 18:02:52,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838001891] [2023-11-22 18:02:52,275 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 18:02:52,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-22 18:02:52,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:02:52,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-22 18:02:52,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=924, Unknown=14, NotChecked=62, Total=1122 [2023-11-22 18:02:52,276 INFO L87 Difference]: Start difference. First operand 238 states and 291 transitions. Second operand has 28 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 18 states have internal predecessors, (52), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-22 18:02:54,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-22 18:02:59,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-22 18:02:59,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:02:59,611 INFO L93 Difference]: Finished difference Result 442 states and 529 transitions. [2023-11-22 18:02:59,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-22 18:02:59,611 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 18 states have internal predecessors, (52), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 33 [2023-11-22 18:02:59,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:02:59,613 INFO L225 Difference]: With dead ends: 442 [2023-11-22 18:02:59,613 INFO L226 Difference]: Without dead ends: 439 [2023-11-22 18:02:59,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 678 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=423, Invalid=2297, Unknown=40, NotChecked=102, Total=2862 [2023-11-22 18:02:59,615 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 1711 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 2160 mSolverCounterSat, 315 mSolverCounterUnsat, 246 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1717 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 2721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 315 IncrementalHoareTripleChecker+Valid, 2160 IncrementalHoareTripleChecker+Invalid, 246 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2023-11-22 18:02:59,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1717 Valid, 253 Invalid, 2721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [315 Valid, 2160 Invalid, 246 Unknown, 0 Unchecked, 6.3s Time] [2023-11-22 18:02:59,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2023-11-22 18:02:59,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 327. [2023-11-22 18:02:59,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 282 states have (on average 1.2375886524822695) internal successors, (349), 298 states have internal predecessors, (349), 34 states have call successors, (34), 12 states have call predecessors, (34), 10 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-22 18:02:59,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 399 transitions. [2023-11-22 18:02:59,661 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 399 transitions. Word has length 33 [2023-11-22 18:02:59,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:02:59,662 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 399 transitions. [2023-11-22 18:02:59,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 18 states have internal predecessors, (52), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-22 18:02:59,662 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 399 transitions. [2023-11-22 18:02:59,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-22 18:02:59,663 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:02:59,663 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:02:59,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-22 18:02:59,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:02:59,874 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:02:59,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:02:59,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1581408063, now seen corresponding path program 1 times [2023-11-22 18:02:59,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:02:59,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921246211] [2023-11-22 18:02:59,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:02:59,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:02:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:03:00,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-22 18:03:00,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:03:00,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 18:03:00,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:03:00,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921246211] [2023-11-22 18:03:00,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921246211] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:03:00,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:03:00,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-22 18:03:00,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244083585] [2023-11-22 18:03:00,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:03:00,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-22 18:03:00,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:03:00,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-22 18:03:00,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-11-22 18:03:00,313 INFO L87 Difference]: Start difference. First operand 327 states and 399 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 18:03:01,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:03:01,153 INFO L93 Difference]: Finished difference Result 341 states and 411 transitions. [2023-11-22 18:03:01,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-22 18:03:01,154 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2023-11-22 18:03:01,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:03:01,155 INFO L225 Difference]: With dead ends: 341 [2023-11-22 18:03:01,155 INFO L226 Difference]: Without dead ends: 338 [2023-11-22 18:03:01,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2023-11-22 18:03:01,156 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 399 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-22 18:03:01,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 163 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 978 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-22 18:03:01,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2023-11-22 18:03:01,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 327. [2023-11-22 18:03:01,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 282 states have (on average 1.2340425531914894) internal successors, (348), 298 states have internal predecessors, (348), 34 states have call successors, (34), 12 states have call predecessors, (34), 10 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-22 18:03:01,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 398 transitions. [2023-11-22 18:03:01,199 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 398 transitions. Word has length 35 [2023-11-22 18:03:01,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:03:01,199 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 398 transitions. [2023-11-22 18:03:01,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 18:03:01,199 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 398 transitions. [2023-11-22 18:03:01,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-22 18:03:01,200 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:03:01,200 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:03:01,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-22 18:03:01,200 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:03:01,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:03:01,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1738679921, now seen corresponding path program 1 times [2023-11-22 18:03:01,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:03:01,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356233302] [2023-11-22 18:03:01,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:03:01,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:03:01,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:03:01,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-22 18:03:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:03:02,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-22 18:03:02,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:03:02,089 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 18:03:02,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:03:02,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356233302] [2023-11-22 18:03:02,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356233302] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:03:02,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511145184] [2023-11-22 18:03:02,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:03:02,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:03:02,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:03:02,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) [2023-11-22 18:03:02,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 [2023-11-22 18:03:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:03:02,242 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 73 conjunts are in the unsatisfiable core [2023-11-22 18:03:02,246 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:03:02,273 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-22 18:03:02,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-22 18:03:02,316 INFO L378 Elim1Store]: Elim1 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 16 treesize of output 11 [2023-11-22 18:03:02,326 INFO L378 Elim1Store]: Elim1 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 16 treesize of output 11 [2023-11-22 18:03:02,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 90 [2023-11-22 18:03:02,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:03:02,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 50 treesize of output 36 [2023-11-22 18:03:02,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2023-11-22 18:03:02,581 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-22 18:03:02,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 39 [2023-11-22 18:03:02,679 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-22 18:03:02,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-22 18:03:02,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 25 [2023-11-22 18:03:02,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 56 treesize of output 52 [2023-11-22 18:03:02,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 43 treesize of output 39 [2023-11-22 18:03:02,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 43 treesize of output 39 [2023-11-22 18:03:02,800 INFO L378 Elim1Store]: Elim1 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 49 treesize of output 45 [2023-11-22 18:03:02,804 INFO L378 Elim1Store]: Elim1 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 36 treesize of output 32 [2023-11-22 18:03:04,477 INFO L349 Elim1Store]: treesize reduction 215, result has 4.9 percent of original size [2023-11-22 18:03:04,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 8 case distinctions, treesize of input 184 treesize of output 449 [2023-11-22 18:03:04,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:03:04,540 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:03:04,544 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:03:04,545 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:03:04,546 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:03:04,547 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:03:04,547 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:03:04,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 7 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 419 treesize of output 948 [2023-11-22 18:03:04,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:03:04,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:03:04,710 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:03:04,730 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:03:04,739 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:03:04,799 INFO L349 Elim1Store]: treesize reduction 114, result has 0.9 percent of original size [2023-11-22 18:03:04,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 276 treesize of output 587 [2023-11-22 18:03:06,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:03:06,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:03:06,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:03:06,128 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 18:03:06,132 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-22 18:03:06,160 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_~#gl_list~0.offset| 0) (= 3 |c_~#gl_list~0.base|) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| 3))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (.cse4 (select .cse5 0))) (or (exists ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int)) (v_arrayElimCell_40 Int) (v_arrayElimCell_39 Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| 3 v_DerPreprocessor_8))) (let ((.cse0 (store .cse9 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_7))) (let ((.cse3 (select .cse0 3))) (let ((.cse1 (select .cse3 0))) (let ((.cse6 (store (store (store |c_#memory_$Pointer$#1.base| .cse1 v_DerPreprocessor_20) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_21) 3 v_DerPreprocessor_22)) (.cse2 (store .cse3 (+ 4 v_arrayElimCell_40) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (.cse7 (store (store (store |c_#memory_$Pointer$#1.base| .cse1 v_DerPreprocessor_23) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_24) 3 v_DerPreprocessor_25)) (.cse10 (select .cse3 4))) (and (= (select .cse0 .cse1) (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_18) 3 .cse2) .cse1) (+ 4 v_arrayElimCell_39) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= (store .cse3 0 .cse4) .cse5) (= .cse1 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (= v_DerPreprocessor_20 (select .cse6 .cse1)) (= (select .cse7 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse8) (= v_DerPreprocessor_22 (store (select (store .cse9 |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse8) 3) 0 (select v_DerPreprocessor_22 0))) (not (= .cse10 0)) (= .cse8 (select .cse6 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= v_DerPreprocessor_25 (store (select (store (store |c_#memory_$Pointer$#1.base| 3 .cse2) |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse8) 3) 0 (select v_DerPreprocessor_25 0))) (= (select .cse7 .cse1) v_DerPreprocessor_23) (= .cse1 .cse10)))))))) (exists ((v_arrayElimCell_40 Int) (v_DerPreprocessor_29 Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_arrayElimCell_39 Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse18 (store (store (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_29 v_DerPreprocessor_34) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_35) 3 v_DerPreprocessor_36))) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_29 (select .cse18 v_DerPreprocessor_29)))) (let ((.cse19 (store (store (store .cse16 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_7) 3 v_DerPreprocessor_8) v_DerPreprocessor_6 v_DerPreprocessor_9))) (let ((.cse17 (select .cse19 3))) (let ((.cse13 (select .cse17 0))) (let ((.cse14 (select .cse19 .cse13)) (.cse11 (store |c_#memory_$Pointer$#1.base| .cse13 (select .cse18 .cse13))) (.cse12 (store .cse17 (+ 4 v_arrayElimCell_40) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (.cse15 (select .cse17 4))) (and (= (store (select (store (store .cse11 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_27) 3 .cse12) .cse13) (+ 4 v_arrayElimCell_39) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse14) (= .cse15 .cse13) (= .cse8 (select (store (store .cse16 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_31) 3 v_DerPreprocessor_32) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= v_DerPreprocessor_32 (store .cse17 0 (select v_DerPreprocessor_32 0))) (= .cse8 (select .cse18 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= v_DerPreprocessor_29 .cse13) (= .cse19 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_27) 3 .cse17) .cse13 .cse14)) (= (store (select (store (store (store .cse16 3 v_DerPreprocessor_8) v_DerPreprocessor_6 v_DerPreprocessor_9) |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse8) 3) 0 .cse4) .cse5) (= (store (select (store (store .cse11 3 .cse12) |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse8) 3) 0 (select v_DerPreprocessor_36 0)) v_DerPreprocessor_36) (not (= .cse15 0)) (not (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse13)) (= v_DerPreprocessor_6 .cse13) (not (= v_DerPreprocessor_29 3)))))))))) (exists ((v_arrayElimCell_40 Int) (v_DerPreprocessor_10 (Array Int Int)) (v_arrayElimCell_39 Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse26 (store |c_#memory_$Pointer$#1.base| 3 v_DerPreprocessor_8))) (let ((.cse25 (store .cse26 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_7))) (let ((.cse20 (select .cse25 3))) (let ((.cse21 (select .cse20 0))) (let ((.cse23 (store (store (store |c_#memory_$Pointer$#1.base| .cse21 v_DerPreprocessor_15) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_16) 3 v_DerPreprocessor_17)) (.cse22 (store (store (store |c_#memory_$Pointer$#1.base| .cse21 v_DerPreprocessor_12) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_13) 3 v_DerPreprocessor_14)) (.cse24 (select .cse20 4))) (and (= (store .cse20 0 .cse4) .cse5) (= .cse21 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (= v_DerPreprocessor_17 (store (store .cse20 (+ 4 v_arrayElimCell_40) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) 0 (select v_DerPreprocessor_17 0))) (= (select .cse22 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse8) (= (select .cse23 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse8) (not (= .cse24 0)) (= v_DerPreprocessor_15 (select .cse23 .cse21)) (= (select .cse25 .cse21) (store v_DerPreprocessor_10 (+ 4 v_arrayElimCell_39) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= v_DerPreprocessor_12 (select .cse22 .cse21)) (= .cse21 .cse24) (= v_DerPreprocessor_14 (store (select (store .cse26 |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse8) 3) 0 (select v_DerPreprocessor_14 0)))))))))) (exists ((v_arrayElimCell_40 Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (v_arrayElimCell_39 Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (let ((.cse33 (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_7) 3 v_DerPreprocessor_8) v_DerPreprocessor_6 v_DerPreprocessor_9))) (let ((.cse32 (select .cse33 3))) (let ((.cse28 (select .cse32 0))) (let ((.cse30 (store |c_#memory_$Pointer$#1.base| .cse28 v_DerPreprocessor_26)) (.cse31 (store .cse32 (+ 4 v_arrayElimCell_40) |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (let ((.cse27 (select .cse32 4)) (.cse29 (select (store (store .cse30 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_27) 3 .cse31) .cse28)) (.cse34 (store (store (store |c_#memory_$Pointer$#1.base| .cse28 v_DerPreprocessor_41) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_42) 3 v_DerPreprocessor_43))) (and (= .cse27 .cse28) (= (store (select (store (store (store |c_#memory_$Pointer$#1.base| 3 v_DerPreprocessor_8) v_DerPreprocessor_6 v_DerPreprocessor_9) |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse8) 3) 0 (select v_DerPreprocessor_43 0)) v_DerPreprocessor_43) (= v_DerPreprocessor_26 .cse29) (= (store (select (store (store .cse30 3 .cse31) |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse8) 3) 0 (select v_DerPreprocessor_45 0)) v_DerPreprocessor_45) (not (= .cse27 0)) (= (store .cse32 0 .cse4) .cse5) (= (select .cse33 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) v_DerPreprocessor_7) (= v_DerPreprocessor_6 .cse28) (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse28) (= v_DerPreprocessor_41 (select .cse34 .cse28)) (= (store .cse29 (+ 4 v_arrayElimCell_39) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (select .cse33 .cse28)) (= (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_44) 3 v_DerPreprocessor_45) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse8) (= .cse8 (select .cse34 |c_ULTIMATE.start_gl_insert_~node~1#1.base|))))))))) (exists ((v_DerPreprocessor_33 Int) (v_arrayElimCell_40 Int) (v_DerPreprocessor_29 Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_arrayElimCell_39 Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse44 (store |c_#memory_$Pointer$#1.base| v_DerPreprocessor_33 v_DerPreprocessor_34))) (let ((.cse43 (store (store .cse44 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_35) 3 v_DerPreprocessor_36))) (let ((.cse35 (store .cse44 v_DerPreprocessor_29 (select .cse43 v_DerPreprocessor_29)))) (let ((.cse39 (store (store (store .cse35 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_7) 3 v_DerPreprocessor_8) v_DerPreprocessor_6 v_DerPreprocessor_9))) (let ((.cse36 (select .cse39 3))) (let ((.cse37 (select .cse36 0))) (let ((.cse40 (store |c_#memory_$Pointer$#1.base| .cse37 (select .cse43 .cse37))) (.cse41 (store .cse36 (+ 4 v_arrayElimCell_40) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (.cse38 (select .cse39 .cse37)) (.cse42 (select .cse36 4))) (and (= .cse8 (select (store (store .cse35 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_31) 3 v_DerPreprocessor_32) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_27) 3 .cse36) .cse37 .cse38) .cse39) (= v_DerPreprocessor_36 (store (select (store (store .cse40 3 .cse41) |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse8) 3) 0 (select v_DerPreprocessor_36 0))) (not (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_29)) (= (store .cse36 0 (select v_DerPreprocessor_32 0)) v_DerPreprocessor_32) (= .cse37 .cse42) (= .cse37 v_DerPreprocessor_6) (= (select .cse43 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse8) (= .cse37 v_DerPreprocessor_33) (= (store (select (store (store .cse40 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_27) 3 .cse41) .cse37) (+ 4 v_arrayElimCell_39) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse38) (= (store (select (store (store (store .cse35 3 v_DerPreprocessor_8) v_DerPreprocessor_6 v_DerPreprocessor_9) |c_ULTIMATE.start_gl_insert_~node~1#1.base| .cse8) 3) 0 .cse4) .cse5) (= .cse37 v_DerPreprocessor_29) (not (= v_DerPreprocessor_29 3)) (not (= .cse42 0)))))))))))))) (not (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| 3))) is different from true [2023-11-22 18:03:06,243 INFO L190 IndexEqualityManager]: detected not equals via solver Killed by 15