./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 3061b6dc 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-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 13:04:47,728 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 13:04:47,792 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 13:04:47,799 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 13:04:47,800 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 13:04:47,828 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 13:04:47,829 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 13:04:47,829 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 13:04:47,830 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 13:04:47,831 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 13:04:47,832 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 13:04:47,832 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 13:04:47,833 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 13:04:47,833 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 13:04:47,836 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 13:04:47,836 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 13:04:47,836 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 13:04:47,837 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 13:04:47,837 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 13:04:47,837 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 13:04:47,838 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 13:04:47,841 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 13:04:47,842 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 13:04:47,842 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 13:04:47,842 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 13:04:47,842 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 13:04:47,843 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 13:04:47,843 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 13:04:47,843 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 13:04:47,843 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 13:04:47,844 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 13:04:47,844 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 13:04:47,844 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 13:04:47,845 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 13:04:47,845 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 13:04:47,847 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 13:04:47,847 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 13:04:47,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 13:04:47,848 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 13:04:47,848 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 13:04:47,849 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 13:04:47,849 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 13:04:47,850 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-18 13:04:48,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 13:04:48,117 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 13:04:48,121 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 13:04:48,122 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 13:04:48,123 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 13:04:48,124 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-18 13:04:49,653 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 13:04:49,917 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 13:04:49,918 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i [2024-11-18 13:04:49,936 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09beaa754/14f4f56da947423b94ceb5e7e5946ecf/FLAG3b24d0155 [2024-11-18 13:04:49,950 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09beaa754/14f4f56da947423b94ceb5e7e5946ecf [2024-11-18 13:04:49,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 13:04:49,954 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 13:04:49,956 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 13:04:49,956 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 13:04:49,961 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 13:04:49,962 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:04:49" (1/1) ... [2024-11-18 13:04:49,965 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b1f43e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:04:49, skipping insertion in model container [2024-11-18 13:04:49,965 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:04:49" (1/1) ... [2024-11-18 13:04:50,005 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 13:04:50,361 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-18 13:04:50,368 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-18 13:04:50,370 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-18 13:04:50,375 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-18 13:04:50,376 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-18 13:04:50,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 13:04:50,391 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 13:04:50,434 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-18 13:04:50,435 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-18 13:04:50,438 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-18 13:04:50,441 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-18 13:04:50,442 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-18 13:04:50,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 13:04:50,470 INFO L204 MainTranslator]: Completed translation [2024-11-18 13:04:50,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:04:50 WrapperNode [2024-11-18 13:04:50,470 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 13:04:50,471 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 13:04:50,471 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 13:04:50,472 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 13:04:50,478 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:04:50" (1/1) ... [2024-11-18 13:04:50,492 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:04:50" (1/1) ... [2024-11-18 13:04:50,515 INFO L138 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 155 [2024-11-18 13:04:50,515 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 13:04:50,516 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 13:04:50,516 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 13:04:50,516 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 13:04:50,526 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:04:50" (1/1) ... [2024-11-18 13:04:50,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:04:50" (1/1) ... [2024-11-18 13:04:50,529 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:04:50" (1/1) ... [2024-11-18 13:04:50,546 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-18 13:04:50,547 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:04:50" (1/1) ... [2024-11-18 13:04:50,547 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:04:50" (1/1) ... [2024-11-18 13:04:50,554 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:04:50" (1/1) ... [2024-11-18 13:04:50,561 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:04:50" (1/1) ... [2024-11-18 13:04:50,562 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:04:50" (1/1) ... [2024-11-18 13:04:50,564 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:04:50" (1/1) ... [2024-11-18 13:04:50,566 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 13:04:50,567 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 13:04:50,567 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 13:04:50,567 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 13:04:50,569 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:04:50" (1/1) ... [2024-11-18 13:04:50,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 13:04:50,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:04:50,606 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-18 13:04:50,610 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-18 13:04:50,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-18 13:04:50,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-18 13:04:50,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-18 13:04:50,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-18 13:04:50,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-18 13:04:50,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 13:04:50,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-18 13:04:50,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-18 13:04:50,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-18 13:04:50,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-18 13:04:50,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-18 13:04:50,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 13:04:50,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-18 13:04:50,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 13:04:50,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 13:04:50,811 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 13:04:50,814 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 13:04:51,111 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2024-11-18 13:04:51,111 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 13:04:51,122 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 13:04:51,123 INFO L316 CfgBuilder]: Removed 15 assume(true) statements. [2024-11-18 13:04:51,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:04:51 BoogieIcfgContainer [2024-11-18 13:04:51,123 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 13:04:51,125 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 13:04:51,125 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 13:04:51,128 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 13:04:51,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 01:04:49" (1/3) ... [2024-11-18 13:04:51,129 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e73fd78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:04:51, skipping insertion in model container [2024-11-18 13:04:51,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:04:50" (2/3) ... [2024-11-18 13:04:51,129 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e73fd78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:04:51, skipping insertion in model container [2024-11-18 13:04:51,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:04:51" (3/3) ... [2024-11-18 13:04:51,131 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-buckets-1.i [2024-11-18 13:04:51,146 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 13:04:51,146 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-11-18 13:04:51,199 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 13:04:51,204 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;@5a5b72fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 13:04:51,205 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-18 13:04:51,208 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-18 13:04:51,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-18 13:04:51,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:04:51,214 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:04:51,215 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-18 13:04:51,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:04:51,219 INFO L85 PathProgramCache]: Analyzing trace with hash 179510098, now seen corresponding path program 1 times [2024-11-18 13:04:51,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:04:51,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136922604] [2024-11-18 13:04:51,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:04:51,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:04:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:04:51,641 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-18 13:04:51,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:04:51,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136922604] [2024-11-18 13:04:51,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136922604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:04:51,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:04:51,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 13:04:51,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486803096] [2024-11-18 13:04:51,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:04:51,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 13:04:51,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:04:51,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 13:04:51,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 13:04:51,675 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-18 13:04:51,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:04:51,785 INFO L93 Difference]: Finished difference Result 103 states and 173 transitions. [2024-11-18 13:04:51,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 13:04:51,791 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-18 13:04:51,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:04:51,798 INFO L225 Difference]: With dead ends: 103 [2024-11-18 13:04:51,798 INFO L226 Difference]: Without dead ends: 57 [2024-11-18 13:04:51,801 INFO L431 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-18 13:04:51,805 INFO L432 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-18 13:04:51,806 INFO L433 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-18 13:04:51,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-18 13:04:51,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2024-11-18 13:04:51,847 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-18 13:04:51,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2024-11-18 13:04:51,852 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 8 [2024-11-18 13:04:51,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:04:51,854 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2024-11-18 13:04:51,854 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-18 13:04:51,854 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2024-11-18 13:04:51,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-18 13:04:51,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:04:51,856 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:04:51,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 13:04:51,856 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-18 13:04:51,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:04:51,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1306111283, now seen corresponding path program 1 times [2024-11-18 13:04:51,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:04:51,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058371914] [2024-11-18 13:04:51,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:04:51,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:04:51,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:04:52,009 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-18 13:04:52,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:04:52,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058371914] [2024-11-18 13:04:52,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058371914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:04:52,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:04:52,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 13:04:52,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40366914] [2024-11-18 13:04:52,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:04:52,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 13:04:52,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:04:52,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 13:04:52,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 13:04:52,016 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-18 13:04:52,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:04:52,053 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2024-11-18 13:04:52,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 13:04:52,054 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-18 13:04:52,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:04:52,055 INFO L225 Difference]: With dead ends: 42 [2024-11-18 13:04:52,055 INFO L226 Difference]: Without dead ends: 40 [2024-11-18 13:04:52,056 INFO L431 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-18 13:04:52,057 INFO L432 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-18 13:04:52,058 INFO L433 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-18 13:04:52,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-18 13:04:52,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2024-11-18 13:04:52,066 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-18 13:04:52,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2024-11-18 13:04:52,068 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 9 [2024-11-18 13:04:52,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:04:52,069 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2024-11-18 13:04:52,069 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-18 13:04:52,069 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2024-11-18 13:04:52,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-18 13:04:52,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:04:52,070 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:04:52,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 13:04:52,070 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-18 13:04:52,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:04:52,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1834780084, now seen corresponding path program 1 times [2024-11-18 13:04:52,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:04:52,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335093838] [2024-11-18 13:04:52,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:04:52,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:04:52,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:04:52,880 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-18 13:04:52,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:04:52,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335093838] [2024-11-18 13:04:52,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335093838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:04:52,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:04:52,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 13:04:52,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372976927] [2024-11-18 13:04:52,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:04:52,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 13:04:52,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:04:52,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 13:04:52,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 13:04:52,888 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-18 13:04:53,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:04:53,059 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2024-11-18 13:04:53,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 13:04:53,060 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-18 13:04:53,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:04:53,061 INFO L225 Difference]: With dead ends: 58 [2024-11-18 13:04:53,061 INFO L226 Difference]: Without dead ends: 47 [2024-11-18 13:04:53,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-18 13:04:53,063 INFO L432 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-18 13:04:53,064 INFO L433 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-18 13:04:53,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-18 13:04:53,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2024-11-18 13:04:53,075 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-18 13:04:53,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2024-11-18 13:04:53,077 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 10 [2024-11-18 13:04:53,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:04:53,077 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2024-11-18 13:04:53,077 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-18 13:04:53,077 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2024-11-18 13:04:53,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-18 13:04:53,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:04:53,078 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:04:53,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 13:04:53,079 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-18 13:04:53,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:04:53,079 INFO L85 PathProgramCache]: Analyzing trace with hash 710639734, now seen corresponding path program 1 times [2024-11-18 13:04:53,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:04:53,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639768731] [2024-11-18 13:04:53,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:04:53,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:04:53,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:04:53,143 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-18 13:04:53,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:04:53,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639768731] [2024-11-18 13:04:53,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639768731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:04:53,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:04:53,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 13:04:53,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262504028] [2024-11-18 13:04:53,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:04:53,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 13:04:53,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:04:53,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 13:04:53,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 13:04:53,149 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-18 13:04:53,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:04:53,179 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2024-11-18 13:04:53,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 13:04:53,180 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-18 13:04:53,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:04:53,180 INFO L225 Difference]: With dead ends: 44 [2024-11-18 13:04:53,181 INFO L226 Difference]: Without dead ends: 42 [2024-11-18 13:04:53,181 INFO L431 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-18 13:04:53,182 INFO L432 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-18 13:04:53,182 INFO L433 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-18 13:04:53,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-18 13:04:53,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-18 13:04:53,193 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-18 13:04:53,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2024-11-18 13:04:53,195 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 10 [2024-11-18 13:04:53,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:04:53,195 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2024-11-18 13:04:53,196 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-18 13:04:53,196 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2024-11-18 13:04:53,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-18 13:04:53,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:04:53,197 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:04:53,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 13:04:53,197 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-18 13:04:53,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:04:53,199 INFO L85 PathProgramCache]: Analyzing trace with hash 625501225, now seen corresponding path program 1 times [2024-11-18 13:04:53,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:04:53,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972391584] [2024-11-18 13:04:53,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:04:53,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:04:53,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:04:54,007 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-18 13:04:54,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:04:54,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972391584] [2024-11-18 13:04:54,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972391584] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:04:54,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370492298] [2024-11-18 13:04:54,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:04:54,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:04:54,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:04:54,011 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-18 13:04:54,014 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-18 13:04:54,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:04:54,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-18 13:04:54,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:04:54,244 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-18 13:04:54,258 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-18 13:04:54,301 INFO L349 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2024-11-18 13:04:54,302 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-18 13:04:54,314 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-18 13:04:54,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:04:54,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:04:54,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:04:54,327 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-18 13:04:54,333 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-18 13:04:54,355 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-18 13:04:54,355 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-18 13:04:54,368 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-18 13:04:54,376 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-18 13:04:54,770 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-18 13:04:54,771 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-18 13:04:54,791 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-18 13:04:55,139 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-18 13:04:55,139 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:04:55,460 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-18 13:04:55,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370492298] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:04:55,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:04:55,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-11-18 13:04:55,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324372357] [2024-11-18 13:04:55,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:04:55,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-18 13:04:55,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:04:55,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-18 13:04:55,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-18 13:04:55,462 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-18 13:04:56,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:04:56,153 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2024-11-18 13:04:56,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-18 13:04:56,154 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-18 13:04:56,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:04:56,154 INFO L225 Difference]: With dead ends: 64 [2024-11-18 13:04:56,154 INFO L226 Difference]: Without dead ends: 53 [2024-11-18 13:04:56,155 INFO L431 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-18 13:04:56,156 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 28 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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-18 13:04:56,156 INFO L433 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-18 13:04:56,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-18 13:04:56,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2024-11-18 13:04:56,168 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-18 13:04:56,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2024-11-18 13:04:56,170 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 15 [2024-11-18 13:04:56,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:04:56,173 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2024-11-18 13:04:56,173 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-18 13:04:56,173 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2024-11-18 13:04:56,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-18 13:04:56,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:04:56,174 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:04:56,192 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-18 13:04:56,374 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-18 13:04:56,375 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-18 13:04:56,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:04:56,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1157082046, now seen corresponding path program 1 times [2024-11-18 13:04:56,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:04:56,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266288085] [2024-11-18 13:04:56,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:04:56,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:04:56,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:04:56,715 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-18 13:04:56,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:04:56,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266288085] [2024-11-18 13:04:56,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266288085] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:04:56,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705816296] [2024-11-18 13:04:56,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:04:56,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:04:56,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:04:56,718 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-18 13:04:56,720 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-18 13:04:56,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:04:56,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-18 13:04:56,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:04:56,860 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-18 13:04:56,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:04:56,883 INFO L349 Elim1Store]: treesize reduction 41, result has 10.9 percent of original size [2024-11-18 13:04:56,883 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-18 13:04:56,900 INFO L349 Elim1Store]: treesize reduction 44, result has 10.2 percent of original size [2024-11-18 13:04:56,900 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-18 13:04:56,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:04:56,945 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-18 13:04:56,962 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-18 13:04:56,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-18 13:04:56,994 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-18 13:04:57,061 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-18 13:04:57,069 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-18 13:04:57,070 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:04:57,178 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-18 13:04:57,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705816296] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:04:57,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:04:57,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2024-11-18 13:04:57,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269624926] [2024-11-18 13:04:57,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:04:57,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-18 13:04:57,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:04:57,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-18 13:04:57,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=114, Unknown=5, NotChecked=0, Total=156 [2024-11-18 13:04:57,181 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-18 13:04:57,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:04:57,493 INFO L93 Difference]: Finished difference Result 104 states and 125 transitions. [2024-11-18 13:04:57,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-18 13:04:57,494 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-18 13:04:57,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:04:57,495 INFO L225 Difference]: With dead ends: 104 [2024-11-18 13:04:57,495 INFO L226 Difference]: Without dead ends: 102 [2024-11-18 13:04:57,496 INFO L431 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-18 13:04:57,496 INFO L432 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-18 13:04:57,497 INFO L433 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-18 13:04:57,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-18 13:04:57,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 62. [2024-11-18 13:04:57,511 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-18 13:04:57,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2024-11-18 13:04:57,512 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 76 transitions. Word has length 16 [2024-11-18 13:04:57,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:04:57,512 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 76 transitions. [2024-11-18 13:04:57,512 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-18 13:04:57,512 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2024-11-18 13:04:57,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-18 13:04:57,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:04:57,514 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:04:57,532 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-18 13:04:57,718 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-18 13:04:57,719 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-18 13:04:57,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:04:57,719 INFO L85 PathProgramCache]: Analyzing trace with hash 442135079, now seen corresponding path program 2 times [2024-11-18 13:04:57,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:04:57,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791653147] [2024-11-18 13:04:57,720 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 13:04:57,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:04:57,758 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 13:04:57,758 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:04:58,214 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-18 13:04:58,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:04:58,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791653147] [2024-11-18 13:04:58,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791653147] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:04:58,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728270317] [2024-11-18 13:04:58,216 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 13:04:58,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:04:58,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:04:58,218 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-18 13:04:58,219 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-18 13:04:58,559 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 13:04:58,559 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:04:58,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-18 13:04:58,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:04:58,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:04:58,606 INFO L349 Elim1Store]: treesize reduction 35, result has 12.5 percent of original size [2024-11-18 13:04:58,607 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-18 13:04:58,619 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-18 13:04:58,625 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-18 13:04:58,645 INFO L349 Elim1Store]: treesize reduction 21, result has 4.5 percent of original size [2024-11-18 13:04:58,646 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-18 13:04:58,673 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-18 13:04:58,674 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-18 13:04:58,679 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-18 13:04:58,701 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-18 13:04:58,805 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-18 13:04:58,805 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 13:04:58,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728270317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:04:58,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 13:04:58,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2024-11-18 13:04:58,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615127626] [2024-11-18 13:04:58,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:04:58,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 13:04:58,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:04:58,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 13:04:58,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-18 13:04:58,807 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-18 13:04:59,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:04:59,075 INFO L93 Difference]: Finished difference Result 141 states and 175 transitions. [2024-11-18 13:04:59,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 13:04:59,076 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-18 13:04:59,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:04:59,077 INFO L225 Difference]: With dead ends: 141 [2024-11-18 13:04:59,077 INFO L226 Difference]: Without dead ends: 106 [2024-11-18 13:04:59,078 INFO L431 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-18 13:04:59,078 INFO L432 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.2s IncrementalHoareTripleChecker+Time [2024-11-18 13:04:59,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 134 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 13:04:59,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-18 13:04:59,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 76. [2024-11-18 13:04:59,094 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-18 13:04:59,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2024-11-18 13:04:59,096 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 18 [2024-11-18 13:04:59,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:04:59,097 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2024-11-18 13:04:59,097 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-18 13:04:59,097 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2024-11-18 13:04:59,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-18 13:04:59,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:04:59,097 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:04:59,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-18 13:04:59,302 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-18 13:04:59,303 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-18 13:04:59,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:04:59,303 INFO L85 PathProgramCache]: Analyzing trace with hash -482453053, now seen corresponding path program 1 times [2024-11-18 13:04:59,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:04:59,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641446926] [2024-11-18 13:04:59,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:04:59,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:04:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:04:59,764 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-18 13:04:59,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:04:59,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641446926] [2024-11-18 13:04:59,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641446926] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:04:59,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749639390] [2024-11-18 13:04:59,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:04:59,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:04:59,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:04:59,767 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-18 13:04:59,769 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-18 13:04:59,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:04:59,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-18 13:04:59,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:04:59,977 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-18 13:04:59,989 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-18 13:05:00,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:05:00,025 INFO L349 Elim1Store]: treesize reduction 39, result has 11.4 percent of original size [2024-11-18 13:05:00,026 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-18 13:05:00,053 INFO L349 Elim1Store]: treesize reduction 36, result has 32.1 percent of original size [2024-11-18 13:05:00,054 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-18 13:05:00,066 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-18 13:05:00,071 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-18 13:05:00,082 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-18 13:05:00,103 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-18 13:05:00,223 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-18 13:05:00,224 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-18 13:05:00,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:05:00,258 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2024-11-18 13:05:00,258 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-18 13:05:00,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:05:00,287 INFO L349 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2024-11-18 13:05:00,288 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-18 13:05:00,303 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-18 13:05:00,426 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-18 13:05:00,449 INFO L349 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2024-11-18 13:05:00,449 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-18 13:05:00,473 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-18 13:05:00,827 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2024-11-18 13:05:00,828 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-18 13:05:00,835 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-18 13:05:00,886 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-18 13:05:00,886 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:05:00,977 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-18 13:05:00,999 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:05:00,999 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-18 13:05:01,016 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-18 13:05:01,060 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-18 13:05:01,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749639390] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:05:01,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:05:01,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2024-11-18 13:05:01,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143563512] [2024-11-18 13:05:01,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:05:01,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-18 13:05:01,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:05:01,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-18 13:05:01,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=269, Unknown=2, NotChecked=66, Total=380 [2024-11-18 13:05:01,062 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-18 13:05:02,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:05:02,867 INFO L93 Difference]: Finished difference Result 238 states and 300 transitions. [2024-11-18 13:05:02,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-18 13:05:02,868 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-18 13:05:02,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:05:02,869 INFO L225 Difference]: With dead ends: 238 [2024-11-18 13:05:02,869 INFO L226 Difference]: Without dead ends: 203 [2024-11-18 13:05:02,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=260, Invalid=936, Unknown=2, NotChecked=134, Total=1332 [2024-11-18 13:05:02,871 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 334 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2024-11-18 13:05:02,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 414 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 579 Invalid, 0 Unknown, 297 Unchecked, 0.7s Time] [2024-11-18 13:05:02,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-18 13:05:02,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 130. [2024-11-18 13:05:02,901 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-18 13:05:02,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 164 transitions. [2024-11-18 13:05:02,902 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 164 transitions. Word has length 19 [2024-11-18 13:05:02,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:05:02,902 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 164 transitions. [2024-11-18 13:05:02,902 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-18 13:05:02,902 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 164 transitions. [2024-11-18 13:05:02,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-18 13:05:02,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:05:02,903 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:05:02,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-18 13:05:03,104 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-18 13:05:03,104 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-18 13:05:03,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:05:03,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1136543444, now seen corresponding path program 2 times [2024-11-18 13:05:03,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:05:03,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384645053] [2024-11-18 13:05:03,105 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 13:05:03,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:05:03,142 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 13:05:03,143 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:05:03,887 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-18 13:05:03,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:05:03,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384645053] [2024-11-18 13:05:03,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384645053] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:05:03,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759177755] [2024-11-18 13:05:03,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 13:05:03,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:05:03,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:05:03,891 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-18 13:05:03,894 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-18 13:05:04,323 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 13:05:04,324 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:05:04,326 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-18 13:05:04,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:05:04,359 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-18 13:05:04,366 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-18 13:05:04,392 INFO L349 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2024-11-18 13:05:04,393 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-18 13:05:04,397 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-18 13:05:04,429 INFO L349 Elim1Store]: treesize reduction 94, result has 34.3 percent of original size [2024-11-18 13:05:04,430 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-18 13:05:04,433 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-18 13:05:04,445 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-18 13:05:04,455 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-18 13:05:04,463 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-18 13:05:04,463 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-18 13:05:04,603 INFO L349 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2024-11-18 13:05:04,604 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-18 13:05:04,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:05:04,616 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-18 13:05:04,790 INFO L349 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2024-11-18 13:05:04,790 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-18 13:05:04,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:05:04,805 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-18 13:05:05,072 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-18 13:05:05,072 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:05:10,649 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-18 13:05:10,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759177755] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:05:10,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:05:10,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 21 [2024-11-18 13:05:10,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899692009] [2024-11-18 13:05:10,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:05:10,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-18 13:05:10,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:05:10,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-18 13:05:10,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=351, Unknown=1, NotChecked=0, Total=420 [2024-11-18 13:05:10,651 INFO L87 Difference]: Start difference. First operand 130 states and 164 transitions. Second operand has 21 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 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-18 13:05:11,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:05:11,770 INFO L93 Difference]: Finished difference Result 161 states and 198 transitions. [2024-11-18 13:05:11,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-18 13:05:11,771 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-18 13:05:11,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:05:11,772 INFO L225 Difference]: With dead ends: 161 [2024-11-18 13:05:11,772 INFO L226 Difference]: Without dead ends: 150 [2024-11-18 13:05:11,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=147, Invalid=664, Unknown=1, NotChecked=0, Total=812 [2024-11-18 13:05:11,773 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 50 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-18 13:05:11,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 295 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-18 13:05:11,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-18 13:05:11,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 135. [2024-11-18 13:05:11,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-18 13:05:11,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 169 transitions. [2024-11-18 13:05:11,796 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 169 transitions. Word has length 20 [2024-11-18 13:05:11,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:05:11,797 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 169 transitions. [2024-11-18 13:05:11,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 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-18 13:05:11,797 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 169 transitions. [2024-11-18 13:05:11,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-18 13:05:11,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:05:11,798 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:05:11,812 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-18 13:05:11,998 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-18 13:05:11,999 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-18 13:05:11,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:05:11,999 INFO L85 PathProgramCache]: Analyzing trace with hash -800532698, now seen corresponding path program 1 times [2024-11-18 13:05:12,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:05:12,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18626405] [2024-11-18 13:05:12,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:05:12,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:05:12,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:05:12,805 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-18 13:05:12,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:05:12,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18626405] [2024-11-18 13:05:12,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18626405] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:05:12,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627590189] [2024-11-18 13:05:12,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:05:12,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:05:12,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:05:12,807 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-18 13:05:12,809 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-18 13:05:12,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:05:12,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-11-18 13:05:12,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:05:13,024 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-18 13:05:13,034 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-18 13:05:13,055 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-18 13:05:13,088 INFO L349 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2024-11-18 13:05:13,089 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-18 13:05:13,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:05:13,111 INFO L349 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2024-11-18 13:05:13,112 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-18 13:05:13,123 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-18 13:05:13,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:05:13,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:05:13,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:05:13,149 INFO L349 Elim1Store]: treesize reduction 31, result has 13.9 percent of original size [2024-11-18 13:05:13,149 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-18 13:05:13,167 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-18 13:05:13,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:05:13,271 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-18 13:05:13,271 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-18 13:05:13,300 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2024-11-18 13:05:13,300 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-18 13:05:13,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:05:13,331 INFO L349 Elim1Store]: treesize reduction 32, result has 45.8 percent of original size [2024-11-18 13:05:13,332 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-18 13:05:13,341 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-18 13:05:13,353 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-18 13:05:13,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:05:13,402 INFO L349 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2024-11-18 13:05:13,403 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-18 13:05:13,522 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-18 13:05:13,523 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-18 13:05:13,538 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-18 13:05:13,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:05:13,550 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-18 13:05:14,031 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-11-18 13:05:14,032 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-18 13:05:14,039 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-18 13:05:14,109 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-18 13:05:14,109 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:05:14,296 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1157 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (= 2 (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1157)) (.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1159))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (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|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|) 2)) (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 8)))))) is different from false [2024-11-18 13:05:14,313 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:05:14,313 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-18 13:05:14,442 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-18 13:05:14,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627590189] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:05:14,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:05:14,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2024-11-18 13:05:14,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441861619] [2024-11-18 13:05:14,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:05:14,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-18 13:05:14,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:05:14,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-18 13:05:14,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=409, Unknown=1, NotChecked=40, Total=506 [2024-11-18 13:05:14,445 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-18 13:05:16,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:05:16,264 INFO L93 Difference]: Finished difference Result 309 states and 388 transitions. [2024-11-18 13:05:16,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-18 13:05:16,264 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-18 13:05:16,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:05:16,266 INFO L225 Difference]: With dead ends: 309 [2024-11-18 13:05:16,266 INFO L226 Difference]: Without dead ends: 274 [2024-11-18 13:05:16,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=226, Invalid=967, Unknown=1, NotChecked=66, Total=1260 [2024-11-18 13:05:16,267 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 237 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:05:16,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 501 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 763 Invalid, 0 Unknown, 138 Unchecked, 1.0s Time] [2024-11-18 13:05:16,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-18 13:05:16,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 191. [2024-11-18 13:05:16,302 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-18 13:05:16,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 244 transitions. [2024-11-18 13:05:16,303 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 244 transitions. Word has length 21 [2024-11-18 13:05:16,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:05:16,303 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 244 transitions. [2024-11-18 13:05:16,303 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-18 13:05:16,303 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 244 transitions. [2024-11-18 13:05:16,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-18 13:05:16,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:05:16,304 INFO L215 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-18 13:05:16,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-18 13:05:16,508 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-18 13:05:16,509 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-18 13:05:16,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:05:16,509 INFO L85 PathProgramCache]: Analyzing trace with hash -962615628, now seen corresponding path program 1 times [2024-11-18 13:05:16,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:05:16,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269002014] [2024-11-18 13:05:16,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:05:16,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:05:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:05:17,234 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-18 13:05:17,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:05:17,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269002014] [2024-11-18 13:05:17,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269002014] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:05:17,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775074824] [2024-11-18 13:05:17,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:05:17,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:05:17,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:05:17,236 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-18 13:05:17,238 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-18 13:05:17,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:05:17,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-18 13:05:17,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:05:17,428 INFO L349 Elim1Store]: treesize reduction 33, result has 13.2 percent of original size [2024-11-18 13:05:17,428 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-18 13:05:17,444 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-18 13:05:17,445 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-18 13:05:17,554 INFO L349 Elim1Store]: treesize reduction 4, result has 91.8 percent of original size [2024-11-18 13:05:17,555 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-18 13:05:17,643 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-18 13:05:17,917 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-18 13:05:17,920 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-18 13:05:17,927 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-18 13:05:18,032 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-18 13:05:18,036 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-18 13:05:18,045 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-18 13:05:18,117 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-18 13:05:18,117 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:05:18,163 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-18 13:05:18,174 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-18 13:05:18,196 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-18 13:05:18,201 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-18 13:05:18,304 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-18 13:05:19,575 INFO L349 Elim1Store]: treesize reduction 31, result has 40.4 percent of original size [2024-11-18 13:05:19,576 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-18 13:05:19,602 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-18 13:05:19,603 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-18 13:05:19,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:05:19,724 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-18 13:05:20,072 INFO L349 Elim1Store]: treesize reduction 6, result has 95.4 percent of original size [2024-11-18 13:05:20,073 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-18 13:05:20,364 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-18 13:05:20,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775074824] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:05:20,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:05:20,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 32 [2024-11-18 13:05:20,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145006407] [2024-11-18 13:05:20,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:05:20,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-18 13:05:20,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:05:20,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-18 13:05:20,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=703, Unknown=3, NotChecked=168, Total=992 [2024-11-18 13:05:20,366 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-18 13:05:21,285 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-18 13:05:22,680 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-18 13:05:22,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:05:22,867 INFO L93 Difference]: Finished difference Result 406 states and 514 transitions. [2024-11-18 13:05:22,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-18 13:05:22,867 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-18 13:05:22,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:05:22,871 INFO L225 Difference]: With dead ends: 406 [2024-11-18 13:05:22,871 INFO L226 Difference]: Without dead ends: 371 [2024-11-18 13:05:22,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=428, Invalid=1843, Unknown=5, NotChecked=480, Total=2756 [2024-11-18 13:05:22,874 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 369 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 20 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 1510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 803 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-18 13:05:22,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 546 Invalid, 1510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 673 Invalid, 14 Unknown, 803 Unchecked, 1.1s Time] [2024-11-18 13:05:22,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-18 13:05:22,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 287. [2024-11-18 13:05:22,935 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-18 13:05:22,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 368 transitions. [2024-11-18 13:05:22,936 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 368 transitions. Word has length 24 [2024-11-18 13:05:22,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:05:22,936 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 368 transitions. [2024-11-18 13:05:22,937 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-18 13:05:22,937 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 368 transitions. [2024-11-18 13:05:22,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-18 13:05:22,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:05:22,938 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:05:22,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-18 13:05:23,141 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-18 13:05:23,142 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-18 13:05:23,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:05:23,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1317906679, now seen corresponding path program 3 times [2024-11-18 13:05:23,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:05:23,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529438130] [2024-11-18 13:05:23,143 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-18 13:05:23,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:05:23,186 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-18 13:05:23,186 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:05:24,070 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-18 13:05:24,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:05:24,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529438130] [2024-11-18 13:05:24,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529438130] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:05:24,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416332404] [2024-11-18 13:05:24,071 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-18 13:05:24,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:05:24,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:05:24,073 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-18 13:05:24,074 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-18 13:05:24,985 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-18 13:05:24,985 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 13:05:24,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-18 13:05:24,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:05:25,004 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-18 13:05:25,008 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-18 13:05:25,028 INFO L349 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2024-11-18 13:05:25,028 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-18 13:05:25,031 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-18 13:05:25,034 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-18 13:05:25,044 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-18 13:05:25,044 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-18 13:05:25,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:05:25,056 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-18 13:05:25,060 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-18 13:05:25,069 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-18 13:05:25,173 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-18 13:05:25,173 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-18 13:05:25,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:05:25,180 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-18 13:05:25,281 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-18 13:05:25,281 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-18 13:05:25,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:05:25,287 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-18 13:05:25,421 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-18 13:05:25,421 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-18 13:05:25,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:05:25,428 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-18 13:05:25,512 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-18 13:05:25,512 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:05:33,984 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-18 13:05:33,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416332404] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:05:33,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:05:33,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 20 [2024-11-18 13:05:33,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180669201] [2024-11-18 13:05:33,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:05:33,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-18 13:05:33,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:05:33,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-18 13:05:33,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=319, Unknown=2, NotChecked=0, Total=380 [2024-11-18 13:05:33,987 INFO L87 Difference]: Start difference. First operand 287 states and 368 transitions. Second operand has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 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-18 13:05:34,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:05:34,711 INFO L93 Difference]: Finished difference Result 302 states and 384 transitions. [2024-11-18 13:05:34,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 13:05:34,711 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 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-18 13:05:34,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:05:34,715 INFO L225 Difference]: With dead ends: 302 [2024-11-18 13:05:34,715 INFO L226 Difference]: Without dead ends: 274 [2024-11-18 13:05:34,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=59, Invalid=319, Unknown=2, NotChecked=0, Total=380 [2024-11-18 13:05:34,717 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-18 13:05:34,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 301 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-18 13:05:34,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-18 13:05:34,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2024-11-18 13:05:34,770 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-18 13:05:34,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 354 transitions. [2024-11-18 13:05:34,771 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 354 transitions. Word has length 25 [2024-11-18 13:05:34,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:05:34,771 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 354 transitions. [2024-11-18 13:05:34,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 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-18 13:05:34,772 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 354 transitions. [2024-11-18 13:05:34,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-18 13:05:34,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:05:34,773 INFO L215 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-18 13:05:34,788 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-18 13:05:34,973 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-18 13:05:34,974 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-18 13:05:34,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:05:34,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1702665013, now seen corresponding path program 1 times [2024-11-18 13:05:34,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:05:34,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029926073] [2024-11-18 13:05:34,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:05:34,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:05:35,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:05:35,788 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-18 13:05:35,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:05:35,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029926073] [2024-11-18 13:05:35,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029926073] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:05:35,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751850561] [2024-11-18 13:05:35,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:05:35,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:05:35,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:05:35,790 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-18 13:05:35,791 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-18 13:05:35,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:05:35,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-18 13:05:35,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:05:35,983 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-18 13:05:35,989 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-18 13:05:35,996 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-18 13:05:36,017 INFO L349 Elim1Store]: treesize reduction 62, result has 7.5 percent of original size [2024-11-18 13:05:36,017 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-18 13:05:36,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:05:36,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:05:36,028 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-18 13:05:36,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:05:36,038 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-18 13:05:36,043 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-18 13:05:36,049 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-18 13:05:36,071 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-18 13:05:36,079 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-18 13:05:36,088 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-18 13:05:36,105 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-18 13:05:36,105 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-18 13:05:36,122 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-11-18 13:05:36,123 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-18 13:05:36,132 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-18 13:05:36,138 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-18 13:05:36,151 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-18 13:05:36,396 INFO L349 Elim1Store]: treesize reduction 92, result has 38.7 percent of original size [2024-11-18 13:05:36,396 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-18 13:05:36,421 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-18 13:05:36,421 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-18 13:05:36,444 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-18 13:05:36,445 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-18 13:05:39,970 INFO L349 Elim1Store]: treesize reduction 1668, result has 12.6 percent of original size [2024-11-18 13:05:39,970 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-18 13:05:40,047 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2024-11-18 13:05:40,047 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-18 13:05:40,078 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