./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/sll-buckets-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/forester-heap/sll-buckets-1.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 c6b726a83620fff2a21a6dbfdec50e244c1786dd86dd76b1719515a59b3627ac --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 19:33:05,831 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 19:33:05,920 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 19:33:05,927 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 19:33:05,928 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 19:33:05,965 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 19:33:05,967 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 19:33:05,968 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 19:33:05,968 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 19:33:05,970 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 19:33:05,970 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 19:33:05,971 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 19:33:05,971 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 19:33:05,971 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 19:33:05,972 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 19:33:05,974 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 19:33:05,974 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 19:33:05,974 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 19:33:05,975 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 19:33:05,975 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 19:33:05,975 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 19:33:05,979 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 19:33:05,979 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 19:33:05,979 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 19:33:05,979 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 19:33:05,979 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 19:33:05,980 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 19:33:05,980 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 19:33:05,980 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 19:33:05,981 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 19:33:05,981 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 19:33:05,982 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 19:33:05,982 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 19:33:05,982 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 19:33:05,983 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 19:33:05,983 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 19:33:05,983 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 19:33:05,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 19:33:05,984 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 19:33:05,984 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 19:33:05,984 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 19:33:05,985 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 19:33:05,985 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 -> c6b726a83620fff2a21a6dbfdec50e244c1786dd86dd76b1719515a59b3627ac [2024-11-11 19:33:06,239 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 19:33:06,267 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 19:33:06,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 19:33:06,271 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 19:33:06,271 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 19:33:06,272 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-buckets-1.i [2024-11-11 19:33:07,816 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 19:33:08,068 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 19:33:08,069 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i [2024-11-11 19:33:08,083 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a00cd3836/27130c0ce3f84b9e9f83bdfce6580dff/FLAG52a18d468 [2024-11-11 19:33:08,095 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a00cd3836/27130c0ce3f84b9e9f83bdfce6580dff [2024-11-11 19:33:08,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 19:33:08,098 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 19:33:08,100 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 19:33:08,100 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 19:33:08,106 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 19:33:08,106 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 07:33:08" (1/1) ... [2024-11-11 19:33:08,107 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@550cf6c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:33:08, skipping insertion in model container [2024-11-11 19:33:08,107 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 07:33:08" (1/1) ... [2024-11-11 19:33:08,157 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 19:33:08,464 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22663,22676] [2024-11-11 19:33:08,471 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22734,22747] [2024-11-11 19:33:08,472 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22862,22875] [2024-11-11 19:33:08,476 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[23275,23288] [2024-11-11 19:33:08,477 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[23364,23377] [2024-11-11 19:33:08,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 19:33:08,489 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 19:33:08,527 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22663,22676] [2024-11-11 19:33:08,528 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22734,22747] [2024-11-11 19:33:08,529 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22862,22875] [2024-11-11 19:33:08,532 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[23275,23288] [2024-11-11 19:33:08,533 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[23364,23377] [2024-11-11 19:33:08,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 19:33:08,571 INFO L204 MainTranslator]: Completed translation [2024-11-11 19:33:08,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:33:08 WrapperNode [2024-11-11 19:33:08,571 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 19:33:08,573 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 19:33:08,573 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 19:33:08,573 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 19:33:08,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:33:08" (1/1) ... [2024-11-11 19:33:08,598 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:33:08" (1/1) ... [2024-11-11 19:33:08,631 INFO L138 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 155 [2024-11-11 19:33:08,632 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 19:33:08,633 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 19:33:08,633 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 19:33:08,633 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 19:33:08,644 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:33:08" (1/1) ... [2024-11-11 19:33:08,645 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:33:08" (1/1) ... [2024-11-11 19:33:08,648 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:33:08" (1/1) ... [2024-11-11 19:33:08,686 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 16 writes are split as follows [0, 16]. [2024-11-11 19:33:08,686 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:33:08" (1/1) ... [2024-11-11 19:33:08,687 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:33:08" (1/1) ... [2024-11-11 19:33:08,699 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:33:08" (1/1) ... [2024-11-11 19:33:08,706 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:33:08" (1/1) ... [2024-11-11 19:33:08,708 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:33:08" (1/1) ... [2024-11-11 19:33:08,713 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:33:08" (1/1) ... [2024-11-11 19:33:08,716 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 19:33:08,719 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 19:33:08,719 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 19:33:08,719 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 19:33:08,720 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:33:08" (1/1) ... [2024-11-11 19:33:08,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 19:33:08,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:33:08,756 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 19:33:08,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 19:33:08,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-11 19:33:08,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-11 19:33:08,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-11 19:33:08,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-11 19:33:08,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-11 19:33:08,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 19:33:08,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-11 19:33:08,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-11 19:33:08,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-11 19:33:08,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-11 19:33:08,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-11 19:33:08,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 19:33:08,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 19:33:08,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 19:33:08,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 19:33:08,956 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 19:33:08,958 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 19:33:09,262 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2024-11-11 19:33:09,262 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 19:33:09,275 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 19:33:09,275 INFO L316 CfgBuilder]: Removed 15 assume(true) statements. [2024-11-11 19:33:09,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:33:09 BoogieIcfgContainer [2024-11-11 19:33:09,276 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 19:33:09,278 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 19:33:09,278 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 19:33:09,285 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 19:33:09,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 07:33:08" (1/3) ... [2024-11-11 19:33:09,286 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26c5d71f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 07:33:09, skipping insertion in model container [2024-11-11 19:33:09,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:33:08" (2/3) ... [2024-11-11 19:33:09,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26c5d71f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 07:33:09, skipping insertion in model container [2024-11-11 19:33:09,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:33:09" (3/3) ... [2024-11-11 19:33:09,288 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-buckets-1.i [2024-11-11 19:33:09,302 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 19:33:09,302 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-11-11 19:33:09,359 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 19:33:09,366 INFO L333 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, 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;@53118792, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 19:33:09,366 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-11 19:33:09,371 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 38 states have (on average 1.868421052631579) internal successors, (71), 43 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:33:09,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-11 19:33:09,377 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:33:09,378 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:33:09,378 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 19:33:09,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:33:09,385 INFO L85 PathProgramCache]: Analyzing trace with hash 179510098, now seen corresponding path program 1 times [2024-11-11 19:33:09,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:33:09,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344532726] [2024-11-11 19:33:09,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:33:09,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:33:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:33:09,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:33:09,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:33:09,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344532726] [2024-11-11 19:33:09,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344532726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:33:09,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:33:09,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 19:33:09,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517842856] [2024-11-11 19:33:09,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:33:09,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 19:33:09,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:33:09,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 19:33:09,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 19:33:09,938 INFO L87 Difference]: Start difference. First operand has 44 states, 38 states have (on average 1.868421052631579) internal successors, (71), 43 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:33:10,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:33:10,036 INFO L93 Difference]: Finished difference Result 103 states and 173 transitions. [2024-11-11 19:33:10,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 19:33:10,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-11 19:33:10,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:33:10,047 INFO L225 Difference]: With dead ends: 103 [2024-11-11 19:33:10,047 INFO L226 Difference]: Without dead ends: 57 [2024-11-11 19:33:10,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 19:33:10,053 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 57 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:33:10,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 81 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:33:10,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-11 19:33:10,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2024-11-11 19:33:10,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 40 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:33:10,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2024-11-11 19:33:10,102 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 8 [2024-11-11 19:33:10,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:33:10,103 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2024-11-11 19:33:10,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:33:10,103 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2024-11-11 19:33:10,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-11 19:33:10,104 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:33:10,104 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:33:10,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 19:33:10,104 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 19:33:10,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:33:10,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1306111283, now seen corresponding path program 1 times [2024-11-11 19:33:10,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:33:10,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468029018] [2024-11-11 19:33:10,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:33:10,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:33:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:33:10,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:33:10,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:33:10,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468029018] [2024-11-11 19:33:10,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468029018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:33:10,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:33:10,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 19:33:10,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937995480] [2024-11-11 19:33:10,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:33:10,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 19:33:10,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:33:10,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 19:33:10,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 19:33:10,248 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:33:10,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:33:10,283 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2024-11-11 19:33:10,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 19:33:10,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-11 19:33:10,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:33:10,284 INFO L225 Difference]: With dead ends: 42 [2024-11-11 19:33:10,285 INFO L226 Difference]: Without dead ends: 40 [2024-11-11 19:33:10,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 19:33:10,287 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 4 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:33:10,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 70 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:33:10,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-11 19:33:10,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2024-11-11 19:33:10,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 38 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:33:10,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2024-11-11 19:33:10,296 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 9 [2024-11-11 19:33:10,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:33:10,297 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2024-11-11 19:33:10,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:33:10,298 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2024-11-11 19:33:10,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-11 19:33:10,300 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:33:10,301 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:33:10,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 19:33:10,301 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 19:33:10,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:33:10,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1834780084, now seen corresponding path program 1 times [2024-11-11 19:33:10,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:33:10,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95735828] [2024-11-11 19:33:10,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:33:10,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:33:10,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:33:11,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:33:11,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:33:11,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95735828] [2024-11-11 19:33:11,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95735828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:33:11,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:33:11,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 19:33:11,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680982152] [2024-11-11 19:33:11,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:33:11,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 19:33:11,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:33:11,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 19:33:11,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 19:33:11,086 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:33:11,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:33:11,243 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2024-11-11 19:33:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 19:33:11,243 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-11 19:33:11,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:33:11,244 INFO L225 Difference]: With dead ends: 58 [2024-11-11 19:33:11,245 INFO L226 Difference]: Without dead ends: 47 [2024-11-11 19:33:11,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 19:33:11,247 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 17 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:33:11,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 94 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:33:11,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-11 19:33:11,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2024-11-11 19:33:11,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 43 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:33:11,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2024-11-11 19:33:11,259 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 10 [2024-11-11 19:33:11,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:33:11,259 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2024-11-11 19:33:11,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:33:11,260 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2024-11-11 19:33:11,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-11 19:33:11,261 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:33:11,261 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:33:11,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 19:33:11,262 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 19:33:11,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:33:11,265 INFO L85 PathProgramCache]: Analyzing trace with hash 710639734, now seen corresponding path program 1 times [2024-11-11 19:33:11,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:33:11,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144552471] [2024-11-11 19:33:11,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:33:11,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:33:11,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:33:11,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:33:11,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:33:11,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144552471] [2024-11-11 19:33:11,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144552471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:33:11,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:33:11,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 19:33:11,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169136289] [2024-11-11 19:33:11,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:33:11,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 19:33:11,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:33:11,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 19:33:11,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 19:33:11,332 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:33:11,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:33:11,363 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2024-11-11 19:33:11,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 19:33:11,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-11 19:33:11,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:33:11,364 INFO L225 Difference]: With dead ends: 44 [2024-11-11 19:33:11,365 INFO L226 Difference]: Without dead ends: 42 [2024-11-11 19:33:11,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 19:33:11,366 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 17 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:33:11,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 47 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:33:11,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-11 19:33:11,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-11 19:33:11,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 40 states have (on average 1.275) internal successors, (51), 41 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:33:11,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2024-11-11 19:33:11,376 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 10 [2024-11-11 19:33:11,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:33:11,377 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2024-11-11 19:33:11,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:33:11,377 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2024-11-11 19:33:11,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-11 19:33:11,378 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:33:11,378 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:33:11,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 19:33:11,378 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 19:33:11,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:33:11,379 INFO L85 PathProgramCache]: Analyzing trace with hash 625501225, now seen corresponding path program 1 times [2024-11-11 19:33:11,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:33:11,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977063063] [2024-11-11 19:33:11,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:33:11,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:33:11,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:33:12,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:33:12,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:33:12,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977063063] [2024-11-11 19:33:12,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977063063] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:33:12,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388306336] [2024-11-11 19:33:12,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:33:12,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:33:12,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:33:12,184 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) [2024-11-11 19:33:12,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 19:33:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:33:12,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-11 19:33:12,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:33:12,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2024-11-11 19:33:12,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2024-11-11 19:33:12,463 INFO L349 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2024-11-11 19:33:12,463 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 2 case distinctions, treesize of input 85 treesize of output 84 [2024-11-11 19:33:12,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-11 19:33:12,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:33:12,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:33:12,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:33:12,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 40 treesize of output 42 [2024-11-11 19:33:12,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-11 19:33:12,513 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-11 19:33:12,513 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 35 treesize of output 27 [2024-11-11 19:33:12,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2024-11-11 19:33:12,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2024-11-11 19:33:12,937 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-11 19:33:12,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 75 treesize of output 59 [2024-11-11 19:33:12,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2024-11-11 19:33:13,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:33:13,296 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:33:13,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:33:13,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388306336] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:33:13,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:33:13,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-11-11 19:33:13,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479178305] [2024-11-11 19:33:13,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:33:13,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-11 19:33:13,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:33:13,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-11 19:33:13,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-11 19:33:13,593 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:33:14,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:33:14,204 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2024-11-11 19:33:14,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 19:33:14,205 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-11 19:33:14,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:33:14,205 INFO L225 Difference]: With dead ends: 64 [2024-11-11 19:33:14,205 INFO L226 Difference]: Without dead ends: 53 [2024-11-11 19:33:14,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-11-11 19:33:14,207 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 28 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 19:33:14,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 249 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 19:33:14,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-11 19:33:14,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2024-11-11 19:33:14,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 46 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:33:14,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2024-11-11 19:33:14,215 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 15 [2024-11-11 19:33:14,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:33:14,216 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2024-11-11 19:33:14,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:33:14,216 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2024-11-11 19:33:14,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-11 19:33:14,218 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:33:14,218 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:33:14,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 19:33:14,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:33:14,423 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 19:33:14,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:33:14,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1157082046, now seen corresponding path program 1 times [2024-11-11 19:33:14,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:33:14,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390201497] [2024-11-11 19:33:14,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:33:14,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:33:14,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:33:14,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:33:14,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:33:14,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390201497] [2024-11-11 19:33:14,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390201497] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:33:14,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493196702] [2024-11-11 19:33:14,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:33:14,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:33:14,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:33:14,706 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) [2024-11-11 19:33:14,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 19:33:14,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:33:14,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-11 19:33:14,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:33:14,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 24 treesize of output 28 [2024-11-11 19:33:14,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:33:14,887 INFO L349 Elim1Store]: treesize reduction 41, result has 10.9 percent of original size [2024-11-11 19:33:14,888 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 1 case distinctions, treesize of input 45 treesize of output 33 [2024-11-11 19:33:14,906 INFO L349 Elim1Store]: treesize reduction 44, result has 10.2 percent of original size [2024-11-11 19:33:14,907 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 36 [2024-11-11 19:33:14,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:33:14,946 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 34 treesize of output 25 [2024-11-11 19:33:14,961 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-11 19:33:14,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-11 19:33:14,989 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 33 treesize of output 24 [2024-11-11 19:33:15,054 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 24 treesize of output 12 [2024-11-11 19:33:15,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:33:15,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:33:15,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:33:15,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493196702] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:33:15,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:33:15,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2024-11-11 19:33:15,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987520979] [2024-11-11 19:33:15,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:33:15,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-11 19:33:15,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:33:15,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-11 19:33:15,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=114, Unknown=5, NotChecked=0, Total=156 [2024-11-11 19:33:15,153 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:33:15,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:33:15,467 INFO L93 Difference]: Finished difference Result 104 states and 125 transitions. [2024-11-11 19:33:15,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 19:33:15,468 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-11 19:33:15,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:33:15,469 INFO L225 Difference]: With dead ends: 104 [2024-11-11 19:33:15,469 INFO L226 Difference]: Without dead ends: 102 [2024-11-11 19:33:15,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=207, Unknown=5, NotChecked=0, Total=306 [2024-11-11 19:33:15,470 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 157 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 19:33:15,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 154 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 19:33:15,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-11 19:33:15,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 62. [2024-11-11 19:33:15,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 61 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:33:15,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2024-11-11 19:33:15,489 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 76 transitions. Word has length 16 [2024-11-11 19:33:15,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:33:15,489 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 76 transitions. [2024-11-11 19:33:15,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:33:15,489 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2024-11-11 19:33:15,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-11 19:33:15,490 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:33:15,490 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:33:15,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 19:33:15,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-11 19:33:15,691 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 19:33:15,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:33:15,692 INFO L85 PathProgramCache]: Analyzing trace with hash 442135079, now seen corresponding path program 2 times [2024-11-11 19:33:15,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:33:15,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568436701] [2024-11-11 19:33:15,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:33:15,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:33:15,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:33:16,237 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:33:16,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:33:16,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568436701] [2024-11-11 19:33:16,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568436701] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:33:16,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422924390] [2024-11-11 19:33:16,238 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 19:33:16,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:33:16,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:33:16,241 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:33:16,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 19:33:16,600 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 19:33:16,601 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 19:33:16,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-11 19:33:16,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:33:16,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:33:16,655 INFO L349 Elim1Store]: treesize reduction 35, result has 12.5 percent of original size [2024-11-11 19:33:16,655 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 1 case distinctions, treesize of input 35 treesize of output 20 [2024-11-11 19:33:16,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2024-11-11 19:33:16,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 11 [2024-11-11 19:33:16,701 INFO L349 Elim1Store]: treesize reduction 21, result has 4.5 percent of original size [2024-11-11 19:33:16,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 1 [2024-11-11 19:33:16,734 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-11 19:33:16,735 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 [2024-11-11 19:33:16,741 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 [2024-11-11 19:33:16,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 21 treesize of output 20 [2024-11-11 19:33:16,873 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 19:33:16,874 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 19:33:16,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422924390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:33:16,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 19:33:16,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2024-11-11 19:33:16,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135808442] [2024-11-11 19:33:16,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:33:16,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 19:33:16,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:33:16,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 19:33:16,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-11 19:33:16,876 INFO L87 Difference]: Start difference. First operand 62 states and 76 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:33:17,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:33:17,100 INFO L93 Difference]: Finished difference Result 141 states and 175 transitions. [2024-11-11 19:33:17,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 19:33:17,101 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-11 19:33:17,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:33:17,102 INFO L225 Difference]: With dead ends: 141 [2024-11-11 19:33:17,102 INFO L226 Difference]: Without dead ends: 106 [2024-11-11 19:33:17,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-11-11 19:33:17,103 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 84 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:33:17,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 134 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:33:17,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-11 19:33:17,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 76. [2024-11-11 19:33:17,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 75 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:33:17,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2024-11-11 19:33:17,118 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 18 [2024-11-11 19:33:17,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:33:17,118 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2024-11-11 19:33:17,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:33:17,119 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2024-11-11 19:33:17,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-11 19:33:17,120 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:33:17,120 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:33:17,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 19:33:17,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:33:17,322 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 19:33:17,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:33:17,322 INFO L85 PathProgramCache]: Analyzing trace with hash -482453053, now seen corresponding path program 1 times [2024-11-11 19:33:17,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:33:17,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936829508] [2024-11-11 19:33:17,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:33:17,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:33:17,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:33:17,721 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:33:17,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:33:17,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936829508] [2024-11-11 19:33:17,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936829508] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:33:17,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960789063] [2024-11-11 19:33:17,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:33:17,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:33:17,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:33:17,724 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:33:17,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 19:33:17,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:33:17,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-11 19:33:17,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:33:17,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2024-11-11 19:33:17,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2024-11-11 19:33:17,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:33:17,952 INFO L349 Elim1Store]: treesize reduction 39, result has 11.4 percent of original size [2024-11-11 19:33:17,953 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 1 case distinctions, treesize of input 43 treesize of output 38 [2024-11-11 19:33:17,979 INFO L349 Elim1Store]: treesize reduction 36, result has 32.1 percent of original size [2024-11-11 19:33:17,979 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 83 [2024-11-11 19:33:17,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 52 [2024-11-11 19:33:17,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 52 treesize of output 16 [2024-11-11 19:33:18,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 36 treesize of output 15 [2024-11-11 19:33:18,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-11 19:33:18,128 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 19:33:18,128 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 20 [2024-11-11 19:33:18,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:33:18,157 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2024-11-11 19:33:18,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 70 [2024-11-11 19:33:18,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:33:18,183 INFO L349 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2024-11-11 19:33:18,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2024-11-11 19:33:18,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 15 [2024-11-11 19:33:18,337 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 23 treesize of output 16 [2024-11-11 19:33:18,358 INFO L349 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2024-11-11 19:33:18,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 100 treesize of output 71 [2024-11-11 19:33:18,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 22 [2024-11-11 19:33:18,763 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2024-11-11 19:33:18,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 92 treesize of output 43 [2024-11-11 19:33:18,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-11 19:33:18,837 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:33:18,838 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:33:18,955 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_832 (Array Int Int)) (v_ArrVal_830 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (or (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~item~0#1.base|) .cse0 1)) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_832) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_830) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 8)) 1) (not (= v_ArrVal_832 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) .cse0 (select v_ArrVal_832 .cse0))))))) is different from false [2024-11-11 19:33:18,972 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:33:18,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2024-11-11 19:33:18,984 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_832 (Array Int Int)) (v_arrayElimArr_8 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_36| Int) (v_ArrVal_830 (Array Int Int))) (or (= (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_main_~item~0#1.base_36| v_arrayElimArr_8) (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~item~0#1.base_36| v_ArrVal_832) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~item~0#1.base_36| v_ArrVal_830) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) 1) (not (= v_ArrVal_832 (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~item~0#1.base_36|) 0 0) 4 (select v_ArrVal_832 4)))) (not (= (select v_arrayElimArr_8 4) 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_36|) 0)))) is different from false [2024-11-11 19:33:19,019 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:33:19,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960789063] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:33:19,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:33:19,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2024-11-11 19:33:19,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108162949] [2024-11-11 19:33:19,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:33:19,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-11 19:33:19,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:33:19,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-11 19:33:19,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=269, Unknown=2, NotChecked=66, Total=380 [2024-11-11 19:33:19,021 INFO L87 Difference]: Start difference. First operand 76 states and 93 transitions. Second operand has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:33:20,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:33:20,750 INFO L93 Difference]: Finished difference Result 238 states and 300 transitions. [2024-11-11 19:33:20,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-11 19:33:20,751 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-11 19:33:20,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:33:20,752 INFO L225 Difference]: With dead ends: 238 [2024-11-11 19:33:20,753 INFO L226 Difference]: Without dead ends: 203 [2024-11-11 19:33:20,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=260, Invalid=936, Unknown=2, NotChecked=134, Total=1332 [2024-11-11 19:33:20,754 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 334 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 297 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 19:33:20,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 414 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 579 Invalid, 0 Unknown, 297 Unchecked, 0.6s Time] [2024-11-11 19:33:20,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-11 19:33:20,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 130. [2024-11-11 19:33:20,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 128 states have (on average 1.28125) internal successors, (164), 129 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:33:20,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 164 transitions. [2024-11-11 19:33:20,791 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 164 transitions. Word has length 19 [2024-11-11 19:33:20,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:33:20,791 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 164 transitions. [2024-11-11 19:33:20,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:33:20,791 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 164 transitions. [2024-11-11 19:33:20,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-11 19:33:20,794 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:33:20,794 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:33:20,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-11 19:33:20,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:33:20,999 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 19:33:20,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:33:20,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1136543444, now seen corresponding path program 2 times [2024-11-11 19:33:21,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:33:21,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874693098] [2024-11-11 19:33:21,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:33:21,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:33:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:33:21,857 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:33:21,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:33:21,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874693098] [2024-11-11 19:33:21,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874693098] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:33:21,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164336178] [2024-11-11 19:33:21,858 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 19:33:21,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:33:21,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:33:21,864 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:33:21,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 19:33:22,285 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 19:33:22,286 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 19:33:22,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-11 19:33:22,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:33:22,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2024-11-11 19:33:22,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 40 [2024-11-11 19:33:22,351 INFO L349 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2024-11-11 19:33:22,355 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 2 case distinctions, treesize of input 78 treesize of output 79 [2024-11-11 19:33:22,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 31 [2024-11-11 19:33:22,398 INFO L349 Elim1Store]: treesize reduction 94, result has 34.3 percent of original size [2024-11-11 19:33:22,399 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 73 [2024-11-11 19:33:22,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 31 [2024-11-11 19:33:22,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2024-11-11 19:33:22,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 1 [2024-11-11 19:33:22,441 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-11 19:33:22,442 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 59 treesize of output 43 [2024-11-11 19:33:22,590 INFO L349 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2024-11-11 19:33:22,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 126 treesize of output 77 [2024-11-11 19:33:22,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:33:22,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 75 [2024-11-11 19:33:22,797 INFO L349 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2024-11-11 19:33:22,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 133 treesize of output 80 [2024-11-11 19:33:22,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:33:22,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2024-11-11 19:33:23,004 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:33:23,005 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:33:26,978 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:33:26,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164336178] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:33:26,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:33:26,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 19 [2024-11-11 19:33:26,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797510828] [2024-11-11 19:33:26,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:33:26,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-11 19:33:26,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:33:26,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-11 19:33:26,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2024-11-11 19:33:26,980 INFO L87 Difference]: Start difference. First operand 130 states and 164 transitions. Second operand has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:33:27,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:33:27,757 INFO L93 Difference]: Finished difference Result 156 states and 194 transitions. [2024-11-11 19:33:27,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 19:33:27,758 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-11 19:33:27,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:33:27,759 INFO L225 Difference]: With dead ends: 156 [2024-11-11 19:33:27,761 INFO L226 Difference]: Without dead ends: 145 [2024-11-11 19:33:27,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2024-11-11 19:33:27,762 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 42 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 19:33:27,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 215 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 19:33:27,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-11 19:33:27,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 135. [2024-11-11 19:33:27,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 133 states have (on average 1.2706766917293233) internal successors, (169), 134 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:33:27,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 169 transitions. [2024-11-11 19:33:27,798 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 169 transitions. Word has length 20 [2024-11-11 19:33:27,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:33:27,798 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 169 transitions. [2024-11-11 19:33:27,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:33:27,799 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 169 transitions. [2024-11-11 19:33:27,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-11 19:33:27,802 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:33:27,802 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:33:27,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-11 19:33:28,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:33:28,003 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 19:33:28,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:33:28,003 INFO L85 PathProgramCache]: Analyzing trace with hash -800532698, now seen corresponding path program 1 times [2024-11-11 19:33:28,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:33:28,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436967108] [2024-11-11 19:33:28,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:33:28,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:33:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:33:28,752 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:33:28,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:33:28,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436967108] [2024-11-11 19:33:28,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436967108] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:33:28,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999011386] [2024-11-11 19:33:28,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:33:28,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:33:28,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:33:28,754 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:33:28,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-11 19:33:28,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:33:28,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-11-11 19:33:28,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:33:28,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2024-11-11 19:33:28,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2024-11-11 19:33:28,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2024-11-11 19:33:29,022 INFO L349 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2024-11-11 19:33:29,023 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 2 case distinctions, treesize of input 172 treesize of output 148 [2024-11-11 19:33:29,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:33:29,048 INFO L349 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2024-11-11 19:33:29,048 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 1 case distinctions, treesize of input 45 treesize of output 23 [2024-11-11 19:33:29,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 25 [2024-11-11 19:33:29,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:33:29,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:33:29,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:33:29,082 INFO L349 Elim1Store]: treesize reduction 31, result has 13.9 percent of original size [2024-11-11 19:33:29,083 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 1 case distinctions, treesize of input 59 treesize of output 46 [2024-11-11 19:33:29,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-11 19:33:29,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:33:29,205 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-11 19:33:29,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 71 [2024-11-11 19:33:29,232 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2024-11-11 19:33:29,233 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 1 case distinctions, treesize of input 34 treesize of output 41 [2024-11-11 19:33:29,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:33:29,264 INFO L349 Elim1Store]: treesize reduction 32, result has 45.8 percent of original size [2024-11-11 19:33:29,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 41 [2024-11-11 19:33:29,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-11 19:33:29,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2024-11-11 19:33:29,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:33:29,337 INFO L349 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2024-11-11 19:33:29,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2024-11-11 19:33:29,463 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-11 19:33:29,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 69 [2024-11-11 19:33:29,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2024-11-11 19:33:29,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:33:29,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2024-11-11 19:33:29,955 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-11-11 19:33:29,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 114 treesize of output 53 [2024-11-11 19:33:29,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2024-11-11 19:33:30,017 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:33:30,017 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:33:30,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:33:30,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 63 [2024-11-11 19:33:30,342 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:33:30,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999011386] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:33:30,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:33:30,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2024-11-11 19:33:30,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532587187] [2024-11-11 19:33:30,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:33:30,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-11 19:33:30,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:33:30,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-11 19:33:30,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=433, Unknown=14, NotChecked=0, Total=506 [2024-11-11 19:33:30,345 INFO L87 Difference]: Start difference. First operand 135 states and 169 transitions. Second operand has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:33:32,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:33:32,309 INFO L93 Difference]: Finished difference Result 309 states and 388 transitions. [2024-11-11 19:33:32,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-11 19:33:32,309 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-11 19:33:32,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:33:32,311 INFO L225 Difference]: With dead ends: 309 [2024-11-11 19:33:32,311 INFO L226 Difference]: Without dead ends: 274 [2024-11-11 19:33:32,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=241, Invalid=1002, Unknown=17, NotChecked=0, Total=1260 [2024-11-11 19:33:32,313 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 260 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:33:32,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 499 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 19:33:32,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-11 19:33:32,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 191. [2024-11-11 19:33:32,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 189 states have (on average 1.291005291005291) internal successors, (244), 190 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:33:32,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 244 transitions. [2024-11-11 19:33:32,348 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 244 transitions. Word has length 21 [2024-11-11 19:33:32,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:33:32,348 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 244 transitions. [2024-11-11 19:33:32,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:33:32,349 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 244 transitions. [2024-11-11 19:33:32,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-11 19:33:32,350 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:33:32,350 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:33:32,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-11 19:33:32,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:33:32,551 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 19:33:32,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:33:32,551 INFO L85 PathProgramCache]: Analyzing trace with hash -962615628, now seen corresponding path program 1 times [2024-11-11 19:33:32,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:33:32,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627854318] [2024-11-11 19:33:32,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:33:32,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:33:32,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:33:33,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:33:33,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:33:33,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627854318] [2024-11-11 19:33:33,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627854318] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:33:33,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642665169] [2024-11-11 19:33:33,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:33:33,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:33:33,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:33:33,244 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:33:33,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-11 19:33:33,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:33:33,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-11 19:33:33,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:33:33,478 INFO L349 Elim1Store]: treesize reduction 33, result has 13.2 percent of original size [2024-11-11 19:33:33,480 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 1 case distinctions, treesize of input 24 treesize of output 18 [2024-11-11 19:33:33,527 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-11 19:33:33,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2024-11-11 19:33:33,662 INFO L349 Elim1Store]: treesize reduction 4, result has 91.8 percent of original size [2024-11-11 19:33:33,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 67 [2024-11-11 19:33:33,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-11 19:33:33,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-11 19:33:33,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-11 19:33:33,994 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-11 19:33:34,093 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 27 treesize of output 15 [2024-11-11 19:33:34,098 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-11 19:33:34,108 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 7 treesize of output 3 [2024-11-11 19:33:34,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:33:34,207 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:33:34,271 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1324 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4))) (or (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1324) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse0)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse0) 4)) (select v_ArrVal_1324 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 8))) (not (= v_ArrVal_1324 (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse0 (select v_ArrVal_1324 .cse0))))))) is different from false [2024-11-11 19:33:34,282 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1324 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4))) (or (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_1324) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse0)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse0) 4)) (select v_ArrVal_1324 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 8))) (not (= (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse0 (select v_ArrVal_1324 .cse0)) v_ArrVal_1324))))) is different from false [2024-11-11 19:33:34,306 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 108 treesize of output 102 [2024-11-11 19:33:34,313 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 170 treesize of output 158 [2024-11-11 19:33:34,420 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4)) (.cse8 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 8)) (.cse7 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) (.cse9 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base|)) (.cse10 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4))) (let ((.cse11 (forall ((v_ArrVal_1324 (Array Int Int)) (v_arrayElimCell_122 Int) (v_arrayElimCell_121 Int) (v_ArrVal_1323 Int)) (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse9 .cse10 v_ArrVal_1323)))) (or (= (select v_ArrVal_1324 .cse8) (select (select (store .cse17 |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_1324) v_arrayElimCell_121) (+ v_arrayElimCell_122 4))) (not (= (store (select .cse17 |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse7 (select v_ArrVal_1324 .cse7)) v_ArrVal_1324)))))) (.cse0 (= |c_ULTIMATE.start_main_~bcki~0#1.offset| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse12 (= |c_ULTIMATE.start_main_~bcki~0#1.base| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.cse1 (forall ((v_ArrVal_1324 (Array Int Int)) (v_arrayElimCell_122 Int) (v_arrayElimCell_121 Int) (v_ArrVal_1323 Int)) (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse9 .cse10 v_ArrVal_1323)))) (let ((.cse15 (select v_ArrVal_1324 .cse8)) (.cse14 (select (store .cse16 |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_1324) v_arrayElimCell_121))) (or (= (select .cse14 .cse3) .cse15) (= .cse15 (select .cse14 (+ v_arrayElimCell_122 4))) (not (= (store (select .cse16 |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse7 (select v_ArrVal_1324 .cse7)) v_ArrVal_1324)))))))) (and (or .cse0 .cse1) (forall ((v_ArrVal_1324 (Array Int Int)) (v_arrayElimCell_122 Int) (v_arrayElimCell_121 Int) (v_ArrVal_1323 Int)) (let ((.cse6 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse9 .cse10 v_ArrVal_1323)))) (let ((.cse5 (store .cse6 |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_1324))) (let ((.cse4 (select v_ArrVal_1324 .cse8)) (.cse2 (select .cse5 v_arrayElimCell_121))) (or (= (select .cse2 .cse3) .cse4) (= .cse4 (select (select .cse5 |c_ULTIMATE.start_main_~item~0#1.base|) .cse3)) (= .cse4 (select .cse2 (+ v_arrayElimCell_122 4))) (not (= (store (select .cse6 |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse7 (select v_ArrVal_1324 .cse7)) v_ArrVal_1324))))))) (or .cse0 .cse11) (or .cse12 .cse11) (or (forall ((v_ArrVal_1324 (Array Int Int)) (v_ArrVal_1323 Int)) (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse9 .cse10 v_ArrVal_1323)))) (or (= (select v_ArrVal_1324 .cse8) (select (select (store .cse13 |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~item~0#1.base|) .cse3)) (not (= (store (select .cse13 |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse7 (select v_ArrVal_1324 .cse7)) v_ArrVal_1324))))) (not .cse0) (not .cse12)) (or .cse12 .cse1)))) is different from false [2024-11-11 19:33:35,774 INFO L349 Elim1Store]: treesize reduction 31, result has 40.4 percent of original size [2024-11-11 19:33:35,774 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 2 case distinctions, treesize of input 190 treesize of output 144 [2024-11-11 19:33:35,801 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-11 19:33:35,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 208 treesize of output 204 [2024-11-11 19:33:35,927 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:33:35,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 156 treesize of output 169 [2024-11-11 19:33:36,301 INFO L349 Elim1Store]: treesize reduction 6, result has 95.4 percent of original size [2024-11-11 19:33:36,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 334 treesize of output 326 [2024-11-11 19:33:36,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-11 19:33:36,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642665169] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:33:36,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:33:36,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 32 [2024-11-11 19:33:36,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092083900] [2024-11-11 19:33:36,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:33:36,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-11 19:33:36,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:33:36,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-11 19:33:36,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=703, Unknown=3, NotChecked=168, Total=992 [2024-11-11 19:33:36,581 INFO L87 Difference]: Start difference. First operand 191 states and 244 transitions. Second operand has 32 states, 32 states have (on average 2.09375) internal successors, (67), 32 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:33:37,417 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4)) (.cse11 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 8)) (.cse13 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) (.cse1 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base|)) (.cse14 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4))) (let ((.cse9 (= |c_ULTIMATE.start_main_~bcki~0#1.base| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.cse16 (forall ((v_ArrVal_1324 (Array Int Int)) (v_arrayElimCell_122 Int) (v_arrayElimCell_121 Int) (v_ArrVal_1323 Int)) (let ((.cse24 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse1 .cse14 v_ArrVal_1323)))) (or (= (select v_ArrVal_1324 .cse11) (select (select (store .cse24 |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_1324) v_arrayElimCell_121) (+ v_arrayElimCell_122 4))) (not (= (store (select .cse24 |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse13 (select v_ArrVal_1324 .cse13)) v_ArrVal_1324)))))) (.cse15 (= |c_ULTIMATE.start_main_~bcki~0#1.offset| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse10 (forall ((v_ArrVal_1324 (Array Int Int)) (v_arrayElimCell_122 Int) (v_arrayElimCell_121 Int) (v_ArrVal_1323 Int)) (let ((.cse23 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse1 .cse14 v_ArrVal_1323)))) (let ((.cse22 (select v_ArrVal_1324 .cse11)) (.cse21 (select (store .cse23 |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_1324) v_arrayElimCell_121))) (or (= (select .cse21 .cse0) .cse22) (= .cse22 (select .cse21 (+ v_arrayElimCell_122 4))) (not (= (store (select .cse23 |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse13 (select v_ArrVal_1324 .cse13)) v_ArrVal_1324)))))))) (let ((.cse3 (or .cse15 .cse10)) (.cse4 (forall ((v_ArrVal_1324 (Array Int Int)) (v_arrayElimCell_122 Int) (v_arrayElimCell_121 Int) (v_ArrVal_1323 Int)) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse1 .cse14 v_ArrVal_1323)))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_1324))) (let ((.cse18 (select v_ArrVal_1324 .cse11)) (.cse17 (select .cse19 v_arrayElimCell_121))) (or (= (select .cse17 .cse0) .cse18) (= .cse18 (select (select .cse19 |c_ULTIMATE.start_main_~item~0#1.base|) .cse0)) (= .cse18 (select .cse17 (+ v_arrayElimCell_122 4))) (not (= (store (select .cse20 |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse13 (select v_ArrVal_1324 .cse13)) v_ArrVal_1324)))))))) (.cse5 (or .cse15 .cse16)) (.cse6 (or .cse9 .cse16)) (.cse7 (or (forall ((v_ArrVal_1324 (Array Int Int)) (v_ArrVal_1323 Int)) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse1 .cse14 v_ArrVal_1323)))) (or (= (select v_ArrVal_1324 .cse11) (select (select (store .cse12 |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~item~0#1.base|) .cse0)) (not (= (store (select .cse12 |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse13 (select v_ArrVal_1324 .cse13)) v_ArrVal_1324))))) (not .cse15) (not .cse9))) (.cse8 (or .cse9 .cse10))) (let ((.cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) (and (or (not (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~item~0#1.base|) .cse0) (select .cse1 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 8)))) .cse2) (not (= |c_ULTIMATE.start_main_~bucket~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) .cse3 (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~bucket~0#1.base|) 8) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~bucket~0#1.base|) 1) .cse4 .cse5 (= |c_ULTIMATE.start_main_~bucket~0#1.offset| 0) .cse6 .cse7 (or (not (= |c_ULTIMATE.start_main_#t~mem11#1| |c_ULTIMATE.start_main_#t~mem10#1|)) .cse2) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) .cse8))))) is different from false [2024-11-11 19:33:38,761 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4)) (.cse12 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 8)) (.cse14 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) (.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base|)) (.cse15 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4))) (let ((.cse10 (= |c_ULTIMATE.start_main_~bcki~0#1.base| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.cse17 (forall ((v_ArrVal_1324 (Array Int Int)) (v_arrayElimCell_122 Int) (v_arrayElimCell_121 Int) (v_ArrVal_1323 Int)) (let ((.cse25 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse2 .cse15 v_ArrVal_1323)))) (or (= (select v_ArrVal_1324 .cse12) (select (select (store .cse25 |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_1324) v_arrayElimCell_121) (+ v_arrayElimCell_122 4))) (not (= (store (select .cse25 |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse14 (select v_ArrVal_1324 .cse14)) v_ArrVal_1324)))))) (.cse16 (= |c_ULTIMATE.start_main_~bcki~0#1.offset| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse11 (forall ((v_ArrVal_1324 (Array Int Int)) (v_arrayElimCell_122 Int) (v_arrayElimCell_121 Int) (v_ArrVal_1323 Int)) (let ((.cse24 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse2 .cse15 v_ArrVal_1323)))) (let ((.cse23 (select v_ArrVal_1324 .cse12)) (.cse22 (select (store .cse24 |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_1324) v_arrayElimCell_121))) (or (= (select .cse22 .cse1) .cse23) (= .cse23 (select .cse22 (+ v_arrayElimCell_122 4))) (not (= (store (select .cse24 |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse14 (select v_ArrVal_1324 .cse14)) v_ArrVal_1324)))))))) (let ((.cse4 (or .cse16 .cse11)) (.cse5 (forall ((v_ArrVal_1324 (Array Int Int)) (v_arrayElimCell_122 Int) (v_arrayElimCell_121 Int) (v_ArrVal_1323 Int)) (let ((.cse21 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse2 .cse15 v_ArrVal_1323)))) (let ((.cse20 (store .cse21 |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_1324))) (let ((.cse19 (select v_ArrVal_1324 .cse12)) (.cse18 (select .cse20 v_arrayElimCell_121))) (or (= (select .cse18 .cse1) .cse19) (= .cse19 (select (select .cse20 |c_ULTIMATE.start_main_~item~0#1.base|) .cse1)) (= .cse19 (select .cse18 (+ v_arrayElimCell_122 4))) (not (= (store (select .cse21 |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse14 (select v_ArrVal_1324 .cse14)) v_ArrVal_1324)))))))) (.cse6 (or .cse16 .cse17)) (.cse7 (or .cse10 .cse17)) (.cse8 (or (forall ((v_ArrVal_1324 (Array Int Int)) (v_ArrVal_1323 Int)) (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse2 .cse15 v_ArrVal_1323)))) (or (= (select v_ArrVal_1324 .cse12) (select (select (store .cse13 |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~item~0#1.base|) .cse1)) (not (= (store (select .cse13 |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse14 (select v_ArrVal_1324 .cse14)) v_ArrVal_1324))))) (not .cse16) (not .cse10))) (.cse9 (or .cse10 .cse11))) (let ((.cse3 (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (and (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~bucket~0#1.base|) 1))) (or (and (exists ((|v_ULTIMATE.start_main_#t~malloc2#1.base_36| Int)) (and (not (= |v_ULTIMATE.start_main_#t~malloc2#1.base_36| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc2#1.base_36|) 1))) .cse0) (and (exists ((|v_ULTIMATE.start_main_~bcki~0#1.base_68| Int)) (= (select |c_#valid| |v_ULTIMATE.start_main_~bcki~0#1.base_68|) 1)) .cse0))) (or (not (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~item~0#1.base|) .cse1) (select .cse2 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 8)))) .cse3) (not (= |c_ULTIMATE.start_main_~bucket~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) .cse4 .cse5 .cse6 (= |c_ULTIMATE.start_main_~bucket~0#1.offset| 0) .cse7 .cse8 (or (not (= |c_ULTIMATE.start_main_#t~mem11#1| |c_ULTIMATE.start_main_#t~mem10#1|)) .cse3) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) .cse9))))) is different from false [2024-11-11 19:33:38,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:33:38,910 INFO L93 Difference]: Finished difference Result 406 states and 514 transitions. [2024-11-11 19:33:38,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-11 19:33:38,911 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.09375) internal successors, (67), 32 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-11 19:33:38,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:33:38,912 INFO L225 Difference]: With dead ends: 406 [2024-11-11 19:33:38,913 INFO L226 Difference]: Without dead ends: 371 [2024-11-11 19:33:38,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=428, Invalid=1843, Unknown=5, NotChecked=480, Total=2756 [2024-11-11 19:33:38,921 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 386 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 21 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 1399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 803 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:33:38,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 446 Invalid, 1399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 562 Invalid, 13 Unknown, 803 Unchecked, 1.0s Time] [2024-11-11 19:33:38,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-11 19:33:38,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 287. [2024-11-11 19:33:38,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 285 states have (on average 1.2912280701754386) internal successors, (368), 286 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:33:38,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 368 transitions. [2024-11-11 19:33:38,996 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 368 transitions. Word has length 24 [2024-11-11 19:33:38,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:33:38,996 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 368 transitions. [2024-11-11 19:33:38,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.09375) internal successors, (67), 32 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:33:38,996 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 368 transitions. [2024-11-11 19:33:38,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-11 19:33:38,997 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:33:38,997 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:33:39,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-11 19:33:39,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:33:39,198 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 19:33:39,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:33:39,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1317906679, now seen corresponding path program 3 times [2024-11-11 19:33:39,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:33:39,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455713091] [2024-11-11 19:33:39,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:33:39,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:33:39,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:33:39,970 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:33:39,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:33:39,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455713091] [2024-11-11 19:33:39,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455713091] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:33:39,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132626937] [2024-11-11 19:33:39,971 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-11 19:33:39,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:33:39,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:33:39,973 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:33:39,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-11 19:33:40,950 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-11 19:33:40,951 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 19:33:40,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-11 19:33:40,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:33:40,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2024-11-11 19:33:40,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2024-11-11 19:33:41,014 INFO L349 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2024-11-11 19:33:41,015 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 2 case distinctions, treesize of input 78 treesize of output 79 [2024-11-11 19:33:41,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 1 [2024-11-11 19:33:41,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-11 19:33:41,034 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-11 19:33:41,035 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 59 treesize of output 43 [2024-11-11 19:33:41,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:33:41,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 41 treesize of output 45 [2024-11-11 19:33:41,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-11 19:33:41,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-11 19:33:41,186 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-11 19:33:41,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 53 [2024-11-11 19:33:41,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:33:41,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2024-11-11 19:33:41,327 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-11 19:33:41,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 56 [2024-11-11 19:33:41,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:33:41,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2024-11-11 19:33:41,470 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-11 19:33:41,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 56 [2024-11-11 19:33:41,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:33:41,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2024-11-11 19:33:41,561 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:33:41,561 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:33:42,259 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:33:42,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132626937] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:33:42,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:33:42,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 9] total 18 [2024-11-11 19:33:42,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622655169] [2024-11-11 19:33:42,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:33:42,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-11 19:33:42,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:33:42,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-11 19:33:42,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2024-11-11 19:33:42,261 INFO L87 Difference]: Start difference. First operand 287 states and 368 transitions. Second operand has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:33:42,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:33:42,766 INFO L93 Difference]: Finished difference Result 302 states and 384 transitions. [2024-11-11 19:33:42,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 19:33:42,767 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-11 19:33:42,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:33:42,768 INFO L225 Difference]: With dead ends: 302 [2024-11-11 19:33:42,768 INFO L226 Difference]: Without dead ends: 274 [2024-11-11 19:33:42,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2024-11-11 19:33:42,769 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 19:33:42,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 267 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 19:33:42,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-11 19:33:42,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2024-11-11 19:33:42,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 272 states have (on average 1.3014705882352942) internal successors, (354), 273 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:33:42,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 354 transitions. [2024-11-11 19:33:42,825 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 354 transitions. Word has length 25 [2024-11-11 19:33:42,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:33:42,825 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 354 transitions. [2024-11-11 19:33:42,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:33:42,825 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 354 transitions. [2024-11-11 19:33:42,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-11 19:33:42,826 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:33:42,826 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:33:42,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-11 19:33:43,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-11 19:33:43,027 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 19:33:43,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:33:43,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1702665013, now seen corresponding path program 1 times [2024-11-11 19:33:43,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:33:43,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275451990] [2024-11-11 19:33:43,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:33:43,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:33:43,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:33:43,770 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:33:43,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:33:43,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275451990] [2024-11-11 19:33:43,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275451990] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:33:43,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199639112] [2024-11-11 19:33:43,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:33:43,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:33:43,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:33:43,773 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:33:43,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-11 19:33:43,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:33:43,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-11 19:33:43,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:33:44,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 27 treesize of output 35 [2024-11-11 19:33:44,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2024-11-11 19:33:44,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2024-11-11 19:33:44,064 INFO L349 Elim1Store]: treesize reduction 62, result has 7.5 percent of original size [2024-11-11 19:33:44,065 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 2 case distinctions, treesize of input 110 treesize of output 83 [2024-11-11 19:33:44,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:33:44,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:33:44,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 40 treesize of output 27 [2024-11-11 19:33:44,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:33:44,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-11-11 19:33:44,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 29 treesize of output 11 [2024-11-11 19:33:44,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2024-11-11 19:33:44,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 22 treesize of output 30 [2024-11-11 19:33:44,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2024-11-11 19:33:44,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2024-11-11 19:33:44,155 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-11 19:33:44,155 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 68 treesize of output 61 [2024-11-11 19:33:44,172 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-11-11 19:33:44,172 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2024-11-11 19:33:44,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2024-11-11 19:33:44,190 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 31 treesize of output 31 [2024-11-11 19:33:44,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2024-11-11 19:33:44,418 INFO L349 Elim1Store]: treesize reduction 92, result has 38.7 percent of original size [2024-11-11 19:33:44,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 127 treesize of output 165 [2024-11-11 19:33:44,440 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-11 19:33:44,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 128 [2024-11-11 19:33:44,465 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 19:33:44,465 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 97 [2024-11-11 19:33:47,567 INFO L349 Elim1Store]: treesize reduction 1668, result has 12.6 percent of original size [2024-11-11 19:33:47,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 28 select indices, 28 select index equivalence classes, 1 disjoint index pairs (out of 378 index pairs), introduced 28 new quantified variables, introduced 389 case distinctions, treesize of input 641 treesize of output 763 [2024-11-11 19:33:47,637 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2024-11-11 19:33:47,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 560 treesize of output 458 [2024-11-11 19:33:47,667 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 466 treesize of output 441